{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":63,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":63,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"1fb3a78d8e29","filters":{"venue":"Adaptive Agents and Multi-Agents Systems"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Thomas Tran","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.113563233541252,"gpt":0.3651636397994741,"spread":0.2516004062582221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002559496,0.0005519363,0.0008890137,0.0005172355,0.0004645331,0.001321784,0.001067245,0.000893495,0.001778313],"category_scores_gemma":[0.008349744,0.0003486018,0.0004554184,0.0005312863,0.000518094,0.002047958,0.0006764324,0.0006831181,0.0004265255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006198,"about_ca_system_score_gemma":0.0004866681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002342929,"about_ca_topic_score_gemma":0.002097082,"domain_scores_codex":[0.9984536,0.0009237651,0.00006901405,0.0001492836,0.0002908156,0.0001134516],"domain_scores_gemma":[0.9955428,0.002512679,0.0006951884,0.0004160925,0.0005572406,0.0002760656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002766654,0.003748697,0.04023238,0.000322809,0.000373683,0.000487534,0.0009744634,0.617995,0.02352795,0.01655749,0.002250766,0.2907625],"study_design_scores_gemma":[0.0001204061,0.0004018582,0.002978183,0.000005321324,0.00003699633,0.00004692277,0.0000890436,0.9899997,0.001833916,0.003963933,0.0005044971,0.00001921175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6776165,0.000173507,0.316804,0.0004113466,0.00003131066,0.0001489887,0.00004536624,0.000909606,0.003859456],"genre_scores_gemma":[0.9766181,0.0000392886,0.02258101,0.00003539647,0.000009598171,0.00003660355,0.00002990356,0.00001797398,0.0006323274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002559496,"threshold_uncertainty_score":0.0135361,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yitao Liang","is_ca":false},{"name":"Marlos C. Machado","is_ca":true},{"name":"Erik Talvitie","is_ca":false},{"name":"Michael Bowling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04777979186199204,"gpt":0.2658761195988801,"spread":0.218096327736888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001011179,0.0009839527,0.0008579387,0.0002950404,0.0003411005,0.0009490675,0.001594134,0.0008724889,0.003084588],"category_scores_gemma":[0.002531181,0.0003408674,0.0004868247,0.0001886713,0.001053778,0.0009246762,0.001338967,0.00143883,0.0003572588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008763081,"about_ca_system_score_gemma":0.0009967914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007398173,"about_ca_topic_score_gemma":0.00714985,"domain_scores_codex":[0.9995986,0.0001051463,0.00002607116,0.00008634796,0.0001132641,0.00007049707],"domain_scores_gemma":[0.9990103,0.0005635775,0.00009765029,0.0001094855,0.0001426315,0.00007621785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001124057,0.00007172674,0.0004920569,0.0001027267,0.00004070289,0.00003639329,0.0000465412,0.9276539,0.001407924,0.01376504,0.0007427736,0.05552786],"study_design_scores_gemma":[0.000008784979,0.0000272353,0.00003756945,0.000004520301,0.000002742655,0.000003028125,0.000002231188,0.9974535,0.0002005523,0.002057937,0.0001994381,0.000002355564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0728725,0.0009609102,0.9098207,0.0004107554,0.0001075524,0.0001139233,0.00007527644,0.0007395375,0.01489879],"genre_scores_gemma":[0.9447827,0.0002412195,0.0521008,0.000103781,0.00003078856,0.00009298831,0.00007215355,0.00004738665,0.00252828],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007398173,"threshold_uncertainty_score":0.01471025,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Clement Gehring","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1078690293136804,"gpt":0.2926166985086204,"spread":0.18474766919494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582136,0.0008085276,0.001039074,0.0004860105,0.0002595262,0.0008500977,0.001126042,0.0008664833,0.001068099],"category_scores_gemma":[0.0105106,0.0004126291,0.0003986102,0.00041096,0.001678652,0.002003563,0.001535976,0.001419337,0.0001436716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008490774,"about_ca_system_score_gemma":0.000817303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001911263,"about_ca_topic_score_gemma":0.001289838,"domain_scores_codex":[0.9990346,0.0004134514,0.00005918626,0.0001525148,0.0002684823,0.00007181858],"domain_scores_gemma":[0.9947207,0.004011448,0.0004317104,0.000286229,0.0003455488,0.0002043418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001574397,0.00004524558,0.0007917265,0.00007360104,0.00003533576,0.00005279025,0.00007621475,0.923762,0.001859635,0.03672472,0.0002385094,0.03618286],"study_design_scores_gemma":[0.00001076811,0.00002396163,0.00004181733,0.000003476126,0.000002214634,0.000005833208,0.00000182899,0.9922647,0.0003455589,0.007216745,0.00007999109,0.000003091208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02723811,0.0002244694,0.971386,0.0001060827,0.00002711604,0.00002273341,0.0000103712,0.000154456,0.0008305316],"genre_scores_gemma":[0.8889738,0.0001686599,0.109204,0.0000594968,0.00003397859,0.0001096413,0.00003137017,0.00006312833,0.001355845],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002582136,"threshold_uncertainty_score":0.01365578,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Han Yu","is_ca":false},{"name":"Chunyan Miao","is_ca":false},{"name":"Zhiqi Shen","is_ca":false},{"name":"Cyril Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1176461571073611,"gpt":0.3282903362198304,"spread":0.2106441791124694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004403388,0.001366331,0.001530374,0.000989691,0.00108815,0.001823835,0.002659209,0.001490254,0.002346021],"category_scores_gemma":[0.01557188,0.0007649846,0.0005947038,0.001243135,0.001256207,0.002525923,0.002708607,0.001253591,0.0005014572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002145292,"about_ca_system_score_gemma":0.002280684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0047452,"about_ca_topic_score_gemma":0.003753712,"domain_scores_codex":[0.9967102,0.001496017,0.0001807034,0.0005517186,0.0007003491,0.0003610834],"domain_scores_gemma":[0.9943416,0.002909193,0.0008205727,0.0006649682,0.0006928081,0.0005707064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004229372,0.0001880454,0.001594936,0.0003366859,0.0001047493,0.0002065044,0.0004337767,0.8600773,0.008625615,0.04131631,0.003089421,0.08360375],"study_design_scores_gemma":[0.00004036492,0.00008462324,0.0005202192,0.00002475517,0.0000240944,0.00007415203,0.0001019096,0.9689842,0.001233415,0.02702923,0.001857722,0.00002531229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02507576,0.0006987401,0.9695058,0.0005519913,0.00008395174,0.0001954936,0.00006243858,0.0002501288,0.003575666],"genre_scores_gemma":[0.8544038,0.0005324752,0.140668,0.0001316275,0.0001281756,0.0002994293,0.00007389433,0.0001402888,0.003622381],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0047452,"threshold_uncertainty_score":0.02328759,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Han Yu","is_ca":false},{"name":"Chunyan Miao","is_ca":false},{"name":"Bo An","is_ca":false},{"name":"Zhiqi Shen","is_ca":false},{"name":"Cyril Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04947797062188094,"gpt":0.2924733497182121,"spread":0.2429953790963311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003324628,0.0008009181,0.001071056,0.0006102314,0.001145935,0.001419429,0.001937338,0.0008300276,0.002203779],"category_scores_gemma":[0.01079057,0.0004025478,0.0005269223,0.0005169149,0.001065809,0.001964272,0.002416355,0.0009560926,0.0005958061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181134,"about_ca_system_score_gemma":0.002072048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003713535,"about_ca_topic_score_gemma":0.004019673,"domain_scores_codex":[0.997531,0.001141445,0.0001259033,0.0004599222,0.0004285567,0.0003131612],"domain_scores_gemma":[0.9924411,0.003046504,0.0009863224,0.001629909,0.001104254,0.0007919106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000907689,0.0004604254,0.005671326,0.000371001,0.000141037,0.0003102294,0.001013874,0.7384146,0.02545378,0.02761446,0.004468575,0.195173],"study_design_scores_gemma":[0.00004251809,0.0001297155,0.0006253752,0.000007775799,0.00002729272,0.00007436121,0.0001058797,0.9871886,0.002190758,0.007973101,0.001609941,0.00002469678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1175784,0.0005069748,0.8740752,0.0004180897,0.00008601676,0.000184072,0.00005147496,0.0009701161,0.006129574],"genre_scores_gemma":[0.9492871,0.0000763526,0.04871238,0.00003258143,0.000029217,0.00007858832,0.00002676494,0.00003472435,0.001722315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003713535,"threshold_uncertainty_score":0.01758254,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yoad Lewenberg","is_ca":false},{"name":"Omer Lev","is_ca":true},{"name":"Jeffrey S. Rosenschein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1650542679779625,"gpt":0.302302601841162,"spread":0.1372483338631995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003370716,0.0003995259,0.0009988039,0.0006686558,0.001820772,0.002399034,0.001560019,0.001371736,0.01268126],"category_scores_gemma":[0.01586511,0.0002732828,0.0005284766,0.001147076,0.002155621,0.003206985,0.002607964,0.001512764,0.00127651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001409925,"about_ca_system_score_gemma":0.001048765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002931578,"about_ca_topic_score_gemma":0.005120604,"domain_scores_codex":[0.9957703,0.002658413,0.00009548613,0.0005326032,0.0003784283,0.0005647552],"domain_scores_gemma":[0.9933698,0.003226345,0.001309915,0.001375441,0.0002512397,0.0004670924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001995404,0.0006327385,0.03359247,0.0003285534,0.0003528612,0.0006891656,0.003210002,0.1964989,0.006179898,0.518308,0.01496721,0.2232448],"study_design_scores_gemma":[0.0009434771,0.0007024786,0.01099685,0.00007398811,0.0001500052,0.0004243941,0.002419562,0.5029799,0.003882863,0.4341561,0.04317996,0.00009044531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6542864,0.001062838,0.2628419,0.002756021,0.0001596576,0.0004602575,0.0003263694,0.0004452587,0.07766139],"genre_scores_gemma":[0.9825477,0.00006892704,0.01285714,0.000122777,0.00002710277,0.0000696989,0.00007441675,0.00003652172,0.004195666],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01268126,"threshold_uncertainty_score":0.04242301,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yundong Cai","is_ca":false},{"name":"Zhiqi Shen","is_ca":false},{"name":"Siyuan Liu","is_ca":false},{"name":"Han Yu","is_ca":false},{"name":"Xiaogang Han","is_ca":false},{"name":"Junhua Ji","is_ca":false},{"name":"Martin J. McKeown","is_ca":true},{"name":"Cyril Leung","is_ca":true},{"name":"Chunyan Miao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04910252149115665,"gpt":0.3015570224745988,"spread":0.2524545009834422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594726,0.0009234147,0.0004356177,0.0002855498,0.0004343919,0.0008924539,0.001100163,0.0009973604,0.004791009],"category_scores_gemma":[0.002392619,0.0001843307,0.0004065731,0.0001154527,0.0003793661,0.000779274,0.00107031,0.00081083,0.0005211567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004399549,"about_ca_system_score_gemma":0.0006325443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002443984,"about_ca_topic_score_gemma":0.002232194,"domain_scores_codex":[0.9996082,0.0001854761,0.00002825855,0.00006301395,0.00007744871,0.00003766821],"domain_scores_gemma":[0.9991749,0.0005066211,0.0000423598,0.00004145137,0.00007191982,0.000162692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006240709,0.00612242,0.01549678,0.00137677,0.0005129736,0.003598063,0.00282681,0.3470925,0.07016783,0.09354176,0.03825767,0.4147657],"study_design_scores_gemma":[0.0003352971,0.001011886,0.001780039,0.00006404562,0.00007699421,0.0003595498,0.000156059,0.9481142,0.005333843,0.01319578,0.02950852,0.00006377987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1900081,0.0007005768,0.7724027,0.002025979,0.000366136,0.001987205,0.0007183737,0.006162484,0.02562845],"genre_scores_gemma":[0.7085753,0.0003449291,0.2780421,0.0004650368,0.00004438597,0.001154733,0.0004395728,0.0001061684,0.01082782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004791009,"threshold_uncertainty_score":0.01602757,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Philipp W. Keller","is_ca":true},{"name":"Felix-Olivier Duguay","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1206537016970483,"gpt":0.3621967737325457,"spread":0.2415430720354974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001906884,0.000480651,0.0004781035,0.0004209942,0.0006020055,0.001308493,0.002116294,0.001090186,0.005308905],"category_scores_gemma":[0.002673995,0.0003741864,0.0004420556,0.0003408406,0.0005888349,0.001522915,0.001447163,0.001160005,0.001328036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006043168,"about_ca_system_score_gemma":0.001312817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001760792,"about_ca_topic_score_gemma":0.002035562,"domain_scores_codex":[0.9994739,0.0001760056,0.00003591879,0.00008974017,0.0001726774,0.00005187961],"domain_scores_gemma":[0.9986106,0.0004756019,0.0001524335,0.0002522203,0.000280527,0.0002285556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001184396,0.00148752,0.005191952,0.0004843237,0.0003229085,0.0006965006,0.0005455927,0.4340484,0.02326759,0.1406538,0.05336637,0.3387506],"study_design_scores_gemma":[0.000164482,0.0001504434,0.0003021513,0.00001526908,0.00003014788,0.000102873,0.00002806805,0.9403625,0.005649397,0.01150795,0.04166303,0.00002367386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05548918,0.0004005044,0.9025338,0.0006707748,0.0003165351,0.0007079121,0.000419085,0.01325236,0.02620987],"genre_scores_gemma":[0.3562359,0.0002298608,0.6250346,0.0003453502,0.00006532874,0.0005791138,0.0007510352,0.0004929606,0.01626581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005308905,"threshold_uncertainty_score":0.01776004,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gheorghe Comanici","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05548713756434804,"gpt":0.3163627497273219,"spread":0.2608756121629739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082137,0.001189238,0.001465055,0.00079528,0.0004419448,0.001030006,0.001571678,0.001459509,0.004694636],"category_scores_gemma":[0.007191912,0.0005578952,0.0005727783,0.0007114283,0.001409854,0.001326414,0.001395877,0.002507455,0.0006836968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001451451,"about_ca_system_score_gemma":0.001414925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003093485,"about_ca_topic_score_gemma":0.00223926,"domain_scores_codex":[0.9990702,0.0004071347,0.00005326107,0.0001511677,0.0002208646,0.00009743308],"domain_scores_gemma":[0.9972885,0.002113807,0.0001654905,0.0001094786,0.000226448,0.00009628199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008640675,0.0000929384,0.0003283193,0.00008829762,0.00004141103,0.00003113308,0.00006943924,0.8635923,0.0004243212,0.06594282,0.001609219,0.06769338],"study_design_scores_gemma":[0.0000204624,0.00001671238,0.00002193217,0.000006901428,0.000003713704,0.000004511725,0.00000350216,0.9754724,0.0001134768,0.02394746,0.0003851832,0.000003639451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005134111,0.0004003887,0.991503,0.0001692707,0.00004741728,0.0000595657,0.00002647261,0.0003059002,0.002353836],"genre_scores_gemma":[0.5969837,0.0008321248,0.3954748,0.0003412707,0.0001306455,0.0008130967,0.0002143644,0.0001987935,0.005011176],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004694636,"threshold_uncertainty_score":0.01570511,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Renee Jansen","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1323674272381753,"gpt":0.2951577467995893,"spread":0.1627903195614141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005490114,0.000765208,0.0007415045,0.0009782065,0.000797561,0.001434656,0.002180811,0.001314983,0.003170521],"category_scores_gemma":[0.002181361,0.0003967363,0.0006717158,0.0009629687,0.001396234,0.002474672,0.003167531,0.001729889,0.0009414374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006225847,"about_ca_system_score_gemma":0.0008234449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00185778,"about_ca_topic_score_gemma":0.001838238,"domain_scores_codex":[0.999015,0.0001622746,0.0000398472,0.0003214174,0.0004034205,0.0000580124],"domain_scores_gemma":[0.9992301,0.0002626917,0.00007986379,0.0001948984,0.0001622642,0.0000702723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001511224,0.0001863975,0.0008255196,0.0004091193,0.0001301675,0.0003751805,0.0009676498,0.246939,0.02939702,0.246143,0.0100228,0.464453],"study_design_scores_gemma":[0.00005651986,0.000174216,0.0003004647,0.00004122528,0.00004981244,0.0005199419,0.0001262138,0.8097226,0.005056648,0.1196816,0.06422662,0.00004412312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002962867,0.0002919395,0.9918932,0.0002148068,0.0001071302,0.00004028463,0.00002329362,0.0003071445,0.004159376],"genre_scores_gemma":[0.1256427,0.0007574083,0.861864,0.0003214589,0.0002175181,0.0003395846,0.0001283807,0.0001508638,0.01057812],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003170521,"threshold_uncertainty_score":0.01060647,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alan Tsang","is_ca":true},{"name":"Kate Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04929803298486006,"gpt":0.293394228016417,"spread":0.2440961950315569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581433,0.0003223624,0.0007706027,0.0007386087,0.001044913,0.001827907,0.0009646455,0.001470197,0.004391034],"category_scores_gemma":[0.008184093,0.0003203707,0.0005707638,0.0007004481,0.001748,0.003684202,0.001235025,0.0009435221,0.0003834672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006340472,"about_ca_system_score_gemma":0.0003261875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001861966,"about_ca_topic_score_gemma":0.001986823,"domain_scores_codex":[0.9987977,0.000723196,0.00002977986,0.0002342609,0.00009954919,0.0001155194],"domain_scores_gemma":[0.9946283,0.003541053,0.0009503564,0.0004164567,0.0001655965,0.0002983052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003646372,0.0001871054,0.02231931,0.0001681441,0.0001735984,0.000529233,0.001607948,0.1253078,0.003479823,0.8104728,0.004280685,0.03110873],"study_design_scores_gemma":[0.0001003272,0.0001354545,0.006181791,0.00004057594,0.00008772666,0.0002592357,0.0004769484,0.6194444,0.0005765533,0.3677379,0.004908955,0.00005000097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7412129,0.0008656871,0.2298139,0.0035624,0.00009398723,0.0001046126,0.000231184,0.0001126878,0.02400256],"genre_scores_gemma":[0.9932576,0.0001808523,0.004462499,0.0001113315,0.00004323251,0.00004019082,0.00003442126,0.000006861965,0.001862974],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004391034,"threshold_uncertainty_score":0.01468951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Natalie Fridman","is_ca":false},{"name":"Gal A. Kaminka","is_ca":false},{"name":"Avishay Zilka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04528727989469312,"gpt":0.3138364174435642,"spread":0.2685491375488711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004320827,0.0003492025,0.0003117271,0.001559686,0.0007658321,0.001049296,0.0007691453,0.0006257771,0.002395728],"category_scores_gemma":[0.03993119,0.0002705011,0.0004905833,0.001799107,0.001344111,0.001495185,0.001404299,0.0009241474,0.0003980152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007679354,"about_ca_system_score_gemma":0.0005662665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007777893,"about_ca_topic_score_gemma":0.006827585,"domain_scores_codex":[0.996572,0.002329847,0.0001546165,0.0003646381,0.0004222216,0.0001567834],"domain_scores_gemma":[0.9394636,0.04901396,0.004635884,0.003136143,0.003081897,0.0006685868],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002367929,0.0006905707,0.9630573,0.0001340561,0.0002480799,0.0002043329,0.005787956,0.01040053,0.0005573351,0.002011828,0.0007554845,0.01591563],"study_design_scores_gemma":[0.00003665632,0.0008463241,0.9013281,0.0001451152,0.0002032972,0.0005567819,0.01809627,0.07050879,0.002103932,0.002678023,0.0034114,0.0000852942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9960758,0.00009948357,0.001402075,0.00007407346,0.000003900195,0.00004526936,0.0002083082,0.000007289679,0.002083753],"genre_scores_gemma":[0.999017,0.00007672536,0.0005249621,0.00001779618,0.000004196285,0.00004158366,0.0001251538,0.00000467397,0.0001879036],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007777893,"threshold_uncertainty_score":0.02285099,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pooyan Fazli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07079121496115787,"gpt":0.2913392058689059,"spread":0.220547990907748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001428767,0.001712676,0.001936672,0.001819974,0.001074597,0.001924708,0.002754303,0.001776288,0.004517135],"category_scores_gemma":[0.006691925,0.0006215981,0.0008697124,0.004365455,0.002089868,0.003533225,0.003964554,0.001856015,0.001111072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001412073,"about_ca_system_score_gemma":0.0006710588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004891755,"about_ca_topic_score_gemma":0.002451804,"domain_scores_codex":[0.9974044,0.0008286016,0.0000897564,0.0005953413,0.0007910698,0.0002907717],"domain_scores_gemma":[0.9965482,0.002125901,0.0002925801,0.000459004,0.0003733593,0.000200876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002250882,0.00004559088,0.001012048,0.0004951509,0.0001609023,0.0003921058,0.0002204998,0.7175834,0.002716575,0.1368448,0.01240351,0.1279004],"study_design_scores_gemma":[0.00004836491,0.000109474,0.0005861102,0.0001216233,0.00005194511,0.0003859526,0.00008797012,0.801451,0.00151511,0.1648439,0.03076046,0.00003812884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006306921,0.008904674,0.9708134,0.0006821508,0.0002597161,0.00009875478,0.0001957162,0.000343604,0.01239519],"genre_scores_gemma":[0.6233835,0.01970347,0.3363891,0.0009326331,0.001441495,0.0006942129,0.001093909,0.0004637364,0.01589797],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004891755,"threshold_uncertainty_score":0.01511133,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Common value auction; Mathematics; Statistics","authors":[{"name":"Alexander Kreß","is_ca":true},{"name":"Craig Boutilier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2353454774043542,"gpt":0.4198643718112466,"spread":0.1845188944068924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01220002,0.0008985068,0.001693371,0.0009689531,0.0008827859,0.004356753,0.003593353,0.003476415,0.003670475],"category_scores_gemma":[0.1255594,0.001179963,0.00115666,0.002461654,0.003866718,0.01033208,0.002291957,0.003269486,0.0002032199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002226027,"about_ca_system_score_gemma":0.001842594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002088626,"about_ca_topic_score_gemma":0.001410163,"domain_scores_codex":[0.989277,0.006856459,0.0005056979,0.0008787259,0.002003806,0.0004783901],"domain_scores_gemma":[0.7282855,0.2542216,0.006336547,0.00679024,0.003503677,0.0008625486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007428083,0.0003228002,0.002232757,0.0008866044,0.0001990162,0.0004506471,0.001508806,0.3073881,0.004160646,0.6218527,0.001269549,0.0589857],"study_design_scores_gemma":[0.0001235731,0.0002444496,0.001052696,0.0000917756,0.00007966032,0.0002175559,0.0002613926,0.5856417,0.001353498,0.4093725,0.001500318,0.00006088931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1645128,0.002727354,0.8137277,0.001742649,0.00008437953,0.0001678675,0.0001034149,0.0001029562,0.01683087],"genre_scores_gemma":[0.9070652,0.000969835,0.08726253,0.0001624628,0.0001984737,0.0001070276,0.00006791633,0.00003630338,0.004130301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01220002,"threshold_uncertainty_score":0.06452066,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ambroise Ncho","is_ca":true},{"name":"Esma Aı̈meur","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0593280038444144,"gpt":0.3003480340789453,"spread":0.2410200302345309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003249166,0.0004541204,0.0008054237,0.0005168671,0.001953518,0.002843529,0.001885788,0.002185568,0.002869279],"category_scores_gemma":[0.004700444,0.0006073936,0.0007857617,0.0004466693,0.001047695,0.003477038,0.00314562,0.002526548,0.001423864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005632631,"about_ca_system_score_gemma":0.001409799,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001908183,"about_ca_topic_score_gemma":0.001952906,"domain_scores_codex":[0.9981431,0.0007716895,0.0001907157,0.0002175492,0.0005614514,0.0001154899],"domain_scores_gemma":[0.9988342,0.0005053823,0.00008136121,0.0001980604,0.0002454182,0.0001356771],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006194962,0.0008800938,0.003646541,0.0004941999,0.0002783958,0.002359912,0.003290313,0.266064,0.0860257,0.2827151,0.01247505,0.3411512],"study_design_scores_gemma":[0.00008548889,0.00009951445,0.0001986143,0.00003927603,0.00005167519,0.0002190117,0.0001012563,0.9236047,0.01436047,0.03086824,0.03032604,0.0000457418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0130874,0.0001995039,0.9793474,0.0002977309,0.00009025069,0.0003172713,0.00001545805,0.002388967,0.004256113],"genre_scores_gemma":[0.2130123,0.0002178514,0.7818255,0.0001772818,0.00007213539,0.0004463769,0.00008744805,0.0002171704,0.00394395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003249166,"threshold_uncertainty_score":0.01718342,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kiam-Tian Seow","is_ca":false},{"name":"Chuan Ma","is_ca":true},{"name":"Makoto Yokoo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07099639763208417,"gpt":0.2985471640996341,"spread":0.22755076646755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527131,0.0007809537,0.0004782371,0.0005889413,0.0004401785,0.001488925,0.001056439,0.0009028083,0.003761541],"category_scores_gemma":[0.00123019,0.0003448018,0.0006482849,0.000451961,0.001902687,0.00165464,0.001229138,0.001237899,0.0006624818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310346,"about_ca_system_score_gemma":0.001356851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002096495,"about_ca_topic_score_gemma":0.002265585,"domain_scores_codex":[0.9992959,0.0002267922,0.00004693021,0.0001455759,0.0002408857,0.00004387563],"domain_scores_gemma":[0.9994398,0.0003068648,0.00005614834,0.00008501975,0.00007721575,0.00003502152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001863637,0.00001968066,0.00007420318,0.0001543246,0.00002008135,0.00009809824,0.0001433907,0.1230336,0.001890598,0.8282269,0.0011085,0.04521207],"study_design_scores_gemma":[0.00004410941,0.00006272214,0.00008163488,0.0001102007,0.00003281859,0.00008189579,0.00006494016,0.3165933,0.002959336,0.6037605,0.07617909,0.00002939733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001066666,0.001141567,0.9810452,0.0004332183,0.0001426809,0.00004835585,0.00001984087,0.0001818,0.01592065],"genre_scores_gemma":[0.2512694,0.005185116,0.7209209,0.0005362873,0.0003891768,0.0005650084,0.0001487129,0.0001635048,0.02082188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003761541,"threshold_uncertainty_score":0.01258355,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pablo Samuel Castro","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1285799627275599,"gpt":0.3554582096881,"spread":0.2268782469605402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004637215,0.002022827,0.002214516,0.00130443,0.0008901631,0.00172718,0.002062066,0.002283677,0.007484165],"category_scores_gemma":[0.01857434,0.001103491,0.001503244,0.00103028,0.00263785,0.003376481,0.004161487,0.003420376,0.001074093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00242865,"about_ca_system_score_gemma":0.00251479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004545149,"about_ca_topic_score_gemma":0.003333232,"domain_scores_codex":[0.9977486,0.001232463,0.0001433554,0.0003582244,0.0003483729,0.0001690841],"domain_scores_gemma":[0.9905217,0.007532929,0.0006161057,0.0005394231,0.0005071627,0.0002827001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004522041,0.00003319702,0.0001539274,0.00007328436,0.00003215767,0.00003941931,0.00005855825,0.9152627,0.0002838707,0.07266043,0.0003094513,0.01104777],"study_design_scores_gemma":[0.00001642034,0.00002177638,0.00001312821,0.00001327908,0.000005537146,0.000006381877,0.000005846568,0.9485861,0.0001748663,0.05065836,0.0004915995,0.000006607104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007041451,0.00021767,0.988479,0.0002509709,0.00004409962,0.00007835201,0.00005572907,0.0002901336,0.003542606],"genre_scores_gemma":[0.6509995,0.0008191057,0.3404536,0.0004276528,0.0001078186,0.001340536,0.0003317142,0.0004451838,0.005074942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007484165,"threshold_uncertainty_score":0.02503705,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Andrew Perrault","is_ca":true},{"name":"Joanna Drummond","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08909092805595974,"gpt":0.2513758493690016,"spread":0.1622849213130419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008285511,0.0009868479,0.002206283,0.001002262,0.002284591,0.003834478,0.002462986,0.003214592,0.008157583],"category_scores_gemma":[0.04524856,0.0008106859,0.002046382,0.001751966,0.00382121,0.007815083,0.003612622,0.003033696,0.000824853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001122053,"about_ca_system_score_gemma":0.002406061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001234751,"about_ca_topic_score_gemma":0.000718026,"domain_scores_codex":[0.9920686,0.004026376,0.0006474351,0.0016989,0.0008050171,0.0007536492],"domain_scores_gemma":[0.9588304,0.03253428,0.003373004,0.002820947,0.0009972069,0.001444188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005361444,0.0004419333,0.004786936,0.0004878239,0.0003509088,0.0006145879,0.001508443,0.1222094,0.003214033,0.8024462,0.004178221,0.05922533],"study_design_scores_gemma":[0.0002005172,0.0001294762,0.0003126884,0.00003866778,0.00003764603,0.0002095902,0.0002076445,0.1771655,0.0008735325,0.8190719,0.001722155,0.00003059136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2341883,0.0004118355,0.7507626,0.002397568,0.00005217652,0.0004507147,0.0005252182,0.0003083432,0.0109034],"genre_scores_gemma":[0.8219425,0.0004826865,0.1712355,0.0005323016,0.0001197503,0.0005181155,0.0005803183,0.0001110293,0.004477761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008285511,"threshold_uncertainty_score":0.04381847,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Marek Grześ","is_ca":true},{"name":"Jesse Hoey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1242030640907431,"gpt":0.2922210493630056,"spread":0.1680179852722625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00231834,0.0009939711,0.001227201,0.000551354,0.0006931092,0.001295482,0.001602339,0.00115221,0.006485067],"category_scores_gemma":[0.006433127,0.0006776581,0.0009537865,0.0008113621,0.001883533,0.002297632,0.001998667,0.001608168,0.001214496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001307407,"about_ca_system_score_gemma":0.002588694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003253119,"about_ca_topic_score_gemma":0.004750637,"domain_scores_codex":[0.9984754,0.0006714217,0.00007578097,0.000387853,0.0002177898,0.0001716507],"domain_scores_gemma":[0.9972608,0.001939329,0.0002096124,0.0003195007,0.0001778912,0.00009295864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000194701,0.00007243508,0.0004244225,0.0002175092,0.00003947432,0.0001133079,0.0001376161,0.8238164,0.001334257,0.1013167,0.003045019,0.06928816],"study_design_scores_gemma":[0.00003285994,0.00004773166,0.00008069953,0.00001918501,0.00001103802,0.00003192512,0.00002818847,0.9066634,0.001549079,0.08909764,0.002427042,0.00001124905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01227435,0.0002920233,0.9777425,0.0002677164,0.00002701994,0.00009720672,0.0001248149,0.0009348306,0.008239472],"genre_scores_gemma":[0.3941182,0.000400326,0.597923,0.0002227628,0.00003672107,0.0004050702,0.0003705119,0.0003916145,0.006131679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006485067,"threshold_uncertainty_score":0.02169472,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nolan Bard","is_ca":true},{"name":"Deon Nicholas","is_ca":true},{"name":"Csaba Szepesvaári","is_ca":true},{"name":"Michael Bowling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2497690893926628,"gpt":0.4187938455534094,"spread":0.1690247561607466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002952464,0.001273405,0.001643882,0.001588466,0.000812859,0.002099866,0.002332961,0.001638733,0.006819587],"category_scores_gemma":[0.01401228,0.0006007737,0.001292517,0.001274148,0.002225308,0.003179819,0.001968236,0.002031415,0.001123969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003051977,"about_ca_system_score_gemma":0.001415724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002334068,"about_ca_topic_score_gemma":0.002478269,"domain_scores_codex":[0.9975185,0.00127533,0.0001333201,0.0005481357,0.0003337655,0.0001909701],"domain_scores_gemma":[0.9943841,0.003404736,0.0005522498,0.0007792725,0.0004972545,0.0003823845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001214634,0.0001007905,0.001394223,0.000122812,0.0001055077,0.00009136358,0.0003336427,0.5122244,0.0009379296,0.4528886,0.001970791,0.02970851],"study_design_scores_gemma":[0.00002818421,0.00003491839,0.0002671182,0.00001751408,0.000013778,0.00003532767,0.00006872322,0.7535385,0.0002686241,0.2446083,0.001104012,0.00001510282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04918781,0.0002023465,0.9407358,0.0004313722,0.00002236161,0.0002344175,0.0001740428,0.0001889858,0.008822905],"genre_scores_gemma":[0.7118716,0.0004456554,0.2766245,0.0002262368,0.00004876075,0.0005891123,0.000600035,0.0001153037,0.009478743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006819587,"threshold_uncertainty_score":0.02281374,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Igor Kiselev","is_ca":true},{"name":"Pascal Poupart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03596804359116691,"gpt":0.2878306369712302,"spread":0.2518625933800633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002307604,0.001027224,0.00154974,0.00072295,0.0005871528,0.001444503,0.00213118,0.001488845,0.002456649],"category_scores_gemma":[0.008791993,0.0009983853,0.001265553,0.0008673642,0.002164701,0.001734786,0.00224847,0.002554654,0.0003007935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001961825,"about_ca_system_score_gemma":0.002474535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01225253,"about_ca_topic_score_gemma":0.01078256,"domain_scores_codex":[0.9990145,0.0003943314,0.00003989859,0.0002065785,0.0002346467,0.0001100444],"domain_scores_gemma":[0.9966587,0.002694343,0.00018808,0.0001939857,0.0001713958,0.00009347894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002232751,0.0000129799,0.000193637,0.00003077038,0.00001691233,0.00002006206,0.0000339364,0.9727623,0.0002128758,0.01948529,0.0002251341,0.006983835],"study_design_scores_gemma":[0.000003645295,0.000003937781,0.00001971305,0.000002541651,0.000002473116,0.000003633065,0.00000361859,0.9902439,0.0001117586,0.009500965,0.000101657,0.000002336861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004550365,0.00008784854,0.9943606,0.00011042,0.000009717322,0.00001698866,0.00003099137,0.0001736226,0.0006594795],"genre_scores_gemma":[0.6322411,0.0003149812,0.3644221,0.0001941363,0.00006045734,0.000231506,0.0002357428,0.0002197969,0.002080194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01225253,"threshold_uncertainty_score":0.02436244,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Population; Risk analysis (engineering); Business","authors":[{"name":"Reid Kerr","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3996401673442485,"gpt":0.4423090878843384,"spread":0.04266892054008997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002326048,0.000802066,0.001039644,0.002718257,0.001439667,0.001481881,0.002231938,0.001884438,0.001342249],"category_scores_gemma":[0.01470955,0.0004736847,0.0008879086,0.001269067,0.001272685,0.002724059,0.003403023,0.001391549,0.0005772567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005347179,"about_ca_system_score_gemma":0.001255037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001709632,"about_ca_topic_score_gemma":0.001849927,"domain_scores_codex":[0.9971582,0.0007998178,0.0001769769,0.0006995128,0.0009384426,0.0002270646],"domain_scores_gemma":[0.9909019,0.004686658,0.00130646,0.00156244,0.001180034,0.0003624317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006291617,0.0006274734,0.05095558,0.0007260136,0.0004333718,0.001404386,0.002596264,0.1546827,0.05574204,0.1094366,0.005964688,0.6168019],"study_design_scores_gemma":[0.00005870168,0.0003428223,0.006831598,0.00009103669,0.0001278161,0.001555489,0.001279452,0.848587,0.04388838,0.08684842,0.01029134,0.00009807534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08242783,0.00019182,0.9121755,0.0003018508,0.00005080615,0.0002984053,0.0001438715,0.000594568,0.003815313],"genre_scores_gemma":[0.4814788,0.0001625901,0.5152762,0.0001201957,0.0000296729,0.0001914499,0.0002905879,0.0000482659,0.002402273],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002718257,"threshold_uncertainty_score":0.01230145,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Stereotype (UML); Compactification (mathematics); Computer science; k-nearest neighbors algorithm; Artificial intelligence; Econometrics; Mathematics","authors":[{"name":"Jörg Denzinger","is_ca":true},{"name":"Jasmine Hamdan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1938495909650498,"gpt":0.3111745553459577,"spread":0.1173249643809078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003239895,0.001147699,0.001165895,0.0007395786,0.0005813338,0.002182742,0.003021868,0.001316394,0.002316838],"category_scores_gemma":[0.01635346,0.0008005312,0.001795562,0.0007023923,0.001333487,0.007947474,0.002539585,0.00197657,0.0004842489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144831,"about_ca_system_score_gemma":0.001238185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009808807,"about_ca_topic_score_gemma":0.007078697,"domain_scores_codex":[0.9980508,0.0007272869,0.0001865095,0.0004152606,0.0004762346,0.0001438513],"domain_scores_gemma":[0.9883184,0.005659228,0.0019522,0.002876541,0.0008741943,0.0003193459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001621847,0.0001023955,0.003684137,0.00007858052,0.00007086786,0.0001621619,0.0006798201,0.8976704,0.002168624,0.05905817,0.0003298603,0.03583284],"study_design_scores_gemma":[0.000010708,0.00003270484,0.0001702533,0.00001148535,0.00001042595,0.00002122803,0.00004358968,0.9780648,0.0007197041,0.02035689,0.0005462838,0.00001191246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03425732,0.00009042827,0.9633664,0.0001745349,0.00002965262,0.00005093586,0.00008375652,0.0002852762,0.00166164],"genre_scores_gemma":[0.6105336,0.0002633163,0.386506,0.00009998563,0.00004975327,0.0001991055,0.0003172582,0.0001141268,0.001916818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009808807,"threshold_uncertainty_score":0.01950341,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mohammad Moshirpour","is_ca":true},{"name":"Nariman Mani","is_ca":true},{"name":"Armin Eberlein","is_ca":false},{"name":"Behrouz H. Far","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1820800483831218,"gpt":0.3285164316386605,"spread":0.1464363832555388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354476,0.001072688,0.0008430314,0.001720632,0.0007115117,0.001861759,0.001790548,0.001650098,0.002520009],"category_scores_gemma":[0.004309903,0.0006585781,0.001560871,0.0006768294,0.0009248154,0.002072737,0.00156468,0.002051474,0.0005450984],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001285599,"about_ca_system_score_gemma":0.001448084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003913532,"about_ca_topic_score_gemma":0.00437767,"domain_scores_codex":[0.998487,0.0004090705,0.0001098245,0.0002285029,0.0006839501,0.00008154231],"domain_scores_gemma":[0.9978406,0.001189973,0.000255969,0.0002965186,0.0003599741,0.00005695107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001252445,0.0002888571,0.003547436,0.0004600273,0.0002090912,0.000879897,0.0007169367,0.6911109,0.02165355,0.1838007,0.002713026,0.09449434],"study_design_scores_gemma":[0.0000168273,0.00004221109,0.0001750738,0.00002658291,0.00003158695,0.00009533769,0.00004755313,0.9678403,0.00367327,0.02419487,0.003839049,0.00001723108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002683385,0.0001075808,0.9941218,0.0001189271,0.00002342392,0.00009378089,0.00004633105,0.0008754301,0.0019292],"genre_scores_gemma":[0.2057704,0.0003639695,0.7899628,0.0001452836,0.00003890378,0.0005776528,0.0002443707,0.0001587759,0.002737897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003913532,"threshold_uncertainty_score":0.00932771,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vivek Veeriah","is_ca":true},{"name":"Harm van Seijen","is_ca":true},{"name":"Richard S. Sutton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07223075096191683,"gpt":0.309418597286914,"spread":0.2371878463249972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095745,0.001272914,0.001140224,0.0004254496,0.0003907899,0.0008706378,0.001360384,0.001461228,0.003032416],"category_scores_gemma":[0.005353895,0.0006177289,0.0006460789,0.0004560518,0.001348142,0.0008851603,0.001013369,0.002699631,0.0006850052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001130788,"about_ca_system_score_gemma":0.001255666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005234078,"about_ca_topic_score_gemma":0.005072001,"domain_scores_codex":[0.9994042,0.0002346152,0.00003189821,0.0001152634,0.0001655959,0.0000484274],"domain_scores_gemma":[0.9981445,0.001283036,0.0001143095,0.0001393685,0.0002612906,0.00005742716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005019353,0.00003140309,0.0003281649,0.00009744124,0.00004120558,0.00006907418,0.00005438037,0.932126,0.001105016,0.02980837,0.001065175,0.03522356],"study_design_scores_gemma":[0.000005012286,0.000008953005,0.00001824987,0.000004313577,0.000003037503,0.000005740419,0.00000127468,0.9954477,0.0002034846,0.003933962,0.0003654593,0.000002773993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002729315,0.0003739716,0.9944875,0.0001342055,0.0000504233,0.00003014801,0.00001547704,0.0002610091,0.001918021],"genre_scores_gemma":[0.6596587,0.0008231437,0.3271463,0.0002909299,0.0001054662,0.0003801984,0.0001092064,0.0001953567,0.0112907],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005234078,"threshold_uncertainty_score":0.01108348,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Reid Kerr","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07904217333949029,"gpt":0.3523602975403669,"spread":0.2733181242008766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007742876,0.0009770688,0.002093021,0.00448308,0.002267329,0.004161078,0.003371357,0.002684174,0.006105537],"category_scores_gemma":[0.04549046,0.0009084507,0.001768058,0.002906123,0.003401781,0.005866178,0.006163544,0.003096492,0.002194802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002279724,"about_ca_system_score_gemma":0.002373409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003651302,"about_ca_topic_score_gemma":0.00257517,"domain_scores_codex":[0.9934002,0.002501873,0.0003005077,0.001696762,0.001610359,0.0004902868],"domain_scores_gemma":[0.9748437,0.01513702,0.00195737,0.004611194,0.002731732,0.0007190363],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002351964,0.0002586716,0.01279734,0.000413878,0.0002276258,0.0002615152,0.001037705,0.06810211,0.004386622,0.3343645,0.01581169,0.562103],"study_design_scores_gemma":[0.0000378303,0.00009432791,0.003128899,0.0001141962,0.00004875059,0.0006042646,0.000638906,0.6264406,0.005764567,0.3424383,0.02061413,0.00007516469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01604386,0.001130088,0.9715646,0.001526969,0.0002190937,0.0002273121,0.0002195313,0.0004383114,0.008630357],"genre_scores_gemma":[0.3737678,0.001320726,0.6075023,0.0004491814,0.0003045255,0.0003956202,0.0009453128,0.0002102552,0.01510426],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007742876,"threshold_uncertainty_score":0.04094875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alan Tsang","is_ca":true},{"name":"John A. Doucette","is_ca":true},{"name":"Hadi Hosseini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08594709231979451,"gpt":0.3299775380734479,"spread":0.2440304457536534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01751661,0.001337535,0.002473624,0.003628959,0.001508331,0.00570821,0.00331244,0.004993869,0.003195331],"category_scores_gemma":[0.1584819,0.001011576,0.001389927,0.00255631,0.005347739,0.01273717,0.004579554,0.003615242,0.0004247716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001922212,"about_ca_system_score_gemma":0.001309957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001346432,"about_ca_topic_score_gemma":0.001057705,"domain_scores_codex":[0.9885672,0.007872353,0.0003592967,0.001422202,0.001411537,0.0003673066],"domain_scores_gemma":[0.8398546,0.1413383,0.008401352,0.006819249,0.002614151,0.000972294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008251036,0.0002380179,0.01821388,0.0004825782,0.0004961892,0.0003190599,0.001161038,0.3961308,0.001876038,0.484292,0.002552429,0.09341295],"study_design_scores_gemma":[0.00006520901,0.00004889624,0.0007539132,0.00005572003,0.00003330913,0.00003585506,0.0000674496,0.7277826,0.0005507334,0.2697916,0.0007938657,0.00002083066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1382349,0.0009338257,0.8524987,0.002685877,0.00009567162,0.0001181458,0.0002444221,0.0002504514,0.004938082],"genre_scores_gemma":[0.9265347,0.0003252061,0.07114404,0.0001989446,0.0002160765,0.0001660802,0.0003657529,0.00007877649,0.0009705203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01751661,"threshold_uncertainty_score":0.09263784,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"T. Mora","is_ca":true},{"name":"A.B. Sesay","is_ca":true},{"name":"Jörg Denzinger","is_ca":true},{"name":"H. Golshan","is_ca":true},{"name":"G. Poissant","is_ca":true},{"name":"C. Konecnik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3490364379878854,"gpt":0.4289179732325101,"spread":0.07988153524462477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410187,0.0006936186,0.0007207645,0.0006474495,0.0005033999,0.0007743639,0.001229651,0.0009019979,0.001523693],"category_scores_gemma":[0.003216414,0.0003392722,0.0004785905,0.0007126371,0.0007885357,0.0009698998,0.001305361,0.0006777669,0.0001926433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006357142,"about_ca_system_score_gemma":0.0009557661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003339296,"about_ca_topic_score_gemma":0.002309274,"domain_scores_codex":[0.9994814,0.0002017029,0.00002278843,0.0000896177,0.0001521066,0.00005244961],"domain_scores_gemma":[0.9988808,0.000682065,0.0001166436,0.00009171149,0.0001679079,0.00006081661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006676248,0.0000712435,0.0004009157,0.00006041066,0.00003789231,0.00007241954,0.00008250358,0.9535618,0.002836538,0.01094944,0.000427557,0.03143262],"study_design_scores_gemma":[0.00001596956,0.00004245638,0.00004844414,0.000002166896,0.000006879016,0.00001247281,0.00001121261,0.9958512,0.0006011878,0.003013004,0.0003918353,0.00000323285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06406089,0.0003208555,0.9304616,0.0001645148,0.00002367678,0.00008451047,0.00002189017,0.0002544486,0.004607649],"genre_scores_gemma":[0.8499935,0.0001857603,0.1471477,0.000053207,0.00001849144,0.0002030228,0.00004192939,0.00003366741,0.002322815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003339296,"threshold_uncertainty_score":0.007457852,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xinjia Yu","is_ca":false},{"name":"Charles T. Salmon","is_ca":false},{"name":"Cyril Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1652682457520546,"gpt":0.3399170186184293,"spread":0.1746487728663747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006438307,0.0003249008,0.0001473144,0.0001742068,0.0005477415,0.001236421,0.0002533015,0.0004834775,0.002441384],"category_scores_gemma":[0.002652464,0.0001186512,0.0001678343,0.00008914161,0.0007200138,0.0007940056,0.001106504,0.0003273271,0.000356243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002319749,"about_ca_system_score_gemma":0.0001632927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005289652,"about_ca_topic_score_gemma":0.0005238271,"domain_scores_codex":[0.9995294,0.0003454602,0.0000157458,0.00003251898,0.00005015787,0.00002676771],"domain_scores_gemma":[0.9991993,0.0004264833,0.0001187951,0.00004653927,0.0001054393,0.0001034453],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.002867572,0.001269975,0.06604342,0.00180407,0.0004982658,0.008674522,0.1699757,0.02865769,0.1723696,0.09397936,0.02042165,0.4334382],"study_design_scores_gemma":[0.0004855033,0.004813132,0.1184413,0.0009044845,0.0007604834,0.01168622,0.1100642,0.1873561,0.03824127,0.1524289,0.374382,0.0004363725],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9006586,0.002266056,0.04933836,0.001285044,0.0001697149,0.00007892177,0.00003448826,0.000188721,0.04598005],"genre_scores_gemma":[0.9877326,0.0003433894,0.006964282,0.0001916792,0.00002239571,0.00002600957,0.00001660945,0.00001141202,0.004691597],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002441384,"threshold_uncertainty_score":0.008167207,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Graham Pinhey","is_ca":true},{"name":"John A. Doucette","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03835147418583962,"gpt":0.2688820053874795,"spread":0.2305305312016399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001558054,0.0005229035,0.0007052809,0.0003465046,0.0007484027,0.00097973,0.001707654,0.0007189791,0.001603286],"category_scores_gemma":[0.003191852,0.0003119965,0.000489757,0.000428851,0.000697238,0.00131491,0.001529228,0.001295015,0.0003752201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005193638,"about_ca_system_score_gemma":0.0008043001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008050477,"about_ca_topic_score_gemma":0.001002047,"domain_scores_codex":[0.9988602,0.0004709465,0.00006987039,0.0002063503,0.00028295,0.0001096196],"domain_scores_gemma":[0.9989192,0.0005076012,0.0001183227,0.0002238543,0.0001352071,0.00009581075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004365607,0.0003153251,0.0007656147,0.0002947203,0.0001616934,0.0005591534,0.0005194743,0.6521876,0.02875163,0.1234393,0.002986855,0.189582],"study_design_scores_gemma":[0.00005960205,0.00007396615,0.0001261281,0.00001169023,0.00002492217,0.0001144753,0.00003186892,0.9652556,0.003053246,0.0242748,0.006959204,0.00001448914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007384953,0.0002592992,0.990284,0.00008274998,0.00005534155,0.0000450046,0.000004879813,0.0001712556,0.001712498],"genre_scores_gemma":[0.5910669,0.0002955841,0.4026068,0.000153966,0.0001167082,0.0002691893,0.00003238881,0.00008893329,0.005369549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001707654,"threshold_uncertainty_score":0.008239865,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Giuseppe De Giacomo","is_ca":false},{"name":"Yves Lespérance","is_ca":true},{"name":"Fabio Patrizi","is_ca":false},{"name":"Stavros Vassos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03857713149392297,"gpt":0.2800804080179356,"spread":0.2415032765240126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007826946,0.00101814,0.0009589631,0.001814653,0.001667738,0.00356416,0.002601558,0.001469784,0.003538735],"category_scores_gemma":[0.03104356,0.0008266337,0.002975083,0.001079281,0.005532158,0.009025323,0.004221375,0.004063621,0.0004743644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003200988,"about_ca_system_score_gemma":0.004659688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01123619,"about_ca_topic_score_gemma":0.005969441,"domain_scores_codex":[0.991975,0.002022882,0.0005490981,0.001502862,0.002855953,0.001094318],"domain_scores_gemma":[0.9786656,0.01501308,0.001708345,0.001887209,0.002023579,0.0007021933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003105234,0.000131731,0.002549875,0.0002438682,0.0001340739,0.001136655,0.00198181,0.09036722,0.009570187,0.8713337,0.0007111956,0.02152931],"study_design_scores_gemma":[0.0001110199,0.00009444897,0.0003538705,0.00006819559,0.00008584068,0.000147772,0.0002060267,0.3918531,0.009081303,0.5945212,0.003420366,0.00005696532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1031702,0.0002504782,0.8880187,0.0008535712,0.00005283298,0.0002020245,0.0003303022,0.001649546,0.005472337],"genre_scores_gemma":[0.7789321,0.0002899343,0.2159757,0.0002190429,0.00007387844,0.0002933613,0.0007157731,0.000156859,0.003343241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01123619,"threshold_uncertainty_score":0.04139328,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kaye Mason","is_ca":true},{"name":"Jörg Denzinger","is_ca":true},{"name":"Sheelagh Carpendale","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05349610606819741,"gpt":0.2763378046049061,"spread":0.2228416985367087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002314406,0.0005238436,0.0005176421,0.0006669416,0.001495195,0.003076524,0.00122487,0.001582367,0.004014468],"category_scores_gemma":[0.009335274,0.000436257,0.0006035687,0.0006691693,0.003818252,0.004210715,0.003976041,0.001211589,0.0005335652],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000730106,"about_ca_system_score_gemma":0.0007922782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002208943,"about_ca_topic_score_gemma":0.001770437,"domain_scores_codex":[0.9983867,0.0008442679,0.0001046745,0.0002316024,0.0003230882,0.0001096367],"domain_scores_gemma":[0.996135,0.002554998,0.0003538074,0.0004415415,0.0002253368,0.000289292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002618457,0.0001797761,0.002691489,0.0003843872,0.0001133702,0.001180756,0.006233362,0.2694529,0.01476575,0.5715941,0.00274807,0.1303942],"study_design_scores_gemma":[0.0000857616,0.0001072497,0.0006690299,0.00005683073,0.00003448793,0.0003749609,0.0008498736,0.6119382,0.005522022,0.3553695,0.0249241,0.00006792361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05492754,0.0007584911,0.9233533,0.001128645,0.00007646089,0.0001213543,0.00004832396,0.0005285112,0.01905737],"genre_scores_gemma":[0.772292,0.000567687,0.2184965,0.0001281402,0.00006270836,0.0002779529,0.00009977751,0.00009280883,0.007982536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004014468,"threshold_uncertainty_score":0.0134297,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mohamad Mehdi","is_ca":true},{"name":"Nizar Bouguila","is_ca":true},{"name":"Jamal Bentahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09265999085829293,"gpt":0.3506057261559008,"spread":0.2579457352976079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005878749,0.0009217159,0.001032011,0.002493462,0.0006549259,0.002045472,0.0009930846,0.001007493,0.0004931702],"category_scores_gemma":[0.03225782,0.0004379888,0.0008416898,0.002258318,0.001338553,0.003346415,0.001407745,0.001487933,0.0001619088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002461055,"about_ca_system_score_gemma":0.0009899527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003874202,"about_ca_topic_score_gemma":0.003723935,"domain_scores_codex":[0.9933343,0.004047102,0.000452816,0.0005776872,0.001357694,0.0002303634],"domain_scores_gemma":[0.9807305,0.01143006,0.003274941,0.001799764,0.002107797,0.0006568438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002640857,0.0001349788,0.01669012,0.0001055124,0.0002192191,0.0001659746,0.0003832953,0.869456,0.003830713,0.04515675,0.0006772727,0.06291607],"study_design_scores_gemma":[0.000003219181,0.00002525199,0.0007401165,0.000005419827,0.000008253554,0.00002072364,0.00001743928,0.9899436,0.0002891131,0.008837919,0.00009618323,0.00001266183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09273164,0.0004689211,0.905458,0.0002628255,0.00003203623,0.00007385989,0.00008829828,0.0002136226,0.0006706631],"genre_scores_gemma":[0.93094,0.0001385182,0.06850173,0.00003313214,0.0000311069,0.00006411406,0.0001017511,0.00001822148,0.0001714097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005878749,"threshold_uncertainty_score":0.03109014,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Omer Lev","is_ca":true},{"name":"Tyrone Strangway","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1186784481878477,"gpt":0.3701668057351036,"spread":0.251488357547256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004551166,0.0009871287,0.001445538,0.001091741,0.001122296,0.003197196,0.001622875,0.001663312,0.009265237],"category_scores_gemma":[0.02775899,0.0008164552,0.0009857212,0.001147734,0.002607107,0.008706766,0.002756924,0.002134929,0.0004010863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002008835,"about_ca_system_score_gemma":0.001130752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002379135,"about_ca_topic_score_gemma":0.002445278,"domain_scores_codex":[0.9965137,0.002198026,0.0001228745,0.0003031374,0.0003467843,0.0005156404],"domain_scores_gemma":[0.9837211,0.01194193,0.00209252,0.001081337,0.0006757699,0.000487284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002672737,0.0001719482,0.001242667,0.0001490971,0.00007255445,0.0001921482,0.0002709387,0.1033688,0.00159635,0.8763123,0.001158354,0.01519756],"study_design_scores_gemma":[0.0001298369,0.00007989034,0.0007816677,0.0000600886,0.00003901901,0.00007895403,0.0001310838,0.3097454,0.0008799642,0.6858482,0.0021875,0.00003841928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3561466,0.001336402,0.5623974,0.002235667,0.0001021333,0.0001681277,0.0002839289,0.0002084546,0.07712132],"genre_scores_gemma":[0.9641623,0.0005984921,0.0303631,0.0001736174,0.00006409377,0.0001484472,0.00006753182,0.00005220068,0.004370266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009265237,"threshold_uncertainty_score":0.03099531,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mathieu Sinn","is_ca":true},{"name":"Pascal Poupart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1021268820539132,"gpt":0.2676736844623603,"spread":0.1655468024084472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003153921,0.0003729789,0.0003349587,0.0003491883,0.0001527366,0.0003419531,0.000338806,0.0003486262,0.001344034],"category_scores_gemma":[0.0008958196,0.0001140895,0.0001552233,0.0002415649,0.0001711896,0.0007880672,0.0005550439,0.0001954947,0.0005472054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001139133,"about_ca_system_score_gemma":0.0002542655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001283477,"about_ca_topic_score_gemma":0.001814218,"domain_scores_codex":[0.9999056,0.00002701593,0.000005675031,0.00002080597,0.00003037421,0.00001045968],"domain_scores_gemma":[0.9998481,0.0000494653,0.00002360801,0.00001474444,0.00004178948,0.00002215358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006681088,0.0003209806,0.008545034,0.0003935584,0.0000625227,0.0002522252,0.0004981002,0.02228905,0.04758439,0.004648925,0.009871918,0.9048651],"study_design_scores_gemma":[0.0003104844,0.002774465,0.03190251,0.0002181849,0.0002334891,0.002203868,0.0007073371,0.8171695,0.05502054,0.02039692,0.06894135,0.000121401],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3970263,0.005490141,0.582451,0.001324041,0.0003170043,0.0002557134,0.0006290637,0.004348613,0.008158118],"genre_scores_gemma":[0.8471043,0.002077919,0.1432474,0.0001761646,0.00008902237,0.0001104492,0.0004107428,0.00008059815,0.006703491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001344034,"threshold_uncertainty_score":0.004496217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Svetlana Obraztsova","is_ca":false},{"name":"Omer Lev","is_ca":true},{"name":"Evangelos Markakis","is_ca":false},{"name":"Zinovi Rabinovich","is_ca":false},{"name":"Jeffrey S. Rosenschein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2011580398146823,"gpt":0.2977002488611463,"spread":0.09654220904646393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007862802,0.0008098601,0.002178905,0.001281815,0.001203057,0.00357187,0.002080353,0.002899482,0.007516725],"category_scores_gemma":[0.06314328,0.0006115043,0.00123066,0.001275987,0.003682891,0.005348152,0.00335386,0.003495621,0.0005289317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00317673,"about_ca_system_score_gemma":0.001055333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002018241,"about_ca_topic_score_gemma":0.001577587,"domain_scores_codex":[0.9939882,0.002960118,0.0002678659,0.001057242,0.001006512,0.0007200672],"domain_scores_gemma":[0.9462562,0.0403748,0.005994681,0.004640732,0.001701132,0.00103239],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007146848,0.0001039661,0.01012852,0.0003362687,0.0001987458,0.0003974111,0.0005192458,0.1530748,0.002286646,0.7969796,0.001963475,0.03329664],"study_design_scores_gemma":[0.0001653572,0.000170901,0.003795632,0.00008021045,0.00009153893,0.0003904635,0.0002379524,0.2240592,0.001943544,0.7660695,0.002933047,0.00006260166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4256544,0.002358937,0.5363439,0.006600005,0.0001718783,0.000223807,0.0006435895,0.0002951489,0.02770833],"genre_scores_gemma":[0.9809672,0.0003766849,0.01496711,0.0002423931,0.0001174445,0.0000776921,0.0001290951,0.00005652501,0.003065806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007862802,"threshold_uncertainty_score":0.041583,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Noel Sardana","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09187409978039231,"gpt":0.3414822652082259,"spread":0.2496081654278336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005363431,0.00102221,0.001161674,0.001498282,0.001031981,0.002206288,0.002198275,0.002404115,0.001957432],"category_scores_gemma":[0.03981044,0.0008163541,0.001106729,0.001061565,0.001805004,0.005225908,0.00169632,0.002202455,0.0003675507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002636191,"about_ca_system_score_gemma":0.001240631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01304702,"about_ca_topic_score_gemma":0.008598179,"domain_scores_codex":[0.9963143,0.001892117,0.0002132239,0.0005521658,0.0007861945,0.0002420786],"domain_scores_gemma":[0.9777439,0.01710873,0.00243993,0.0009044639,0.001264334,0.0005385472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008371412,0.00004944859,0.001793187,0.00004949318,0.00006453619,0.0001432216,0.0002764454,0.9272056,0.0005072789,0.06054783,0.0004448778,0.008834412],"study_design_scores_gemma":[0.000007078954,0.00001344475,0.0001050489,0.000004315688,0.000009921763,0.00001331889,0.00001247967,0.9853801,0.0000745959,0.01419595,0.0001770331,0.000006685939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04894862,0.0003493656,0.9455781,0.0008768437,0.00007148987,0.00007915713,0.00006881267,0.0001624868,0.00386517],"genre_scores_gemma":[0.933852,0.0002926457,0.0622633,0.00007514594,0.0001373653,0.0001303022,0.00006770877,0.00005123311,0.003130414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01304702,"threshold_uncertainty_score":0.0283649,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pascal Poupart","is_ca":true},{"name":"Tobias Lang","is_ca":false},{"name":"Marc Toussaint","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1458052012319216,"gpt":0.3207535313869368,"spread":0.1749483301550152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002925021,0.0009257593,0.001625636,0.0006072966,0.000615276,0.0009409456,0.001495914,0.001274782,0.001348385],"category_scores_gemma":[0.008670349,0.0007916964,0.0007210283,0.0006155971,0.002620418,0.001698337,0.002133942,0.002405516,0.0002162767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001348704,"about_ca_system_score_gemma":0.001464654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005802807,"about_ca_topic_score_gemma":0.005541426,"domain_scores_codex":[0.9989944,0.0004414437,0.00005151698,0.0001668119,0.0002275489,0.0001181434],"domain_scores_gemma":[0.9957508,0.003364935,0.0002818339,0.000280252,0.0001936061,0.0001286334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004356256,0.00001877312,0.0002574802,0.00003855765,0.00002473203,0.00003781235,0.0000715155,0.9690899,0.0004309418,0.01735602,0.0001977493,0.012433],"study_design_scores_gemma":[0.00001322325,0.0000148217,0.00002860878,0.000006205497,0.000005860445,0.0000052345,0.000007509139,0.9851624,0.0002569314,0.01436823,0.000126748,0.000004116733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02155071,0.0002570921,0.9755437,0.0002590087,0.00001845887,0.0000431878,0.0000207886,0.0004005992,0.001906364],"genre_scores_gemma":[0.7663519,0.000245208,0.2313246,0.0001770438,0.00002945833,0.0002071902,0.00004911335,0.0001118733,0.001503646],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005802807,"threshold_uncertainty_score":0.01546919,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mohamed El-Menshawy","is_ca":true},{"name":"Wei Wan","is_ca":true},{"name":"Jamal Bentahar","is_ca":true},{"name":"Rachida Dssouli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1435389464135784,"gpt":0.3691226349973471,"spread":0.2255836885837687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003559565,0.0009427026,0.001343819,0.001321166,0.001161996,0.003055214,0.002580651,0.001378533,0.004745407],"category_scores_gemma":[0.0182516,0.0007740816,0.001812461,0.001191523,0.003490796,0.004437075,0.003738715,0.002587615,0.0006455816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00269313,"about_ca_system_score_gemma":0.004148966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007187949,"about_ca_topic_score_gemma":0.008406118,"domain_scores_codex":[0.9933231,0.00257027,0.0003307567,0.0006797485,0.002532511,0.0005635651],"domain_scores_gemma":[0.9848498,0.01109157,0.000979955,0.002046881,0.0008674752,0.0001643177],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002612904,0.000101699,0.001411758,0.00034891,0.0001499685,0.0004542736,0.0005614004,0.4939258,0.007848351,0.4559963,0.001630746,0.03730963],"study_design_scores_gemma":[0.00006289923,0.00002737394,0.00006420351,0.00003300507,0.00003298046,0.00004369994,0.00004313397,0.847936,0.006046111,0.1434779,0.002217239,0.00001536848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01983847,0.0001012939,0.973581,0.0002666227,0.00003791841,0.00007441688,0.0001385366,0.002508919,0.00345275],"genre_scores_gemma":[0.6758862,0.000241328,0.3184882,0.0001835921,0.00004454291,0.0004127527,0.0005352084,0.0004765274,0.003731494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007187949,"threshold_uncertainty_score":0.01954013,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Shakil M. Khan","is_ca":true},{"name":"Yves Lespérance","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1285531246108941,"gpt":0.310251174366983,"spread":0.1816980497560889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001839167,0.001090115,0.0007639236,0.0008147098,0.0008760276,0.003339538,0.003117566,0.00169086,0.01374791],"category_scores_gemma":[0.00264289,0.001004075,0.002176673,0.0008351898,0.002212125,0.004892073,0.002415496,0.003690399,0.005091696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116249,"about_ca_system_score_gemma":0.00152861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002356836,"about_ca_topic_score_gemma":0.003298455,"domain_scores_codex":[0.9989003,0.0003138585,0.0001584251,0.0002199733,0.0002974737,0.000110023],"domain_scores_gemma":[0.9988565,0.0004712024,0.0001620475,0.0001980603,0.0002270322,0.00008511255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001159801,0.00004922697,0.0002025691,0.0003490797,0.00003050143,0.0002473349,0.0005166003,0.02665075,0.001939906,0.9325262,0.007599711,0.02977215],"study_design_scores_gemma":[0.0001541004,0.0001250317,0.0001135606,0.0001732903,0.00007121973,0.000467307,0.0001404968,0.3035867,0.003474673,0.5103148,0.1813125,0.00006629526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001505894,0.0001797173,0.9875942,0.0004802681,0.00009537063,0.0001545141,0.0003985667,0.00285222,0.006739266],"genre_scores_gemma":[0.05295222,0.0004061235,0.9317737,0.0005612174,0.000122412,0.0009184981,0.0008491604,0.0006938588,0.0117227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01374791,"threshold_uncertainty_score":0.0459913,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Aaron Koolyk","is_ca":false},{"name":"Omer Lev","is_ca":true},{"name":"Jeffrey S. Rosenschein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1481050922965997,"gpt":0.3044544472939487,"spread":0.1563493549973489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01253505,0.0003542924,0.001103846,0.001493538,0.000732295,0.002726555,0.001500888,0.001265564,0.005713043],"category_scores_gemma":[0.1224507,0.000308247,0.0009325086,0.001650483,0.003044289,0.003243884,0.001411376,0.001900659,0.0006599894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001671546,"about_ca_system_score_gemma":0.0009793441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003043516,"about_ca_topic_score_gemma":0.001424565,"domain_scores_codex":[0.9946267,0.002850436,0.0003361564,0.0007874183,0.0008688605,0.0005304803],"domain_scores_gemma":[0.8138257,0.1410255,0.01805526,0.0117087,0.01283825,0.002546532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001432711,0.0005791562,0.05590606,0.0004470328,0.0004660948,0.0003189431,0.002062413,0.426354,0.003240058,0.4234346,0.003965718,0.08179332],"study_design_scores_gemma":[0.000118059,0.0002521627,0.0132393,0.00007566503,0.00005995862,0.000166483,0.0002772785,0.6080292,0.001511368,0.3752971,0.0009226532,0.00005073775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7743272,0.000654972,0.2058285,0.0007697625,0.00005605947,0.0001719683,0.0002947935,0.0001734285,0.01772344],"genre_scores_gemma":[0.986466,0.0001302065,0.01160274,0.00004411563,0.00002452912,0.00006126134,0.0001439893,0.00003630929,0.001490811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01253505,"threshold_uncertainty_score":0.06629246,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Loker","is_ca":true},{"name":"Kate Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.172506683914167,"gpt":0.4008345885727295,"spread":0.2283279046585625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008738198,0.001843645,0.002114998,0.0009060709,0.0008495128,0.00480952,0.003430231,0.001898458,0.00312787],"category_scores_gemma":[0.04743868,0.0009441854,0.001591962,0.001717824,0.003596952,0.01189715,0.003418746,0.005166131,0.0004371229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002627803,"about_ca_system_score_gemma":0.002406211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000951643,"about_ca_topic_score_gemma":0.001010511,"domain_scores_codex":[0.9908092,0.005560485,0.0005019957,0.00123666,0.001151466,0.0007401977],"domain_scores_gemma":[0.9706417,0.02212759,0.001979241,0.003843717,0.0008891369,0.0005186333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002941347,0.0002467227,0.001361661,0.0002421464,0.0001535688,0.0001312824,0.000248439,0.6803473,0.002111065,0.2861229,0.001643211,0.02709756],"study_design_scores_gemma":[0.00009003507,0.00007538922,0.0001854365,0.00003049909,0.00003840199,0.00008669255,0.0001272657,0.6150814,0.001179112,0.3813544,0.001718428,0.00003290729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08465507,0.0004203452,0.9053268,0.0007814484,0.00005878098,0.0002806312,0.000164533,0.0003037968,0.008008501],"genre_scores_gemma":[0.8396,0.0005915863,0.1562745,0.0002093074,0.00007747867,0.0004906147,0.00039901,0.0001874016,0.002170166],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008738198,"threshold_uncertainty_score":0.04621261,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Felicitas Mokom","is_ca":true},{"name":"Ziad Kobti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2173949215221218,"gpt":0.3883054402522677,"spread":0.1709105187301459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005304297,0.0003880361,0.0004073937,0.0003914092,0.0004707885,0.001822223,0.0009498829,0.000940705,0.001953295],"category_scores_gemma":[0.002472691,0.0001752994,0.000549024,0.0003890082,0.001308677,0.001473119,0.001639772,0.0006570619,0.0002004113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005000308,"about_ca_system_score_gemma":0.0004163869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003533338,"about_ca_topic_score_gemma":0.002333787,"domain_scores_codex":[0.9996461,0.0002147359,0.00001541707,0.00004156828,0.00005701511,0.0000252826],"domain_scores_gemma":[0.9988686,0.0007584235,0.0001117974,0.0001341429,0.00006387066,0.00006316105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003257525,0.00007074175,0.002815872,0.00007109026,0.00003826432,0.0002579064,0.0004849449,0.9279633,0.002162478,0.05693122,0.0001605408,0.009011087],"study_design_scores_gemma":[0.000009114691,0.00004740214,0.0002848441,0.000009904779,0.000009439001,0.00003596867,0.00009670128,0.9815146,0.0004286102,0.01600328,0.001551491,0.000008617847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4627087,0.0004063038,0.5119362,0.0009048739,0.00008128099,0.0001530272,0.000111928,0.0002256731,0.02347202],"genre_scores_gemma":[0.9421797,0.0002804792,0.05287435,0.00005643174,0.00001974776,0.0001503074,0.00004325653,0.0000295433,0.004366175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003533338,"threshold_uncertainty_score":0.00702554,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Olayide Olorunleke","is_ca":true},{"name":"Gordon McCalla","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1133346570670415,"gpt":0.2978018557228957,"spread":0.1844671986558542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008365642,0.0009622506,0.001506392,0.001024468,0.002598893,0.004645308,0.002632673,0.002472154,0.003121287],"category_scores_gemma":[0.01662146,0.0009294864,0.001240475,0.001205891,0.003651373,0.008033157,0.007417053,0.002718911,0.0006147959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001616992,"about_ca_system_score_gemma":0.001650294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001936077,"about_ca_topic_score_gemma":0.001465372,"domain_scores_codex":[0.9890071,0.006076817,0.0006812171,0.001030189,0.002671864,0.0005328206],"domain_scores_gemma":[0.989636,0.005396724,0.0007956199,0.002823153,0.0007590576,0.0005895103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001552782,0.0001819673,0.001559573,0.0002608295,0.0002379831,0.0005702249,0.002350186,0.2957355,0.003418413,0.6242858,0.001511787,0.06973255],"study_design_scores_gemma":[0.00005743595,0.000094412,0.0001991671,0.00003716338,0.00005121258,0.0001658408,0.0002977433,0.4471144,0.001789298,0.5389757,0.0111751,0.00004253936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03620896,0.001866756,0.9434161,0.001512079,0.0001559541,0.0001764804,0.00003457056,0.0004331262,0.01619607],"genre_scores_gemma":[0.7946293,0.001355762,0.1979334,0.0003007718,0.0001904953,0.0003999296,0.0001231899,0.0001039382,0.00496313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008365642,"threshold_uncertainty_score":0.04424232,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Matching (statistics); Mathematics; Statistics","authors":[{"name":"Hadi Hosseini","is_ca":true},{"name":"Kate Larson","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1092659491931415,"gpt":0.2541527099557087,"spread":0.1448867607625672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01061353,0.0004412119,0.001725599,0.001707255,0.001235539,0.003705174,0.003428633,0.003988132,0.009508922],"category_scores_gemma":[0.08469413,0.0008485873,0.001021706,0.001718187,0.002672091,0.007267947,0.002302611,0.001954778,0.0006413602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001319186,"about_ca_system_score_gemma":0.001636469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005810695,"about_ca_topic_score_gemma":0.0005120868,"domain_scores_codex":[0.9953671,0.002538321,0.0002729297,0.0006754495,0.0004880201,0.0006582981],"domain_scores_gemma":[0.8876145,0.0786587,0.0173946,0.00940113,0.003589955,0.003341046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003665931,0.0003095919,0.007827513,0.0001932792,0.0001423331,0.0002057393,0.0005060828,0.046131,0.002960132,0.9201287,0.001310172,0.01991892],"study_design_scores_gemma":[0.00021458,0.0002205135,0.002387681,0.00004298616,0.00006305086,0.0002683716,0.0003459632,0.3429789,0.0009508659,0.6515141,0.0009681472,0.00004486925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7603455,0.0005483311,0.2215999,0.001585991,0.00006501581,0.0002571373,0.0001907553,0.0001790905,0.01522836],"genre_scores_gemma":[0.9861568,0.0001752749,0.01117109,0.00008140794,0.00003740363,0.00009696592,0.00006526258,0.00002130493,0.002194589],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01061353,"threshold_uncertainty_score":0.05613041,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Camille Besse","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06089110723984551,"gpt":0.2944538873330655,"spread":0.23356278009322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308246,0.0006932767,0.0007937541,0.0004764137,0.0005829158,0.001455381,0.0009541042,0.0009496902,0.005057963],"category_scores_gemma":[0.004877493,0.0005541146,0.000871871,0.0007258989,0.001279396,0.00255874,0.001292267,0.001942914,0.0003310257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001404948,"about_ca_system_score_gemma":0.001470495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004262428,"about_ca_topic_score_gemma":0.004924057,"domain_scores_codex":[0.998854,0.0003156631,0.00007310008,0.0003184472,0.0002923105,0.0001464247],"domain_scores_gemma":[0.9962365,0.002428139,0.0005464214,0.0003441454,0.0002897987,0.0001550509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007007398,0.00004623813,0.001096568,0.0001639958,0.00005074044,0.0002054663,0.0001048691,0.3691761,0.0008328681,0.6105577,0.001526162,0.01616919],"study_design_scores_gemma":[0.00001913167,0.00002779174,0.0003110456,0.00001714912,0.00001317672,0.00006828288,0.00003769285,0.6951871,0.0004175311,0.2994321,0.004457289,0.00001166633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02063659,0.0004482888,0.9706454,0.0005546106,0.00006189621,0.00006984485,0.0006991223,0.000209104,0.006675182],"genre_scores_gemma":[0.741669,0.001207922,0.2442835,0.0003844278,0.0001260205,0.0003673132,0.001189263,0.0001079376,0.01066473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005057963,"threshold_uncertainty_score":0.01692057,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hadi Hosseini","is_ca":true},{"name":"Kate Larson","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1017189391407418,"gpt":0.2588623865931234,"spread":0.1571434474523816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00764063,0.0005534822,0.001513161,0.001444413,0.001015803,0.002442005,0.002499445,0.002268615,0.02070397],"category_scores_gemma":[0.04829822,0.0004778074,0.001429142,0.002655188,0.002137948,0.004840395,0.001679202,0.001971506,0.001498614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086868,"about_ca_system_score_gemma":0.001221439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007110887,"about_ca_topic_score_gemma":0.000428682,"domain_scores_codex":[0.9968401,0.001409161,0.0002542635,0.0006818642,0.0003787988,0.0004356655],"domain_scores_gemma":[0.9432678,0.03268466,0.01282056,0.006872216,0.002616535,0.001738215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002710108,0.0002948797,0.003860409,0.0004711113,0.0001504955,0.0001889903,0.0002895294,0.05205599,0.002279434,0.9053943,0.005443081,0.02930091],"study_design_scores_gemma":[0.0001676564,0.000285314,0.001937562,0.00009180106,0.00006094972,0.000280971,0.000116136,0.1675737,0.001029286,0.825958,0.002451444,0.00004703406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4802157,0.00173909,0.4747911,0.002759047,0.0002939233,0.0004395728,0.000956249,0.0003477942,0.03845757],"genre_scores_gemma":[0.9563569,0.0008531656,0.03399533,0.0004113425,0.0002004244,0.0003110783,0.0003161847,0.00007276022,0.0074828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02070397,"threshold_uncertainty_score":0.06926167,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jamal Bentahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1142804543862047,"gpt":0.3702068403268843,"spread":0.2559263859406796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009684579,0.001409752,0.001044748,0.001988946,0.003600145,0.004502625,0.004066666,0.00462936,0.009409647],"category_scores_gemma":[0.02146778,0.0009079566,0.001297583,0.001473069,0.002817543,0.008228004,0.005162735,0.004236867,0.003045887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001387626,"about_ca_system_score_gemma":0.003811786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001251646,"about_ca_topic_score_gemma":0.0009058011,"domain_scores_codex":[0.9885018,0.005225823,0.001270261,0.001015892,0.003549282,0.0004369179],"domain_scores_gemma":[0.9881799,0.00588369,0.0006385969,0.002303672,0.002398654,0.000595514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001489253,0.0001348265,0.0002532814,0.0003132805,0.00006661539,0.0004426407,0.00139795,0.01480382,0.007235479,0.8901859,0.01028261,0.07473464],"study_design_scores_gemma":[0.0003272888,0.0002663983,0.0001872859,0.0003323383,0.0001664353,0.001177965,0.0004685711,0.2781434,0.02587084,0.3711243,0.3216698,0.0002652658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001765052,0.0001207737,0.9865652,0.0006397195,0.0002072153,0.0005006111,0.00007900917,0.0007643257,0.009358019],"genre_scores_gemma":[0.06890847,0.0003028883,0.9152452,0.0003467108,0.0001248036,0.002132011,0.0003822478,0.0003080312,0.01224967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009684579,"threshold_uncertainty_score":0.05121756,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hadi Hosseini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1636327509114454,"gpt":0.2740471760258787,"spread":0.1104144251144333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008095077,0.0007981654,0.001499057,0.0007731495,0.001253611,0.003778873,0.002396418,0.002942101,0.01326726],"category_scores_gemma":[0.02778926,0.0006840638,0.001696449,0.001453205,0.003085152,0.007732907,0.002839733,0.002738385,0.001513799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001818799,"about_ca_system_score_gemma":0.001366221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008054766,"about_ca_topic_score_gemma":0.0006482398,"domain_scores_codex":[0.9899511,0.005428608,0.0005708211,0.00207089,0.001194129,0.0007844162],"domain_scores_gemma":[0.98352,0.009517509,0.002276371,0.003246758,0.0007359313,0.0007034474],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008663487,0.000093116,0.0005274276,0.0000550638,0.00003655405,0.00008499884,0.0001556765,0.01713311,0.0006874343,0.9668093,0.0007740026,0.01355669],"study_design_scores_gemma":[0.00005637108,0.00005475837,0.0001668479,0.00001252844,0.00001511541,0.00006720041,0.00005360695,0.08778247,0.0003194285,0.9092816,0.002173305,0.00001679379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07535247,0.0002247025,0.8956926,0.001575262,0.000132108,0.0002411644,0.0002354305,0.0001232938,0.02642293],"genre_scores_gemma":[0.8086385,0.0003925059,0.1745868,0.0005490349,0.0001729084,0.0003874963,0.0001890196,0.00006090862,0.01502285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01326726,"threshold_uncertainty_score":0.04438335,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vaishak Belle","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06061705081815062,"gpt":0.2701336165493615,"spread":0.2095165657312109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003264394,0.0007125522,0.0006661869,0.001936059,0.002617381,0.005385114,0.002241507,0.002279025,0.007193216],"category_scores_gemma":[0.004425287,0.0005725941,0.001975521,0.001483182,0.01238154,0.01117224,0.003185727,0.004227968,0.00174373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003413767,"about_ca_system_score_gemma":0.001984173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003244233,"about_ca_topic_score_gemma":0.001678479,"domain_scores_codex":[0.9979767,0.000809311,0.0001395011,0.0003876383,0.0005053914,0.0001814202],"domain_scores_gemma":[0.9975662,0.001255017,0.0001897105,0.000375939,0.0004377815,0.0001754048],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002455948,0.000003219391,0.00002226606,0.00001572647,0.000002933677,0.00001900681,0.00008962189,0.0005504655,0.000072758,0.9968275,0.0006583812,0.001735561],"study_design_scores_gemma":[0.000008134713,0.000007711214,0.00002950704,0.00002112801,0.000004871311,0.00003274262,0.00006329557,0.002891289,0.0001075489,0.9838544,0.01297295,0.000006498263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005336954,0.002800622,0.8833737,0.0128913,0.000468956,0.00006653247,0.0003323259,0.0004410811,0.09428848],"genre_scores_gemma":[0.5301529,0.004008887,0.4288041,0.005425891,0.001330803,0.0006232918,0.0007459099,0.000226094,0.02868218],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007193216,"threshold_uncertainty_score":0.02476871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}