{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":27,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":27,"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":"a643a06750ce","filters":{"venue":"Autonomous Agents and Multi-Agent Systems"}},"results":[{"id":"W2130891285","doi":"10.1023/b:agnt.0000018806.20944.ef","title":"Tropos: An Agent-Oriented Software Development Methodology","year":2004,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":1737,"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":"Provincia Autonoma di Trento","keywords":"Unified Modeling Language; Software engineering; Computer science; Agent-oriented software engineering; Metamodeling; Software development; Software development process; Class diagram; Use Case Diagram; Software; Applications of UML; Systems engineering; Engineering; Programming language","authors":[{"name":"Paolo Bresciani","is_ca":false},{"name":"Anna Perini","is_ca":false},{"name":"Paolo Giorgini","is_ca":false},{"name":"Fausto Giunchiglia","is_ca":false},{"name":"John Mylopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09222533319818163,"gpt":0.3138552863723472,"spread":0.2216299531741655,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002701286,0.0007724789,0.0005113741,0.0009245868,0.0006970243,0.001880783,0.002203836,0.0008567488,0.004388628],"category_scores_gemma":[0.005274639,0.0009754586,0.001296961,0.0005767571,0.000786195,0.002438552,0.002129576,0.001969509,0.00175272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004438239,"about_ca_system_score_gemma":0.002076417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007044493,"about_ca_topic_score_gemma":0.001216127,"domain_scores_codex":[0.9982294,0.0007721192,0.0001741572,0.0001962084,0.0005273753,0.0001006522],"domain_scores_gemma":[0.9979663,0.0009628167,0.0002191128,0.000374146,0.0003361875,0.0001414067],"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.0002866915,0.0003420496,0.002049205,0.002415167,0.0003870622,0.001099959,0.002345164,0.04950795,0.03800288,0.3736594,0.03060899,0.4992954],"study_design_scores_gemma":[0.0003551323,0.0003329372,0.0006421818,0.0007235539,0.0003383502,0.002112198,0.000355313,0.3957331,0.03749852,0.1580035,0.4037709,0.0001343264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001265409,0.00006875904,0.9913926,0.00007988109,0.00003936715,0.0001590581,0.00006467283,0.004642065,0.002288229],"genre_scores_gemma":[0.0256293,0.0003322583,0.9685154,0.0001210726,0.00002154236,0.0005731801,0.0003128881,0.001494592,0.002999769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004388628,"threshold_uncertainty_score":0.01468146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1944800461","doi":"10.1023/a:1014897210525","title":"Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace","year":2002,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":458,"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; Matching (statistics); The Internet; Semantic matching; Process (computing); Context (archaeology); Java; Signature (topology); Software agent; Information retrieval; World Wide Web; Programming language; Artificial intelligence","authors":[{"name":"Katia Sycara","is_ca":false},{"name":"Seth Widoff","is_ca":false},{"name":"Matthias Klusch","is_ca":false},{"name":"Jianguo Lü","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02508627846054041,"gpt":0.2533005685363784,"spread":0.228214290075838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002478352,0.0006458015,0.001141796,0.0009677408,0.001416026,0.003741508,0.002541831,0.001563917,0.01040653],"category_scores_gemma":[0.00701256,0.0008574529,0.0005507736,0.0009744857,0.001734141,0.006703708,0.005541089,0.001544275,0.00277183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008287454,"about_ca_system_score_gemma":0.001294063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003232417,"about_ca_topic_score_gemma":0.00410478,"domain_scores_codex":[0.9983994,0.0005072239,0.0000975583,0.0003280035,0.0004709196,0.0001968217],"domain_scores_gemma":[0.997577,0.001106057,0.000174012,0.0006515082,0.0002147368,0.0002766437],"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.00257408,0.0007574555,0.003060269,0.0006217859,0.0002429188,0.001528237,0.002088643,0.1770791,0.04530564,0.1918101,0.03733351,0.5375983],"study_design_scores_gemma":[0.0002170659,0.0001826576,0.0006677377,0.00003440867,0.00008862684,0.0002994458,0.0005929415,0.8240851,0.02323697,0.1068409,0.04368153,0.00007263325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04609274,0.000420308,0.9157842,0.0008022426,0.0004786343,0.0002442072,0.0002583788,0.02128103,0.01463829],"genre_scores_gemma":[0.6061389,0.000331296,0.3644991,0.0003573797,0.0001216874,0.000240688,0.0007670636,0.001222681,0.0263212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01040653,"threshold_uncertainty_score":0.03481328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055921164","doi":"10.1007/s10458-012-9200-2","title":"A survey of point-based POMDP solvers","year":2012,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":433,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Markov decision process; Computer science; Bellman equation; Function (biology); Observable; Value (mathematics); Point (geometry); State space; Mathematical optimization; Theoretical computer science; Space (punctuation); Scale (ratio); Markov chain; Markov process; Mathematics; Markov model; Machine learning","authors":[{"name":"Guy Shani","is_ca":false},{"name":"Joëlle Pineau","is_ca":true},{"name":"Robert Kaplow","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06430470677447479,"gpt":0.2858437758454526,"spread":0.2215390690709778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001568582,0.001619746,0.002730085,0.001237132,0.0006101618,0.002119256,0.004009139,0.001857504,0.006367066],"category_scores_gemma":[0.004042978,0.001155516,0.001540329,0.003400004,0.0008185172,0.002058957,0.002403722,0.002229208,0.002408357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008268436,"about_ca_system_score_gemma":0.001699971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004555707,"about_ca_topic_score_gemma":0.004043397,"domain_scores_codex":[0.9989374,0.000295753,0.0001122125,0.0001586496,0.0004289758,0.00006707801],"domain_scores_gemma":[0.9987143,0.0008001769,0.00006625631,0.0001450627,0.0002324459,0.00004175323],"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.0001045762,0.0001178883,0.0005464181,0.001238308,0.0001662243,0.00005098856,0.00007166599,0.5266234,0.0006656771,0.05297909,0.0076984,0.4097374],"study_design_scores_gemma":[0.00005548712,0.00004841902,0.0001263976,0.0001483024,0.00004135914,0.00004812752,0.00002419692,0.950703,0.0005168721,0.03698795,0.01128303,0.00001681653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.001954019,0.008520793,0.9814387,0.0002669755,0.0001007522,0.00008090495,0.0001323593,0.0006877345,0.006817837],"genre_scores_gemma":[0.1188852,0.02461714,0.848263,0.0004178148,0.0003437936,0.000567009,0.0008846631,0.0004717561,0.005549634],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006367066,"threshold_uncertainty_score":0.02129996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033411943","doi":"10.1007/s10458-006-5717-6","title":"Multi-Agent Architectures as Organizational Structures","year":2006,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Computer science; Software engineering; Scope (computer science); Software development; Knowledge management; Software agent; Multi-agent system; Agent-oriented software engineering; Quality (philosophy); Adaptability; Dependency (UML); Software; Process management; Engineering; Artificial intelligence; Management","authors":[{"name":"Manuel Kolp","is_ca":false},{"name":"Paolo Giorgini","is_ca":false},{"name":"John Mylopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01968126515432434,"gpt":0.2523091613955709,"spread":0.2326278962412466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001552625,0.0006480514,0.0005583562,0.001318092,0.001744864,0.008397176,0.001389017,0.002647137,0.004877253],"category_scores_gemma":[0.004328083,0.0006835164,0.0004977536,0.002054557,0.004660856,0.00918679,0.001912347,0.002218047,0.0006537819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00233107,"about_ca_system_score_gemma":0.001607496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001449426,"about_ca_topic_score_gemma":0.00183512,"domain_scores_codex":[0.9985784,0.0007625798,0.00007704781,0.0001559172,0.0003090928,0.000116964],"domain_scores_gemma":[0.9976058,0.001207342,0.000297267,0.000298057,0.0003369887,0.0002544147],"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.000001876948,0.000004719448,0.00002862475,0.00001268522,0.00000225196,0.00001131151,0.000120193,0.001780711,0.00006337628,0.9960636,0.0002632863,0.001647324],"study_design_scores_gemma":[0.000008884127,0.000005426932,0.00004839957,0.0000224438,0.000005502425,0.00001827253,0.0001006113,0.01124582,0.0001019064,0.9766659,0.01177208,0.000004737953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04974825,0.01595918,0.7448593,0.01082711,0.000849335,0.0002252425,0.0001852955,0.0004293614,0.176917],"genre_scores_gemma":[0.7820892,0.007487062,0.1814185,0.0005987596,0.0005955636,0.0005682257,0.0002438212,0.00008789809,0.02691092],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008397176,"threshold_uncertainty_score":0.01691312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134303121","doi":"10.1007/s10458-005-1729-x","title":"Towards a Formal and Implemented Model of Argumentation Schemes in Agent Communication","year":2005,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Leverhulme Trust","keywords":"Argumentation theory; Computer science; Flexibility (engineering); Scope (computer science); Focus (optics); Defeasible reasoning; Computational model; Artificial intelligence; Probabilistic argumentation; Theoretical computer science; Programming language; Human–computer interaction; Epistemology; Mathematics","authors":[{"name":"Chris Reed","is_ca":false},{"name":"Doug Walton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05220766229072504,"gpt":0.3052295429635948,"spread":0.2530218806728697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009383628,0.00127185,0.001603161,0.002056404,0.002503113,0.01171975,0.008333954,0.006405812,0.006970265],"category_scores_gemma":[0.02304951,0.001704516,0.002821067,0.002242231,0.006129305,0.01313986,0.004641782,0.007225635,0.00245086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003731534,"about_ca_system_score_gemma":0.004357572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004119453,"about_ca_topic_score_gemma":0.00350046,"domain_scores_codex":[0.9898456,0.004994166,0.001192009,0.001017707,0.002435255,0.0005151833],"domain_scores_gemma":[0.9883988,0.005287173,0.0007195168,0.002412827,0.002631153,0.0005504051],"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.00004129604,0.00006810552,0.0001682451,0.0001234146,0.0000342845,0.00009692125,0.0005847326,0.03055513,0.001004942,0.9551624,0.001024575,0.01113593],"study_design_scores_gemma":[0.00007302214,0.00004235093,0.00006157936,0.0001105706,0.00005609656,0.00009896926,0.0001338435,0.3667331,0.002279834,0.6161286,0.01423268,0.00004943098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001438527,0.00008990649,0.9951687,0.0003655043,0.00006775621,0.0001188775,0.00005330951,0.0004096484,0.002287867],"genre_scores_gemma":[0.1049048,0.0002805078,0.8891729,0.0002492161,0.0001352912,0.0006793843,0.000249846,0.0002561602,0.004071879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01171975,"threshold_uncertainty_score":0.04962599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020087586","doi":"10.1007/s10458-010-9157-y","title":"Sequentially optimal repeated coalition formation under uncertainty","year":2010,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":62,"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":"Reinforcement learning; Variety (cybernetics); Computer science; Bayesian probability; Artificial intelligence; Machine learning; Bayesian inference","authors":[{"name":"Georgios Chalkiadakis","is_ca":false},{"name":"Craig Boutilier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1134261420294738,"gpt":0.3749390473540108,"spread":0.261512905324537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003371656,0.000864766,0.002136926,0.0006140659,0.0007857505,0.00147462,0.00240559,0.002017371,0.002607619],"category_scores_gemma":[0.01340085,0.001019811,0.0006942287,0.0008711196,0.001875848,0.002922542,0.002092985,0.001496415,0.0002507444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001594085,"about_ca_system_score_gemma":0.002010528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003520973,"about_ca_topic_score_gemma":0.003699703,"domain_scores_codex":[0.9981169,0.0009359522,0.00009573708,0.000301876,0.0002862799,0.0002632994],"domain_scores_gemma":[0.9897364,0.007441415,0.001074889,0.0006076893,0.0006459701,0.0004936845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003260578,0.0001569848,0.0005887264,0.00008009011,0.00009084811,0.0001483303,0.0001947085,0.908399,0.001184093,0.07123088,0.000747868,0.01685238],"study_design_scores_gemma":[0.00005909775,0.00007187455,0.0001324243,0.000006478982,0.00001355034,0.00002313474,0.00004609667,0.9329813,0.0003320182,0.06609451,0.0002301245,0.000009400487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.277045,0.000392571,0.7095726,0.0008929794,0.0000931478,0.0002050648,0.0001027702,0.0001880651,0.01150783],"genre_scores_gemma":[0.944474,0.0001275951,0.05100471,0.00005726988,0.00003885954,0.000172994,0.00006843609,0.00003168189,0.004024438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003520973,"threshold_uncertainty_score":0.01783121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109721731","doi":"10.1023/a:1011443827037","title":"Towards a Reference Model for Surveying Mobile Agent Systems","year":2001,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Identifier; Set (abstract data type); Reference model; Software engineering; Mobile agent; Distributed computing; Programming language","authors":[{"name":"Alberto Rodrigues da Silva","is_ca":false},{"name":"Artur Romão","is_ca":false},{"name":"Dwight Deugo","is_ca":true},{"name":"Miguel Mira da Silva","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09158207467992324,"gpt":0.3008025947182695,"spread":0.2092205200383463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003383897,0.0008405016,0.001538584,0.002259928,0.0009767462,0.003711836,0.004150861,0.002660622,0.003242604],"category_scores_gemma":[0.01426754,0.000799509,0.00145672,0.002791626,0.001541193,0.006963921,0.003450627,0.001881036,0.001390686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001571561,"about_ca_system_score_gemma":0.001655973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007493241,"about_ca_topic_score_gemma":0.006309642,"domain_scores_codex":[0.9975109,0.001055272,0.0002014574,0.0004051362,0.0006857442,0.000141472],"domain_scores_gemma":[0.9959404,0.001256791,0.0002892612,0.0009574261,0.00139403,0.0001621004],"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.00004910968,0.00003419934,0.0009071413,0.0001565799,0.00003888791,0.0001368409,0.0004946831,0.3436917,0.002094708,0.5797163,0.002453691,0.07022621],"study_design_scores_gemma":[0.000009761694,0.00003436703,0.0001016802,0.00003594061,0.00001580085,0.00004743726,0.000089702,0.8289437,0.0007351226,0.1592599,0.01070848,0.00001802438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001636558,0.0001167827,0.996864,0.0001140667,0.00001904022,0.00002100477,0.00003650675,0.0001812958,0.001010791],"genre_scores_gemma":[0.1501684,0.0009254309,0.8422598,0.0001578379,0.0000906556,0.0003393559,0.0006448912,0.0003206455,0.005093014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007493241,"threshold_uncertainty_score":0.01789594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997518979","doi":"10.1007/s10458-012-9208-7","title":"Reducing model checking commitments for agent communication to model checking ARCTL and GCTL*","year":2012,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Model checking; Computation tree logic; Computer science; Temporal logic; Abstraction model checking; Linear temporal logic; Theoretical computer science; Automaton; Formal verification; Programming language; Benchmark (surveying)","authors":[{"name":"Mohamed El Menshawy","is_ca":true},{"name":"Jamal Bentahar","is_ca":true},{"name":"Warda El Kholy","is_ca":true},{"name":"Rachida Dssouli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1023744111200447,"gpt":0.3211108509882005,"spread":0.2187364398681557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008120264,0.001790527,0.001879459,0.001731859,0.002038981,0.004349048,0.006162794,0.002406636,0.009922516],"category_scores_gemma":[0.05560078,0.001751239,0.006863213,0.001510462,0.005000559,0.008596772,0.0111941,0.009683112,0.001737596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004197571,"about_ca_system_score_gemma":0.01076646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02686624,"about_ca_topic_score_gemma":0.02429245,"domain_scores_codex":[0.9800909,0.007614004,0.001042861,0.002982425,0.00526009,0.003009754],"domain_scores_gemma":[0.9186373,0.05208465,0.003331261,0.0182336,0.006337967,0.001375159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001521176,0.0005592918,0.004656103,0.001044897,0.0004642566,0.0008405914,0.00167096,0.5098969,0.01105289,0.3145258,0.0125406,0.1412265],"study_design_scores_gemma":[0.00018664,0.0001216292,0.0002360183,0.00006955131,0.0001838398,0.00008298576,0.0003168246,0.7511188,0.01394428,0.2303879,0.00329085,0.0000606429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04171614,0.0001181445,0.9377964,0.001659877,0.0002399854,0.0004641334,0.0004897186,0.0108154,0.006700255],"genre_scores_gemma":[0.6423641,0.0001220564,0.3463919,0.0009409594,0.0001628395,0.0006160082,0.001439745,0.003017222,0.004945028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02686624,"threshold_uncertainty_score":0.05341971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4214891036","doi":"10.1007/s10458-021-09542-6","title":"Formal verification of group and propagated trust in multi-agent systems","year":2022,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Computer science; Model checking; Scalability; Theoretical computer science; Satisfiability; Formal verification; Process (computing); Temporal logic; Boolean satisfiability problem; Distributed computing; Software engineering; Programming language","authors":[{"name":"Nagat Drawel","is_ca":true},{"name":"Jamal Bentahar","is_ca":true},{"name":"Amine Laarej","is_ca":true},{"name":"Gaith Rjoub","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04836751343613718,"gpt":0.297593845586143,"spread":0.2492263321500058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01242894,0.0007394658,0.001179265,0.001191352,0.001511893,0.004573942,0.003337126,0.002141295,0.003217744],"category_scores_gemma":[0.06104817,0.0009271689,0.002618924,0.0008179648,0.005825323,0.007026625,0.004574212,0.003908919,0.0003484492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0035274,"about_ca_system_score_gemma":0.004879796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01082863,"about_ca_topic_score_gemma":0.006873777,"domain_scores_codex":[0.9848753,0.005996678,0.001167477,0.001493621,0.004970442,0.001496592],"domain_scores_gemma":[0.9253759,0.05359057,0.004117184,0.008321701,0.007567477,0.001027135],"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.0003379315,0.0002213118,0.00280047,0.0003781841,0.0002047338,0.0008133885,0.001991971,0.2225257,0.004573664,0.7412086,0.001342448,0.02360157],"study_design_scores_gemma":[0.0001369801,0.00006291625,0.0003887613,0.00007518021,0.00008435795,0.0000843762,0.000204832,0.6535435,0.005190641,0.3382107,0.001978608,0.00003912667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05714639,0.0001255887,0.9362267,0.0008575499,0.0001104237,0.0002248008,0.0001770871,0.0007287811,0.004402632],"genre_scores_gemma":[0.9041887,0.0001001113,0.09350461,0.000123006,0.0000635686,0.0001724855,0.0001600863,0.000106693,0.001580653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01242894,"threshold_uncertainty_score":0.06573129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084476420","doi":"10.1007/s10458-014-9274-0","title":"Risk management for self-adapting self-organizing emergent multi-agent systems performing dynamic task fulfillment","year":2014,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Task (project management); Computer science; Self-management; Human–computer interaction; Artificial intelligence; Engineering; Systems engineering","authors":[{"name":"Jonathan Hudson","is_ca":true},{"name":"Jörg Denzinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01620314784500653,"gpt":0.2349220543176721,"spread":0.2187189064726656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018978,0.0006753654,0.000675264,0.0004545217,0.0006762404,0.001385928,0.001054664,0.0007201424,0.001095473],"category_scores_gemma":[0.003920776,0.0002202946,0.0004990938,0.0002554325,0.0006289581,0.001156497,0.001541865,0.0005975025,0.0001460835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008320101,"about_ca_system_score_gemma":0.0007927215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002123999,"about_ca_topic_score_gemma":0.001313866,"domain_scores_codex":[0.9994869,0.0001632124,0.00003310751,0.00008415776,0.0001546561,0.0000778799],"domain_scores_gemma":[0.998642,0.0004686246,0.0003433439,0.0001010127,0.0003169452,0.0001281097],"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.0001113,0.0001280481,0.004410132,0.00007701792,0.0001217119,0.0003365788,0.0003321726,0.916661,0.006933534,0.03516825,0.0007652972,0.03495495],"study_design_scores_gemma":[0.000005643623,0.00003650365,0.0004166898,0.000003565922,0.00001294336,0.00003090524,0.00004265272,0.9906007,0.0003374107,0.008303761,0.0002027595,0.000006481426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2604862,0.0004225728,0.7302076,0.0006005348,0.0000890756,0.0001036329,0.00004112194,0.0002300589,0.007819189],"genre_scores_gemma":[0.9879708,0.00007471161,0.010565,0.00002091712,0.00001408574,0.00003614427,0.00001617419,0.00001114331,0.001291073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002123999,"threshold_uncertainty_score":0.006036639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032636061","doi":"10.1007/s10458-011-9172-7","title":"A negotiation framework for linked combinatorial optimization problems","year":2011,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":24,"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":"Negotiation; Pareto principle; Computer science; Mathematical optimization; Space (punctuation); Scheduling (production processes); Multi-objective optimization; Combinatorial optimization; Pareto optimal; Operations research; Mathematics; Algorithm; Machine learning; Law","authors":[{"name":"Lei Duan","is_ca":true},{"name":"Mustafa K. Doğru","is_ca":false},{"name":"Ulaş Özen","is_ca":false},{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06030290389340378,"gpt":0.266328702437593,"spread":0.2060257985441893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434424,0.001230997,0.001823151,0.001633546,0.001994392,0.004115613,0.005088882,0.0023197,0.01011666],"category_scores_gemma":[0.008312771,0.001105132,0.002298726,0.003037756,0.002070205,0.005023682,0.004382339,0.004340453,0.001286477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001877165,"about_ca_system_score_gemma":0.002247419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004888337,"about_ca_topic_score_gemma":0.00479937,"domain_scores_codex":[0.9972041,0.001413008,0.0001528288,0.0002901654,0.0006964159,0.0002435732],"domain_scores_gemma":[0.9978574,0.001382605,0.0001084141,0.0002164877,0.0002233908,0.0002116951],"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.00004875677,0.00008874869,0.0001022335,0.0001068519,0.00005406129,0.0001228076,0.0001648274,0.1430359,0.000490286,0.8247917,0.003498417,0.02749545],"study_design_scores_gemma":[0.00004946247,0.00002461055,0.0000371334,0.00003238159,0.00002309206,0.00004977379,0.00005112679,0.6209632,0.0001778963,0.369998,0.008573902,0.00001929294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002067583,0.0003460554,0.9897934,0.000345183,0.00006538622,0.00009494206,0.00005816386,0.000128727,0.007100529],"genre_scores_gemma":[0.1625761,0.001015705,0.8242351,0.000239734,0.0002239947,0.0007570613,0.0003056811,0.0002184013,0.01042808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01011666,"threshold_uncertainty_score":0.03384364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067398088","doi":"10.1007/s10458-006-0011-1","title":"Conversational semantics sustained by commitments","year":2006,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Cegep de Sainte Foy","funders":"","keywords":"Meaning (existential); Computer science; Semantics (computer science); Foundation (evidence); Term (time); Joint (building); Linguistics; Human–computer interaction; Psychology; Programming language; Engineering","authors":[{"name":"Roberto A. Flores","is_ca":false},{"name":"Philippe Pasquier","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01860835047937832,"gpt":0.2431439821922506,"spread":0.2245356317128723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004259286,0.0007658639,0.0007514428,0.001181362,0.003546131,0.006633511,0.002214473,0.002211466,0.0117916],"category_scores_gemma":[0.01790598,0.00102901,0.001267074,0.001297268,0.003905046,0.01546872,0.005753745,0.004367306,0.002011934],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001790832,"about_ca_system_score_gemma":0.001481004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001773373,"about_ca_topic_score_gemma":0.001229031,"domain_scores_codex":[0.9950293,0.002500495,0.0004141536,0.0007128966,0.000814705,0.0005284678],"domain_scores_gemma":[0.9873604,0.007223937,0.0004916823,0.002551278,0.001657871,0.0007148875],"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.00006898459,0.00001617538,0.00005918644,0.00003992019,0.000009002647,0.0001123257,0.001102348,0.0009962708,0.0007071038,0.9915468,0.001096676,0.004245217],"study_design_scores_gemma":[0.00003169791,0.00001182412,0.00003694742,0.00002036663,0.00001432824,0.00005857379,0.0004871556,0.01162365,0.0009326251,0.9762353,0.01053484,0.00001266229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05218884,0.0007636092,0.7890155,0.005342621,0.0006009474,0.0002001738,0.0005555463,0.001883726,0.1494491],"genre_scores_gemma":[0.8980297,0.0003052027,0.07937373,0.000504225,0.0002962112,0.0004165462,0.0006344685,0.0005423473,0.0198975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0117916,"threshold_uncertainty_score":0.03944677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131335988","doi":"10.1007/s10458-006-5961-9","title":"DIAGAL: An Agent Communication Language Based on Dialogue Games and Sustained by Social Commitments","year":2006,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Language-game; Dialectic; Semantics (computer science); Quality (philosophy); Point (geometry); Multi-agent system; Artificial intelligence; Human–computer interaction; Linguistics; Epistemology; Programming language","authors":[{"name":"Brahim Chaib-draa","is_ca":true},{"name":"Marc-André Labrie","is_ca":true},{"name":"Mathieu Bergeron","is_ca":true},{"name":"Philippe Pasquier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0208363584794265,"gpt":0.2700609247711642,"spread":0.2492245662917377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002654576,0.001202182,0.0009925409,0.0008328318,0.001204021,0.003825517,0.002781609,0.001573349,0.01102435],"category_scores_gemma":[0.005506101,0.0009055285,0.001179111,0.0005473089,0.00203769,0.004704124,0.005163428,0.003029329,0.003532478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009473338,"about_ca_system_score_gemma":0.001682564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001843133,"about_ca_topic_score_gemma":0.002426489,"domain_scores_codex":[0.997255,0.001372663,0.0003565635,0.0003696939,0.0004502516,0.0001959525],"domain_scores_gemma":[0.9973863,0.001273559,0.0001901637,0.0004229617,0.000414088,0.0003129483],"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.0009491994,0.0002437088,0.0005638089,0.0008124541,0.00009247409,0.0004867875,0.001893692,0.01656104,0.01033986,0.8562347,0.03414371,0.07767852],"study_design_scores_gemma":[0.0004394666,0.0002489331,0.0002218771,0.000216458,0.0001234545,0.0004995554,0.0003930557,0.2590175,0.01722231,0.3485066,0.3728978,0.0002131409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003137147,0.0001051985,0.9745991,0.0003486884,0.0002411215,0.0003259018,0.0006963261,0.01284842,0.007698213],"genre_scores_gemma":[0.2221481,0.0003008787,0.7410551,0.001038983,0.000153683,0.001753076,0.002726055,0.003698604,0.02712552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01102435,"threshold_uncertainty_score":0.03688014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2049584363","doi":"10.1007/s10458-013-9243-z","title":"Trust-oriented buyer strategies for seller reporting and selection in competitive electronic marketplaces","year":2013,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University; University of New Brunswick","funders":"","keywords":"Reputation; Business; Forward auction; Honesty; Quality (philosophy); Database transaction; Trustworthiness; Profit (economics); Incentive; Marketing; Microeconomics; Computer science; Internet privacy; Economics","authors":[{"name":"Zeinab Noorian","is_ca":true},{"name":"Jie Zhang","is_ca":false},{"name":"Yuan Liu","is_ca":false},{"name":"Stephen Marsh","is_ca":true},{"name":"Michael W. Fleming","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07330937049235403,"gpt":0.3619929258109881,"spread":0.288683555318634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009751881,0.0005694024,0.001626391,0.001091076,0.00123966,0.005308606,0.002463476,0.002719654,0.00661805],"category_scores_gemma":[0.0729712,0.001258505,0.00099124,0.001031374,0.003108695,0.008301457,0.001763128,0.002106111,0.0005805041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002411101,"about_ca_system_score_gemma":0.001604678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003539929,"about_ca_topic_score_gemma":0.00273774,"domain_scores_codex":[0.9965257,0.001881339,0.0002411248,0.0004225831,0.0004429993,0.0004862174],"domain_scores_gemma":[0.9357426,0.05016547,0.006857925,0.002592286,0.003300066,0.001341572],"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.001432014,0.0004779381,0.01422948,0.0003715048,0.0002829106,0.001072553,0.001994653,0.2215693,0.002533372,0.7100822,0.002909374,0.04304468],"study_design_scores_gemma":[0.0001537017,0.0001631185,0.002561901,0.00003203169,0.00008714417,0.0002466998,0.0006274315,0.7118887,0.0007199752,0.282884,0.0005617585,0.0000734431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5588111,0.0007054877,0.4174579,0.002567594,0.00008798443,0.0002081338,0.0001632078,0.0002017667,0.01979685],"genre_scores_gemma":[0.9916229,0.0001181295,0.006075303,0.00003816012,0.00002603436,0.00002628145,0.00001759811,0.00001438311,0.00206122],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009751881,"threshold_uncertainty_score":0.05157351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2553081833","doi":"10.1007/s10458-016-9350-8","title":"A novel abstraction for swarm intelligence: particle field optimization","year":2016,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Abstraction; Swarm intelligence; Swarm behaviour; Computer science; Perspective (graphical); Metaheuristic; Field (mathematics); Set (abstract data type); Heuristic; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics","authors":[{"name":"Nathan Bell","is_ca":true},{"name":"B. John Oommen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07563508047408636,"gpt":0.3298468779985365,"spread":0.2542117975244502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002981,0.001220747,0.001506794,0.001198754,0.0006383315,0.001827057,0.001416426,0.001143722,0.002179078],"category_scores_gemma":[0.002505212,0.000397494,0.001159806,0.002089774,0.001208431,0.00211455,0.002067982,0.002737986,0.0007561853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006092945,"about_ca_system_score_gemma":0.0007401271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001541482,"about_ca_topic_score_gemma":0.001438332,"domain_scores_codex":[0.9994276,0.0002574927,0.00003139054,0.00006307453,0.0001882207,0.00003229132],"domain_scores_gemma":[0.9995711,0.0001785798,0.00003830324,0.0001050393,0.00007226529,0.00003479978],"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.0000457835,0.00006864801,0.000540472,0.0002402427,0.000109157,0.00008021931,0.0001492544,0.1949762,0.002193011,0.6763718,0.006633976,0.1185912],"study_design_scores_gemma":[0.00002058736,0.00003493035,0.0001459298,0.00002973893,0.00002973643,0.00005508133,0.00002281631,0.7866739,0.0005379693,0.1979006,0.01453205,0.00001655749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001359629,0.0006990258,0.9935355,0.0002085223,0.0001479604,0.00002125543,0.00003048063,0.0001116569,0.003886007],"genre_scores_gemma":[0.1605591,0.003629663,0.8268811,0.0003630213,0.000708858,0.0003048089,0.0002334796,0.000292488,0.007027423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002179078,"threshold_uncertainty_score":0.007289767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1520809503","doi":"10.1023/a:1019608411687","title":"Interpreting Information Requests in Context A Collaborative Web Interface for Distance Learning","year":2002,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science","authors":[{"name":"Charles L. Ortiz","is_ca":true},{"name":"Barbara J. Grosz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02424286771596026,"gpt":0.2672952112842475,"spread":0.2430523435682872,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001945945,0.0006604145,0.0004403562,0.0009226108,0.000661315,0.003909674,0.0009041022,0.001816292,0.01175027],"category_scores_gemma":[0.009273869,0.0003639613,0.0002587208,0.0006071036,0.0005119279,0.003550852,0.001590987,0.0009331356,0.003170091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005359608,"about_ca_system_score_gemma":0.0004799782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003011783,"about_ca_topic_score_gemma":0.002603203,"domain_scores_codex":[0.9985536,0.0007020741,0.0001017099,0.0001563329,0.0004047807,0.00008166099],"domain_scores_gemma":[0.9966087,0.002147252,0.0001504564,0.0003500659,0.0005335512,0.0002100657],"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.004092974,0.0007997339,0.01497933,0.0008364012,0.0001197488,0.00389125,0.02974476,0.01527037,0.111989,0.07762172,0.07469913,0.6659555],"study_design_scores_gemma":[0.0004453596,0.0006254833,0.01283983,0.0004477611,0.0003747592,0.002052677,0.008639469,0.5512988,0.1137561,0.06119584,0.2479685,0.0003554143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2648789,0.0004736107,0.641113,0.002176289,0.0003175639,0.0006199811,0.001148856,0.0362247,0.05304715],"genre_scores_gemma":[0.8059297,0.0002634454,0.166987,0.0004180109,0.0001147503,0.0002624058,0.0008479438,0.001353199,0.02382365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01175027,"threshold_uncertainty_score":0.03930861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592731255","doi":"10.1007/s10458-018-9387-y","title":"Investigating the characteristics of one-sided matching mechanisms under various preferences and risk attitudes","year":2018,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Comparability; Lexicographical order; Matching (statistics); Set (abstract data type); Preference; Probabilistic logic; Mechanism (biology); Space (punctuation); Artificial intelligence; Econometrics; Risk analysis (engineering); Microeconomics; Mathematics; Economics; Statistics","authors":[{"name":"Hadi Hosseini","is_ca":false},{"name":"Kate Larson","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07665672668725818,"gpt":0.2617602587508666,"spread":0.1851035320636084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01325568,0.0004383031,0.001743962,0.001817367,0.001209811,0.003416521,0.003012518,0.003013625,0.008087756],"category_scores_gemma":[0.07704912,0.0007082259,0.001128405,0.001606895,0.002266714,0.006574239,0.001680781,0.001828244,0.0004565759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001481943,"about_ca_system_score_gemma":0.001787876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007936921,"about_ca_topic_score_gemma":0.000693981,"domain_scores_codex":[0.9963778,0.001797671,0.0002176629,0.0005728136,0.0003229498,0.0007110743],"domain_scores_gemma":[0.8865966,0.07975184,0.01831031,0.007601809,0.003711068,0.004028333],"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.00153539,0.0008941473,0.02490621,0.0003679664,0.0004048215,0.0004118561,0.001483207,0.1012283,0.009035324,0.8253282,0.00179994,0.03260462],"study_design_scores_gemma":[0.0003892887,0.0004649859,0.007863561,0.00006210014,0.0001714905,0.0003049247,0.0008909845,0.5777798,0.002174285,0.4091707,0.0006383121,0.00008964509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.923975,0.0002180726,0.07118414,0.0005131512,0.00002039132,0.0001548813,0.0001470145,0.00009926217,0.003688171],"genre_scores_gemma":[0.9929509,0.0001149646,0.005600091,0.00003536203,0.00001620394,0.0000734503,0.0000750414,0.00001390461,0.00112014],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01325568,"threshold_uncertainty_score":0.07010359,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2513805426","doi":"10.1007/s10458-017-9369-5","title":"Computational aspects of strategic behaviour in elections with top-truncated ballots","year":2017,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":8,"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":"Voting; Computer science; Constructive; Mathematical economics; Preference; Minimax; Focus (optics); Cardinal voting systems; Bullet voting; Computational complexity theory; Theoretical computer science; Political science; Microeconomics; Algorithm; Mathematics; Economics; Law","authors":[{"name":"Vijay Menon","is_ca":true},{"name":"Kate Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07740140233226057,"gpt":0.2746905057048963,"spread":0.1972891033726357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003561817,0.0004051369,0.001724669,0.0008728594,0.001344589,0.003941013,0.002401467,0.002065964,0.007791488],"category_scores_gemma":[0.03605673,0.0008038626,0.0009660112,0.0009384634,0.003088199,0.005553553,0.001816359,0.002507319,0.0004096489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001806312,"about_ca_system_score_gemma":0.001865041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007555264,"about_ca_topic_score_gemma":0.008219821,"domain_scores_codex":[0.9978543,0.00120995,0.00008446722,0.0002746499,0.0002593771,0.0003173043],"domain_scores_gemma":[0.9756539,0.02063853,0.001271282,0.0009874356,0.0006777132,0.0007711821],"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.0002367266,0.000112822,0.004015801,0.0001178937,0.00007602111,0.0001658539,0.0004593115,0.336733,0.000729295,0.6468266,0.001623086,0.008903489],"study_design_scores_gemma":[0.00002559758,0.00001506313,0.0004683279,0.00000976845,0.0000117223,0.00002477441,0.00009189558,0.6644429,0.0001491924,0.3345417,0.0002086039,0.00001050563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6019325,0.0004319158,0.3735059,0.002938817,0.0001037745,0.00007632664,0.000293003,0.0002321778,0.02048559],"genre_scores_gemma":[0.9867072,0.00007599505,0.01097332,0.00006946325,0.00003137691,0.0000326165,0.00009931598,0.00002932414,0.00198143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007791488,"threshold_uncertainty_score":0.02606511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975467105","doi":"10.1007/s10458-004-0555-x","title":"Normative Communication Models for Agent","year":2005,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Normative; Psychology; Computer science; Epistemology; Philosophy","authors":[{"name":"Renée Elio","is_ca":true},{"name":"Anita Petrinjak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0621550879024716,"gpt":0.2906736339763972,"spread":0.2285185460739256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00384544,0.001198674,0.0007914271,0.00164885,0.002804417,0.005184469,0.002837373,0.0033514,0.01408243],"category_scores_gemma":[0.0134559,0.0007309065,0.00104536,0.001635154,0.004451775,0.01099593,0.002432494,0.00401521,0.002954429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00314072,"about_ca_system_score_gemma":0.002208656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004430289,"about_ca_topic_score_gemma":0.003694362,"domain_scores_codex":[0.9961069,0.001837918,0.0002599795,0.0004451618,0.001046802,0.0003031987],"domain_scores_gemma":[0.9931204,0.003277197,0.0004288066,0.001228066,0.001675708,0.0002698886],"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.000001949787,0.000004664983,0.00001172878,0.000007786359,0.000001460855,0.000008752961,0.0000613515,0.0009587703,0.00001888236,0.9968509,0.0008567389,0.001217034],"study_design_scores_gemma":[0.000003858283,0.000002409145,0.000008706897,0.00001086424,0.000002942654,0.00001583272,0.00004298644,0.01039611,0.00005896403,0.9813457,0.008107247,0.00000435326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007891318,0.001310497,0.7666297,0.008706741,0.0007005774,0.0001542981,0.0003859327,0.0004948631,0.213726],"genre_scores_gemma":[0.657153,0.00249124,0.2304298,0.002070306,0.001288292,0.001542827,0.001236853,0.0004564974,0.1033313],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01408243,"threshold_uncertainty_score":0.04711044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2919919830","doi":"10.1007/s10458-019-09405-1","title":"Inferring true voting outcomes in homophilic social networks","year":2019,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outcome (game theory); Converse; Computer science; Inference; Voting; Social network (sociolinguistics); Majority rule; Simple (philosophy); Binary number; Artificial intelligence; Machine learning; Data science; Data mining; Social media; Mathematics; Mathematical economics; World Wide Web","authors":[{"name":"John A. Doucette","is_ca":false},{"name":"Alan Tsang","is_ca":false},{"name":"Hadi Hosseini","is_ca":false},{"name":"Kate Larson","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02001194260747627,"gpt":0.282562049982171,"spread":0.2625501073746948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003103582,0.0004094724,0.0008094638,0.001283825,0.0006998452,0.001598131,0.001218282,0.001389839,0.001124943],"category_scores_gemma":[0.0310356,0.0004873184,0.0004374541,0.0008924404,0.0008708636,0.003258379,0.0008784521,0.001155978,0.0004097951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006298337,"about_ca_system_score_gemma":0.0003454028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002673212,"about_ca_topic_score_gemma":0.004657475,"domain_scores_codex":[0.9980102,0.001067082,0.00009282183,0.0004156972,0.0002473326,0.0001668543],"domain_scores_gemma":[0.9758682,0.02060903,0.00134472,0.001049418,0.0007957609,0.0003328989],"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.001242967,0.0007465944,0.290762,0.0003348837,0.0006576967,0.0009836806,0.001493586,0.5075629,0.004590358,0.06349405,0.003642936,0.1244883],"study_design_scores_gemma":[0.00002006457,0.00003730453,0.01042979,0.0000129401,0.000031861,0.00006009176,0.0001619656,0.9549278,0.0007362537,0.03333579,0.0002341065,0.00001206593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.857334,0.0002131753,0.1390827,0.0005408944,0.00003304585,0.00004137817,0.0003952516,0.00008923775,0.002270383],"genre_scores_gemma":[0.9951958,0.00004892611,0.004237052,0.00001909527,0.00002288378,0.000015786,0.0001730084,0.000005114385,0.0002822275],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003103582,"threshold_uncertainty_score":0.01641351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388551180","doi":"10.1007/s10458-023-09628-3","title":"ASN: action semantics network for multiagent reinforcement learning","year":2023,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Semantics (computer science); Artificial intelligence; Action (physics); Action selection; Artificial neural network; Multi-agent system; Programming language; Perception","authors":[{"name":"Tianpei Yang","is_ca":true},{"name":"Weixun Wang","is_ca":false},{"name":"Jianye Hao","is_ca":false},{"name":"Matthew E. Taylor","is_ca":true},{"name":"Yong Liu","is_ca":false},{"name":"Xiaotian Hao","is_ca":false},{"name":"Yujing Hu","is_ca":false},{"name":"Yingfeng Chen","is_ca":false},{"name":"Changjie Fan","is_ca":false},{"name":"Chunxu Ren","is_ca":false},{"name":"Ye Huang","is_ca":false},{"name":"Jiangcheng Zhu","is_ca":false},{"name":"Yang Gao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08029373040729547,"gpt":0.3143184978309977,"spread":0.2340247674237022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009295625,0.0006098769,0.0006488987,0.0006783214,0.000426765,0.0009724643,0.001226867,0.0008524017,0.006979271],"category_scores_gemma":[0.003070351,0.0003091906,0.0005946842,0.0005233989,0.0005907865,0.001427126,0.001033462,0.001477825,0.001391708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055426,"about_ca_system_score_gemma":0.001551472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00588685,"about_ca_topic_score_gemma":0.00775491,"domain_scores_codex":[0.9996386,0.0001260979,0.00002832627,0.00007360692,0.00009893697,0.00003445978],"domain_scores_gemma":[0.9992815,0.0003043014,0.00005436222,0.0001270949,0.0001659453,0.00006689933],"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.0006421441,0.0002184821,0.001042742,0.0003306505,0.00008813383,0.0001942069,0.0001241585,0.5040024,0.004956281,0.1910735,0.02917764,0.2681497],"study_design_scores_gemma":[0.00003111059,0.00002876239,0.00009588798,0.00001590053,0.00001373682,0.00003266247,0.00001025572,0.8995678,0.001653776,0.08935808,0.00918216,0.000009831511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003725223,0.0001239891,0.9866676,0.000193353,0.000142009,0.00008172087,0.0007976446,0.005330429,0.002937856],"genre_scores_gemma":[0.3684182,0.0004136431,0.6181701,0.0003491809,0.00008897608,0.0006619643,0.002634406,0.0008938048,0.008369761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006979271,"threshold_uncertainty_score":0.02334791,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082633051","doi":"10.1007/s10458-008-9035-z","title":"Computational logic-based agents","year":2008,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science","authors":[{"name":"Francesca Toni","is_ca":false},{"name":"Jamal Bentahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06283576573167605,"gpt":0.2775219474011982,"spread":0.2146861816695222,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820902,0.0005527436,0.0005327729,0.001329086,0.001616383,0.007137789,0.001923698,0.001459437,0.01111824],"category_scores_gemma":[0.00652688,0.0004359465,0.0007645543,0.0009646192,0.004083584,0.006164468,0.002630104,0.002174362,0.002298338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001848598,"about_ca_system_score_gemma":0.001791489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001748015,"about_ca_topic_score_gemma":0.001830483,"domain_scores_codex":[0.9982431,0.0007050575,0.0001420105,0.0002967175,0.0005038591,0.0001093694],"domain_scores_gemma":[0.9966701,0.001684341,0.0001964519,0.00064409,0.0005758376,0.0002292862],"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.00001596822,0.00002243916,0.0001382295,0.00004308074,0.00001146726,0.00004151886,0.0001761155,0.002032552,0.0002673165,0.9836035,0.00234882,0.01129908],"study_design_scores_gemma":[0.00001835435,0.000009639743,0.0000659686,0.00003063118,0.00001238614,0.00004764455,0.00008265743,0.01525509,0.0004837271,0.9457412,0.03824438,0.000008173228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01601848,0.002765454,0.7599642,0.01331966,0.0005969167,0.0001990748,0.0005509327,0.0009781636,0.2056071],"genre_scores_gemma":[0.4847768,0.00260533,0.4532458,0.002383547,0.0005822096,0.0003883834,0.001280068,0.000184813,0.05455305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01111824,"threshold_uncertainty_score":0.03719419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2227054253","doi":"10.1007/s10458-015-9313-5","title":"Exact and heuristic methods for solving Boolean games","year":2015,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Vlaamse regering; Queen's University; Fonds Wetenschappelijk Onderzoek; Queen's University Belfast","keywords":"Computer science; Heuristic; Boolean expression; Theoretical computer science; Representation (politics); Boolean data type; Mathematics; Boolean function; Algorithm; Artificial intelligence","authors":[{"name":"Sofie De Clercq","is_ca":false},{"name":"Kim Bauters","is_ca":false},{"name":"Steven Schockaert","is_ca":false},{"name":"Mihail Mihaylov","is_ca":false},{"name":"Ann Nowé","is_ca":false},{"name":"Martine De Cock","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08074663229481495,"gpt":0.3486333665235326,"spread":0.2678867342287176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00336608,0.001427645,0.001814617,0.00209664,0.000912662,0.002100454,0.003118359,0.001794661,0.00803981],"category_scores_gemma":[0.01589035,0.000805629,0.001451195,0.002343478,0.002429305,0.004079965,0.001883219,0.00314892,0.0006724948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002719035,"about_ca_system_score_gemma":0.002799174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01023625,"about_ca_topic_score_gemma":0.01464052,"domain_scores_codex":[0.9976653,0.000940081,0.0001351585,0.0002532362,0.00076444,0.000241878],"domain_scores_gemma":[0.9914423,0.007276281,0.0002612516,0.000460643,0.0004088203,0.000150782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001791813,0.0002043214,0.0005911634,0.0004440583,0.0001125883,0.00006261649,0.0001909339,0.4275339,0.0005433938,0.4097198,0.004868392,0.1555497],"study_design_scores_gemma":[0.00005918254,0.00002253583,0.00008652076,0.00003809022,0.00002481714,0.00001734149,0.00003351907,0.6758338,0.0001971638,0.3222283,0.001447255,0.00001164235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005649361,0.0008870062,0.9854682,0.000371649,0.00009150353,0.00007850634,0.0001071572,0.0002567651,0.007089864],"genre_scores_gemma":[0.2110054,0.001183903,0.7802699,0.0003376033,0.0002107327,0.0004062165,0.0003464879,0.0001803803,0.006059447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01023625,"threshold_uncertainty_score":0.02689582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389395619","doi":"10.1007/s10458-023-09607-8","title":"Uniformly constrained reinforcement learning","year":2023,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"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":"Exploratory Research for Advanced Technology","keywords":"Reinforcement learning; Markov decision process; Mathematical optimization; Operator (biology); Counterexample; Probabilistic logic; Context (archaeology); Computer science; Heuristic; Constraint (computer-aided design); Monotonic function; Markov process; Mathematics; Artificial intelligence","authors":[{"name":"Jaeyoung Lee","is_ca":true},{"name":"Sean Sedwards","is_ca":true},{"name":"Krzysztof Czarnecki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04139100013431038,"gpt":0.2750660092176482,"spread":0.2336750090833378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009650646,0.0008828427,0.001102281,0.0003745417,0.0003907992,0.001035346,0.001001786,0.001189973,0.006524146],"category_scores_gemma":[0.005832674,0.0004059833,0.0003059603,0.0004668394,0.00133043,0.001436411,0.001890366,0.001266539,0.0006180778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009976408,"about_ca_system_score_gemma":0.0009828283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003183447,"about_ca_topic_score_gemma":0.002285379,"domain_scores_codex":[0.9993551,0.0002225873,0.00002989525,0.0001727037,0.0001354016,0.00008418824],"domain_scores_gemma":[0.9980286,0.001238515,0.000148171,0.0001806703,0.0002584429,0.0001457306],"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.0002368683,0.00008823974,0.0004320483,0.0001329173,0.0000445337,0.00008545804,0.00004251,0.8427047,0.001519534,0.09946688,0.00337268,0.05187372],"study_design_scores_gemma":[0.0000202717,0.00003177453,0.00007608325,0.00000794145,0.000004967699,0.00001311118,0.000004286654,0.978216,0.000332195,0.02069912,0.0005896626,0.000004662162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02762546,0.0006804053,0.9554843,0.0005096963,0.0001221433,0.00006332522,0.0001139037,0.0004121931,0.01498857],"genre_scores_gemma":[0.9422298,0.0003126701,0.0463503,0.0002116998,0.00006872074,0.0001516926,0.0001792892,0.00009292757,0.01040289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006524146,"threshold_uncertainty_score":0.02182543,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994414840","doi":"10.1007/s10458-015-9285-5","title":"Privacy preserving existence recognition and construction of hypertree agent organization","year":2015,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Data Management and Algorithms","field":"Computer Science","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 Guelph","funders":"","keywords":"Computer science; Probabilistic logic; Constraint (computer-aided design); Hyperbolic tree; Scheme (mathematics); Tree (set theory); Private information retrieval; Theoretical computer science; Adjacency list; Artificial intelligence; Computer security; Mathematics; Algorithm","authors":[{"name":"Yang Xiang","is_ca":true},{"name":"Kamala Srinivasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1016631319861277,"gpt":0.2630290996846375,"spread":0.1613659676985097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009030359,0.0002140628,0.0005936428,0.001084449,0.001194194,0.001972203,0.001398986,0.0007882238,0.001410075],"category_scores_gemma":[0.004140813,0.0004539668,0.0008101429,0.001309442,0.001262223,0.003427519,0.003388255,0.001558103,0.0003859685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006907251,"about_ca_system_score_gemma":0.001176481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001277659,"about_ca_topic_score_gemma":0.001359778,"domain_scores_codex":[0.9988483,0.0002785002,0.0000889217,0.0002958166,0.0003299833,0.0001584415],"domain_scores_gemma":[0.9961778,0.0009821677,0.000368151,0.00162951,0.000563927,0.0002784446],"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.0005133018,0.000294403,0.009800439,0.0002314354,0.00009434817,0.0005003011,0.002166474,0.1254827,0.04036725,0.4832885,0.007035377,0.3302255],"study_design_scores_gemma":[0.0000198582,0.00008616675,0.001458791,0.00003499443,0.00003920148,0.0003215301,0.0006316438,0.7269719,0.01849571,0.2456146,0.006294811,0.00003093855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1127132,0.000118846,0.8832496,0.0002666742,0.00002624746,0.000069972,0.0002176102,0.0005421478,0.00279579],"genre_scores_gemma":[0.648823,0.0001502377,0.3472111,0.00008717652,0.00002201546,0.000110668,0.0008588136,0.0001200922,0.00261703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001972203,"threshold_uncertainty_score":0.005011618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412368978","doi":"10.1007/s10458-025-09714-8","title":"Diversity-seeking jump games in networks","year":2025,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Price of anarchy; Jump; Mathematical economics; Node (physics); Fraction (chemistry); Diversity (politics); Class (philosophy); Computer science; Function (biology); Stability (learning theory); Mathematical optimization; Mathematics; Economics; Price of stability; Artificial intelligence","authors":[{"name":"Lata Narayanan","is_ca":true},{"name":"Yasaman Sabbagh","is_ca":true},{"name":"Alexandros A. Voudouris","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09937112948378411,"gpt":0.3655412427002712,"spread":0.2661701132164871,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397773,0.000475675,0.0008733198,0.0006838405,0.0006776565,0.001372854,0.0009610384,0.001289107,0.002406445],"category_scores_gemma":[0.005470405,0.0002404145,0.0004942238,0.0005516743,0.002046961,0.001812741,0.001151581,0.001132682,0.0001343074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001398313,"about_ca_system_score_gemma":0.0004436149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002379561,"about_ca_topic_score_gemma":0.001715105,"domain_scores_codex":[0.9989278,0.0006096061,0.00003235542,0.0001330671,0.0001519748,0.0001451518],"domain_scores_gemma":[0.9962547,0.002851306,0.0002955345,0.00009957777,0.0001735599,0.0003253947],"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.000154151,0.00006906036,0.001112302,0.00008455934,0.00006844645,0.0002595672,0.0002922861,0.440902,0.00296955,0.5468358,0.001268247,0.005984033],"study_design_scores_gemma":[0.00003855906,0.00004987206,0.0002280471,0.00001075717,0.000008609919,0.00003478153,0.00008688747,0.7458379,0.0003119541,0.2526803,0.0007006961,0.00001162026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.490094,0.0004365494,0.4823278,0.001977539,0.00007004342,0.0001254326,0.000168439,0.00009814903,0.0247019],"genre_scores_gemma":[0.9894475,0.000118375,0.007743413,0.0001154395,0.00002383704,0.00006671671,0.00002935464,0.000007250997,0.002448232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002406445,"threshold_uncertainty_score":0.01014549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413370993","doi":"10.1007/s10458-025-09721-9","title":"Designing policies for transition-independent multiagent systems that are robust to communication loss","year":2025,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Army Research Laboratory; Air Force Research Laboratory; Army Research Office","keywords":"Transition (genetics); Computer science; Multi-agent system; Distributed computing; Artificial intelligence; Chemistry","authors":[{"name":"Mustafa O. Karabag","is_ca":false},{"name":"Cyrus Neary","is_ca":true},{"name":"Ufuk Topcu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06207849552602331,"gpt":0.2945134472691957,"spread":0.2324349517431724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002470099,0.001352567,0.001269613,0.0007397181,0.000714843,0.001399031,0.00159125,0.001712,0.001662823],"category_scores_gemma":[0.01175629,0.0009662874,0.0006712106,0.0004636885,0.001582921,0.00173056,0.002593784,0.002481741,0.0005220297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001086243,"about_ca_system_score_gemma":0.002004133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002335793,"about_ca_topic_score_gemma":0.001648723,"domain_scores_codex":[0.9987329,0.0003571296,0.00008905916,0.0002882543,0.0002802923,0.000252397],"domain_scores_gemma":[0.9940555,0.003582255,0.0009181711,0.0004207869,0.000690848,0.0003324022],"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.0001226355,0.00006611555,0.0004623902,0.00009469542,0.00005067347,0.0001029167,0.0001426867,0.957977,0.003818669,0.01818707,0.0006963201,0.01827882],"study_design_scores_gemma":[0.00002010424,0.00003375463,0.00006172196,0.000009153151,0.000007239302,0.00001272512,0.00001823971,0.9912509,0.0006715484,0.00769392,0.0002153526,0.000005374296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02316224,0.0001556589,0.9739067,0.00026527,0.00005395036,0.0001016998,0.00002910315,0.0003694595,0.001955889],"genre_scores_gemma":[0.9141182,0.0001977863,0.08302137,0.0001757369,0.0000420062,0.0002706526,0.00007613219,0.0001227034,0.001975486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002470099,"threshold_uncertainty_score":0.01306331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}