{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001248838,0.0005539199,0.0006943492,0.0003256096,0.000665837,0.0003746518,0.0008227883,0.0002692052,0.00002354238],"category_scores_gemma":[0.00007856508,0.0004919429,0.0001317812,0.0003219964,0.00007033638,0.0008734062,0.0003543093,0.0002160933,0.0002150001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004929107,"about_ca_system_score_gemma":0.0002718621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001466619,"about_ca_topic_score_gemma":0.0001669832,"domain_scores_codex":[0.9956428,0.0005389072,0.001141671,0.001288171,0.0005490651,0.0008394258],"domain_scores_gemma":[0.9976508,0.00008140555,0.0005352253,0.0009875769,0.0001875602,0.0005574504],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002505147,0.01125231,0.09907141,0.003442951,0.00360069,0.002032753,0.2046824,0.05661008,0.02811508,0.1647823,0.004367632,0.4217919],"study_design_scores_gemma":[0.02168708,0.001488527,0.2988199,0.0009983733,0.0002528786,0.0009981061,0.004468791,0.2149239,0.007867709,0.0002730248,0.4427434,0.005478306],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.232412,0.0006304829,0.7621904,0.0001083721,0.003004441,0.00110224,0.00001261169,0.0004823027,0.00005712154],"genre_scores_gemma":[0.7682129,0.00007440759,0.2294607,0.0003499665,0.0001951745,0.0002247814,0.00008160359,0.00005863829,0.001341846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5358008,"threshold_uncertainty_score":0.9997532,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002783558,0.0004612051,0.000485823,0.0003313702,0.0002912221,0.000469362,0.0009964514,0.0001837682,0.00003961286],"category_scores_gemma":[0.000008745146,0.0004236592,0.0001219429,0.0004443654,0.00004997123,0.000504203,0.000514574,0.0002613858,0.0001243338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001805943,"about_ca_system_score_gemma":0.00001990723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231293,"about_ca_topic_score_gemma":0.001233971,"domain_scores_codex":[0.9969932,0.0001929723,0.0006136678,0.000992622,0.000408486,0.0007990451],"domain_scores_gemma":[0.9984329,0.00007011626,0.0003012553,0.0008465249,0.00005964147,0.0002895402],"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.00005346561,0.003695949,0.5422171,0.002965228,0.001332251,0.005723967,0.1436354,0.1339629,0.0009095653,0.00193052,0.002613339,0.1609604],"study_design_scores_gemma":[0.001591164,0.00008612507,0.06377299,0.0003686567,0.00002888378,0.000150472,0.000549665,0.9179452,0.00004879385,0.00002240192,0.01469317,0.0007424557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9320387,0.003295852,0.06040334,0.000289598,0.001907499,0.00114413,0.00002185508,0.0004938459,0.0004051383],"genre_scores_gemma":[0.9941021,0.0002007343,0.003752224,0.0007052553,0.00005804634,0.00009253001,0.00001400859,0.00004657375,0.00102858],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7839823,"threshold_uncertainty_score":0.9998215,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001216136,0.0002224049,0.0003408771,0.000140295,0.0001283623,0.0001267125,0.0005132077,0.00009352862,0.0000141041],"category_scores_gemma":[0.00007851667,0.0001979465,0.00007216677,0.0002090204,0.0000592844,0.0004050514,0.0002002165,0.0001114841,0.00006527548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008877759,"about_ca_system_score_gemma":0.00008558315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001867643,"about_ca_topic_score_gemma":0.00001281675,"domain_scores_codex":[0.9980686,0.00023435,0.0005365442,0.0003106401,0.0003368746,0.0005129657],"domain_scores_gemma":[0.9985338,0.0001364224,0.0003675697,0.0006006775,0.0001166007,0.0002449627],"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.00001328268,0.000477245,0.7583708,0.0003878576,0.0002442389,0.00001337557,0.003726563,0.2262678,0.0006338895,0.002697127,0.003855247,0.003312567],"study_design_scores_gemma":[0.000767431,0.00007488515,0.2529084,0.00005041674,0.0000140189,0.000005158865,0.00006118571,0.741416,0.0001893309,2.886011e-7,0.00428455,0.0002283648],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05566288,0.000502663,0.9407591,0.00004546454,0.001855876,0.0005434519,0.0000127305,0.0001311061,0.0004867641],"genre_scores_gemma":[0.9934121,0.00001727051,0.005330982,0.0001310175,0.0000355932,0.00001808645,0.00001985863,0.00001945481,0.001015643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9377492,"threshold_uncertainty_score":0.8072025,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004449597,0.0006076887,0.0005757289,0.0003436915,0.0006579201,0.0007423622,0.000851438,0.0002479528,0.00009007498],"category_scores_gemma":[0.00005349615,0.0005182776,0.0001618435,0.0003841337,0.00008694938,0.0003274751,0.0003660911,0.0002329109,0.0002487956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002226291,"about_ca_system_score_gemma":0.0001493498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003976764,"about_ca_topic_score_gemma":0.0001742757,"domain_scores_codex":[0.9960189,0.0002830464,0.001042485,0.00118426,0.0007282108,0.0007430491],"domain_scores_gemma":[0.9979886,0.00008369402,0.0005462209,0.0008431074,0.0002104807,0.0003278792],"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.0001337001,0.006520917,0.3700506,0.002826554,0.002258376,0.001285496,0.02534224,0.1639468,0.07821407,0.2577591,0.04695232,0.04470981],"study_design_scores_gemma":[0.003913526,0.0001483879,0.3686503,0.000139216,0.00007038948,0.000361468,0.0002385278,0.569272,0.001436469,0.00027555,0.05409132,0.001402865],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5325283,0.002355704,0.456194,0.0003911448,0.004605366,0.002323723,0.00008758978,0.0007975278,0.000716668],"genre_scores_gemma":[0.980324,0.00004549465,0.0129339,0.000327004,0.0004628542,0.00009914888,0.0001037838,0.00006705594,0.005636727],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4477958,"threshold_uncertainty_score":0.9997269,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007981152,0.0002320845,0.0003511543,0.0002370901,0.000169851,0.0001489498,0.0003426344,0.00009459502,0.000006698844],"category_scores_gemma":[0.00001389443,0.0002160871,0.0000550086,0.0001570277,0.00004710917,0.001001721,0.0002970042,0.00009914036,0.000006636465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001707121,"about_ca_system_score_gemma":0.00006029568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001017632,"about_ca_topic_score_gemma":0.0001858476,"domain_scores_codex":[0.9979007,0.0001471373,0.0008892698,0.0004169334,0.0002954665,0.0003504548],"domain_scores_gemma":[0.9988296,0.00002841709,0.0004467036,0.0004819526,0.00008561425,0.0001277032],"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.0001286359,0.003413392,0.1040219,0.002438713,0.0007083629,0.00001967371,0.08817126,0.1066911,0.0425211,0.1257887,0.001859298,0.5242378],"study_design_scores_gemma":[0.001967027,0.0000479207,0.02404723,0.0001118825,0.00001489602,0.000008226493,0.0003916218,0.9699677,0.0008836874,0.0000157733,0.002325514,0.0002185074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6461194,0.001016802,0.3512713,0.0002287363,0.0001634368,0.001002827,0.0000220422,0.00006123529,0.0001142399],"genre_scores_gemma":[0.9776366,0.000451515,0.02137611,0.00009287415,0.00002494046,0.0001197935,0.00003564429,0.00001476359,0.0002477574],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8632766,"threshold_uncertainty_score":0.8811775,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186938,0.0001852578,0.0002489338,0.0001607388,0.0005597767,0.000476052,0.0003165342,0.0001496985,0.0003815009],"category_scores_gemma":[0.0001534913,0.0001432834,0.0000936721,0.0002533193,0.0001231632,0.0005251027,0.00008678409,0.0001896305,0.0004712813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006154322,"about_ca_system_score_gemma":0.00005693414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002630151,"about_ca_topic_score_gemma":0.0000835573,"domain_scores_codex":[0.9976971,0.000215391,0.0008272525,0.0004986185,0.0004995001,0.0002620959],"domain_scores_gemma":[0.9983653,0.0001477495,0.0004542364,0.0005644647,0.0002727548,0.0001955321],"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.0002649355,0.001816738,0.006564217,0.0001759555,0.0004570889,0.00005320376,0.01239236,0.3120495,0.1612573,0.378393,0.04577179,0.08080392],"study_design_scores_gemma":[0.001898934,0.00008849852,0.01646283,0.00003597814,0.00007131897,0.0002182652,0.005986448,0.6504373,0.001450173,0.002219297,0.3204921,0.000638917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7482691,0.0000363926,0.2479826,0.0004239821,0.001412138,0.0006945967,0.00007525989,0.0001381384,0.0009677746],"genre_scores_gemma":[0.9916003,0.00001312339,0.0008201906,0.000187611,0.0001420528,0.0001004441,0.00008617619,0.00001454808,0.007035599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3761737,"threshold_uncertainty_score":0.6057525,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001726823,0.0006220591,0.000757419,0.0002719732,0.000545415,0.000966899,0.001343895,0.0001980148,0.00001208466],"category_scores_gemma":[0.00002881737,0.0005678895,0.0001904421,0.0003772771,0.00006054522,0.0005585767,0.0006821505,0.0001995482,0.00008191387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005764695,"about_ca_system_score_gemma":0.000192808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001611295,"about_ca_topic_score_gemma":0.00007816347,"domain_scores_codex":[0.9953056,0.0003010621,0.001120616,0.001488197,0.0006370559,0.001147461],"domain_scores_gemma":[0.9972053,0.0001186997,0.0005209789,0.001441389,0.000230687,0.0004829873],"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.00005558547,0.0007882027,0.00264491,0.001126841,0.0005128141,0.0002217226,0.002731211,0.8879893,0.0002248412,0.02110886,0.01423455,0.06836115],"study_design_scores_gemma":[0.001337013,0.0001608737,0.0009094941,0.0001498564,0.00004864454,0.00003566242,0.0002021499,0.8988651,0.0000101373,0.00002083044,0.09766509,0.0005951542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04039665,0.002634587,0.9479901,0.00007221116,0.002569018,0.004919465,0.0000726738,0.0004974763,0.0008478429],"genre_scores_gemma":[0.9767069,0.0008090194,0.009276704,0.0002842416,0.0002005337,0.003311854,0.00007217268,0.00007561928,0.009262926],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9387134,"threshold_uncertainty_score":0.9996772,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001519712,0.0004496397,0.0005485942,0.0002450734,0.0008195922,0.0004968818,0.0006538253,0.0001770676,0.000001894069],"category_scores_gemma":[0.00004835396,0.0004296646,0.0001178128,0.0001720701,0.00003823814,0.001017659,0.0006026746,0.0001671496,0.00001858101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003376802,"about_ca_system_score_gemma":0.00006162388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006547272,"about_ca_topic_score_gemma":0.00002551567,"domain_scores_codex":[0.9969409,0.000170274,0.0009039298,0.0007632375,0.0003909667,0.0008306996],"domain_scores_gemma":[0.9977251,0.00008438541,0.0004995295,0.001013362,0.0001443875,0.0005331822],"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.0001045832,0.002669784,0.03601916,0.003236355,0.00101473,0.000009748617,0.1396724,0.6427128,0.04227419,0.04330078,0.007730648,0.08125483],"study_design_scores_gemma":[0.001212043,0.00004382419,0.004907985,0.0003281394,0.00004105459,0.00001600035,0.0002918425,0.9881338,0.0004509876,0.00002305872,0.004056801,0.0004943894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2650506,0.001812062,0.7297757,0.0002484607,0.0008272867,0.001900471,0.0000280121,0.0001781706,0.0001792558],"genre_scores_gemma":[0.9371183,0.0001461043,0.06007942,0.0003476561,0.0001246032,0.0005146919,0.00003500818,0.00005460048,0.001579628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6720677,"threshold_uncertainty_score":0.9998155,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001502606,0.0002268854,0.000464813,0.0002055382,0.0008791917,0.0001681668,0.0002907012,0.0001111965,0.00004259637],"category_scores_gemma":[0.00004220409,0.0002133285,0.00006370814,0.0002876611,0.0001650919,0.0003919307,0.0001889405,0.0001920412,0.000006327252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002974996,"about_ca_system_score_gemma":0.0001095463,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02536183,"about_ca_topic_score_gemma":0.0007771831,"domain_scores_codex":[0.9972584,0.0005328522,0.0007490741,0.0004762596,0.0004666875,0.000516705],"domain_scores_gemma":[0.998997,0.00005107521,0.0004492106,0.0002418402,0.00006977314,0.0001910834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0004786458,0.004655056,0.7690208,0.002161406,0.0007243527,0.0002599445,0.1154138,0.01381207,0.005129107,0.04650087,0.0008483613,0.04099558],"study_design_scores_gemma":[0.00923954,0.0003859336,0.4058056,0.000194109,0.0001476116,0.00003349257,0.06026358,0.3915283,0.00003465532,0.00001010774,0.1313567,0.001000343],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9889036,0.003471328,0.002086038,0.0001092566,0.001645829,0.00279931,0.0001195578,0.00009858992,0.0007665359],"genre_scores_gemma":[0.9971973,0.000286853,0.00008413482,0.00003476763,0.00007333168,0.000528671,0.00004514461,0.00002471311,0.001725103],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3777162,"threshold_uncertainty_score":0.9811284,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001421665,0.000856875,0.0008669018,0.000293433,0.000824307,0.0004071029,0.0005033065,0.0002485262,0.00002127574],"category_scores_gemma":[0.0000273606,0.0008038984,0.00024662,0.0002069891,0.00003042959,0.0002456076,0.0002342294,0.0003162014,0.0001222511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008251457,"about_ca_system_score_gemma":0.00002558426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004151845,"about_ca_topic_score_gemma":0.00004337239,"domain_scores_codex":[0.995528,0.0001851921,0.001466494,0.001070915,0.0005186498,0.001230738],"domain_scores_gemma":[0.9980467,0.00008479838,0.0004272574,0.0008241025,0.000144381,0.0004727627],"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.00002736628,0.001055371,0.008207169,0.008508677,0.00371907,0.00007690881,0.01085925,0.9168959,0.001856134,0.002240226,0.0014238,0.04513013],"study_design_scores_gemma":[0.00134789,0.0001118904,0.001856428,0.0003085352,0.0003451149,0.00002739753,0.001659651,0.9180037,0.0001480255,0.000003103119,0.07528269,0.0009055856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2349176,0.004995266,0.7462127,0.00002007325,0.007058931,0.004750955,0.0001115354,0.001477071,0.0004559113],"genre_scores_gemma":[0.9723912,0.002855062,0.02225909,0.00003785774,0.0002681511,0.0007436094,0.00006793025,0.0002365731,0.001140475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7374736,"threshold_uncertainty_score":0.9994412,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002788849,0.0001856029,0.0002103868,0.0001211053,0.0002622811,0.0002385179,0.0002244407,0.0001648968,0.0000300152],"category_scores_gemma":[0.00005755351,0.0001788202,0.00006387105,0.0001620799,0.00002982268,0.0004617252,0.00006903648,0.0000888932,0.00001278611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000080923,"about_ca_system_score_gemma":0.00005940396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001372227,"about_ca_topic_score_gemma":0.000004784154,"domain_scores_codex":[0.9986569,0.00007451565,0.0004252288,0.0004310184,0.0001579326,0.0002543704],"domain_scores_gemma":[0.9990821,0.00005423243,0.0002809837,0.0002967929,0.0001524852,0.0001333964],"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.00006166081,0.00101869,0.01588081,0.0004799373,0.0003245743,0.00001059552,0.0236057,0.2339273,0.0001267943,0.6695105,0.0007140328,0.0543394],"study_design_scores_gemma":[0.001204012,0.0001027157,0.006202034,0.00005651707,0.00002069129,0.000008559285,0.00009928778,0.9896084,0.00002122047,0.000561714,0.00187747,0.0002373763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001669636,0.00008535547,0.9926186,0.0000881107,0.003618152,0.001410132,0.000009302943,0.0002428286,0.0002578588],"genre_scores_gemma":[0.7118708,0.00006046599,0.2874157,0.000104266,0.0001070168,0.0002007259,0.00002975532,0.00001902385,0.0001922338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7556811,"threshold_uncertainty_score":0.7292075,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004427124,0.0003360834,0.0003748378,0.0001445026,0.0003876158,0.0004561527,0.0004638389,0.0001456946,0.0000223067],"category_scores_gemma":[0.00001300127,0.0003087151,0.00009216619,0.0001802031,0.00005077853,0.0005012923,0.0001866212,0.0001107637,0.0001110043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002165495,"about_ca_system_score_gemma":0.00006532737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002231081,"about_ca_topic_score_gemma":0.0000332773,"domain_scores_codex":[0.9974832,0.0001707442,0.0007138056,0.0006524805,0.0004787083,0.0005010562],"domain_scores_gemma":[0.9987033,0.00006444402,0.0003901873,0.0005172224,0.0001397052,0.0001851421],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004945345,0.00425017,0.3182005,0.001509834,0.001032465,0.0003291098,0.006751241,0.006237113,0.01372695,0.1970863,0.4414904,0.009336442],"study_design_scores_gemma":[0.003683539,0.00009333605,0.05038599,0.00008149567,0.00004218106,0.00004647532,0.0003448745,0.762612,0.0004176074,0.00005540719,0.1814962,0.0007408919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2366232,0.00169397,0.7523275,0.00100908,0.003818534,0.002435733,0.0001383273,0.0005680815,0.001385567],"genre_scores_gemma":[0.988677,0.00004290314,0.001999009,0.0002063343,0.0001503033,0.00007744977,0.0001577875,0.00002704575,0.00866217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7563749,"threshold_uncertainty_score":0.9999365,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006786602,0.00039573,0.0004430194,0.0001806466,0.0006742208,0.0005878081,0.0005369711,0.0001797322,0.000009058415],"category_scores_gemma":[0.00001763377,0.0003595329,0.00008315337,0.0001622607,0.0000803185,0.0004821258,0.0001845639,0.0001592558,0.0000215903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002214292,"about_ca_system_score_gemma":0.00004475034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005015248,"about_ca_topic_score_gemma":0.0002096719,"domain_scores_codex":[0.9971651,0.0005794029,0.0006500619,0.0007182046,0.0004025438,0.000484694],"domain_scores_gemma":[0.9984119,0.0001032082,0.0004203397,0.0007704199,0.00008391743,0.0002102421],"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.000454152,0.02353483,0.3027918,0.003919898,0.001438764,0.0006905353,0.1033296,0.01465621,0.0356463,0.08357052,0.2386826,0.1912847],"study_design_scores_gemma":[0.004948547,0.000291517,0.1213481,0.0001373286,0.00005637415,0.00001234822,0.001313509,0.8443252,0.0003874698,0.00002391474,0.02625108,0.0009046111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8665085,0.002287592,0.1243197,0.000947324,0.001195502,0.003025755,0.000229099,0.0006132518,0.0008732732],"genre_scores_gemma":[0.9965941,0.00005549669,0.001023911,0.0003679305,0.0001282567,0.0001803291,0.0004178039,0.00003919706,0.001192977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.829669,"threshold_uncertainty_score":0.9998857,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002066832,0.000176483,0.0003293139,0.0001821419,0.0003570624,0.000414288,0.0001219387,0.000091012,0.0001451278],"category_scores_gemma":[0.0002967863,0.0001374844,0.00005376896,0.0002771786,0.00007823463,0.0004659646,0.00004804173,0.0001196107,0.00004122689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008240964,"about_ca_system_score_gemma":0.00008377685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004541907,"about_ca_topic_score_gemma":0.0001454425,"domain_scores_codex":[0.9975412,0.0001868521,0.001126016,0.0005670366,0.0002326287,0.0003462535],"domain_scores_gemma":[0.9983407,0.0003244074,0.0008718494,0.0001445869,0.0002166155,0.0001018369],"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.0003512765,0.001455537,0.3463298,0.0004014653,0.0005804963,0.00001533778,0.02366035,0.01007105,0.02071531,0.5071709,0.01541509,0.07383332],"study_design_scores_gemma":[0.002696193,0.0002523409,0.3128085,0.0000979521,0.00005237916,0.0001192964,0.06180765,0.419966,0.0003177673,0.007678901,0.1934889,0.0007140513],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9549577,0.0002562733,0.04155231,0.0001744911,0.0002108082,0.001626011,0.00001302175,0.00005887423,0.001150497],"genre_scores_gemma":[0.991336,0.00004483952,0.0004162339,0.00005737579,0.00005863719,0.0005482166,0.000007533309,0.00001431176,0.007516809],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.499492,"threshold_uncertainty_score":0.5606453,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005395287,0.0001542735,0.0001863679,0.00009214629,0.0001966048,0.0002767459,0.000339618,0.00008618154,0.00004170506],"category_scores_gemma":[0.0002344259,0.0001111744,0.00005281851,0.0001563365,0.00003014366,0.0004303228,0.0001188321,0.00005435518,0.00004443478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008798652,"about_ca_system_score_gemma":0.00006257659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001150391,"about_ca_topic_score_gemma":0.000003541407,"domain_scores_codex":[0.9984362,0.00005266346,0.0004411816,0.0004735299,0.0002555691,0.0003409056],"domain_scores_gemma":[0.9988038,0.0002539635,0.0001708056,0.0003795588,0.0002071703,0.0001847358],"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.00007322287,0.001332583,0.001396267,0.0003573272,0.0002908079,0.00002265098,0.00207584,0.4944169,0.007013871,0.03014608,0.003442894,0.4594316],"study_design_scores_gemma":[0.0006764248,0.00009926391,0.0003431835,0.00003818888,0.000009003967,0.00001548572,0.0000491666,0.9906934,0.002261379,0.00001479996,0.005632829,0.0001668474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001326494,0.00009646617,0.9956675,0.0008272551,0.000976307,0.0008763601,0.00001608585,0.0001215933,0.0000919353],"genre_scores_gemma":[0.7109598,0.0002312789,0.2829171,0.0001853819,0.0001352442,0.000311159,0.000008025463,0.00002635293,0.005225733],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7127504,"threshold_uncertainty_score":0.4533562,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006799713,0.0002818851,0.0003997168,0.0002372101,0.0002499755,0.0005439441,0.0003555356,0.0001248022,0.00001016862],"category_scores_gemma":[0.0001700409,0.0002637835,0.00006638907,0.0002956262,0.0000324223,0.001566246,0.0001332497,0.0001766005,0.00006362407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002818975,"about_ca_system_score_gemma":0.00003763294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002891987,"about_ca_topic_score_gemma":0.0001825086,"domain_scores_codex":[0.9977877,0.0002331187,0.0008754756,0.0004612617,0.0002255868,0.0004168708],"domain_scores_gemma":[0.9986761,0.0001482189,0.000556995,0.0003019575,0.0001858597,0.0001309291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002316477,0.001570645,0.0969827,0.003829774,0.0006413522,0.00009024522,0.4982719,0.04560299,0.006411009,0.05006615,0.02123945,0.2750621],"study_design_scores_gemma":[0.001604374,0.0001102605,0.001149553,0.0003925234,0.000006139099,0.000009297574,0.002333436,0.8896671,0.00009329033,0.000003494068,0.1043414,0.0002891288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1518134,0.002287665,0.8398295,0.0003756047,0.00190221,0.002776072,0.00004312182,0.0002643807,0.0007080393],"genre_scores_gemma":[0.9960783,0.0001424379,0.0022021,0.0001484117,0.00004448721,0.0003132316,0.00001520425,0.00001755093,0.001038286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8442649,"threshold_uncertainty_score":0.9999815,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001673351,0.0002286554,0.00056493,0.00009942518,0.000452852,0.0002125634,0.0002295031,0.0001200954,0.0000306372],"category_scores_gemma":[0.0001299362,0.0001887551,0.00005685723,0.00009134869,0.0002294352,0.0001377462,0.0001377279,0.000163225,0.00005085875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004066286,"about_ca_system_score_gemma":0.00001966619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004436757,"about_ca_topic_score_gemma":0.0001354274,"domain_scores_codex":[0.9981262,0.0001417149,0.000922435,0.0004427922,0.00006824468,0.0002986057],"domain_scores_gemma":[0.9982474,0.0001703159,0.001083979,0.0003353631,0.00005180165,0.0001111119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00001890482,0.0002982133,0.4653366,0.0007898906,0.0009167927,0.000003040611,0.02136,0.0002073628,0.001258874,0.506927,0.00007468347,0.002808693],"study_design_scores_gemma":[0.001339306,0.0003308321,0.939127,0.0006785968,0.0001215127,0.00003208144,0.002673904,0.02786672,0.0002506535,0.0253948,0.001458362,0.0007262166],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9768859,0.000751589,0.02012958,0.00004269915,0.0008906309,0.000520685,0.0001740922,0.00004615498,0.0005586245],"genre_scores_gemma":[0.9979157,0.0002151854,0.0009146355,0.00007913761,0.0001463951,0.00003301946,0.000008881765,0.00002890854,0.0006580654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4815322,"threshold_uncertainty_score":0.769721,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005567854,0.0001838277,0.0004755259,0.0001937684,0.0002996519,0.0001881992,0.0002303777,0.00009743861,0.00003643037],"category_scores_gemma":[0.00002284036,0.0001806894,0.00005408008,0.00007999878,0.00009082923,0.0001809999,0.00004357414,0.0001219217,0.00005007187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008542056,"about_ca_system_score_gemma":0.00004364578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004658769,"about_ca_topic_score_gemma":0.0002858911,"domain_scores_codex":[0.9985602,0.000040154,0.000680232,0.0003962451,0.00005453222,0.0002686678],"domain_scores_gemma":[0.9987189,0.00002751817,0.0007580336,0.0003557043,0.00004877098,0.00009107434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00001726524,0.0002703442,0.8145481,0.0001022393,0.00007933712,0.0000211034,0.0007024827,0.005401054,0.00002928535,0.1787592,0.00002227242,0.0000472691],"study_design_scores_gemma":[0.002115159,0.0001624112,0.9478799,0.0001513563,0.00001635894,0.0000383085,0.0004870335,0.04680965,0.00003116032,0.001546592,0.0004382554,0.0003238641],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.989032,0.0003640788,0.001147661,0.00004460432,0.0005170141,0.0004906941,0.00009653725,0.00003214492,0.008275278],"genre_scores_gemma":[0.9982796,0.00001626622,0.0001549086,0.00001317276,0.00004180512,0.00004045482,0.00002200561,0.00002331603,0.001408505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1772126,"threshold_uncertainty_score":0.73683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000829804,0.0003383482,0.0004215274,0.0001725769,0.0005461266,0.0004284513,0.0007644455,0.0001483542,0.000009075885],"category_scores_gemma":[0.00002110396,0.000303316,0.0001410705,0.0001497954,0.00004179603,0.00131215,0.0002663065,0.0001246139,0.00009789041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002628472,"about_ca_system_score_gemma":0.00005944663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004909126,"about_ca_topic_score_gemma":0.00007267455,"domain_scores_codex":[0.9975327,0.0002157089,0.0008310342,0.0006161661,0.0003223701,0.0004819772],"domain_scores_gemma":[0.998026,0.0001126774,0.0004948344,0.0009341598,0.0001949379,0.0002373668],"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.00009856817,0.003365566,0.00384544,0.001855833,0.001334861,0.0000237272,0.09672873,0.2634729,0.003222429,0.3127327,0.0600566,0.2532626],"study_design_scores_gemma":[0.00144957,0.00005605096,0.001727992,0.0000902305,0.00002299209,0.00001620461,0.0002687282,0.9171127,0.0001525938,0.00006814337,0.07868537,0.0003494091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02528629,0.002016352,0.9673564,0.0007295915,0.0009826623,0.002446078,0.00005004051,0.0002899622,0.0008426003],"genre_scores_gemma":[0.9641896,0.0003024084,0.03172298,0.0003707041,0.0001577355,0.0004972299,0.00005936665,0.00003185432,0.002668134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9389033,"threshold_uncertainty_score":0.9999419,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002423104,0.0002315879,0.0004414866,0.00007859192,0.0002083032,0.0001690587,0.0001551385,0.0000915323,0.00005469433],"category_scores_gemma":[0.000003133007,0.0002195365,0.0001133236,0.0001076683,0.00003231658,0.0001554967,0.0001139332,0.0002085031,0.00004260963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007431241,"about_ca_system_score_gemma":0.00003327137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002436791,"about_ca_topic_score_gemma":0.00003348957,"domain_scores_codex":[0.9985567,0.00006937985,0.0004700679,0.0003525015,0.0001313523,0.0004199545],"domain_scores_gemma":[0.9994887,0.00004201221,0.0001951474,0.0001515375,0.00003192127,0.00009072677],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.000002131789,0.0001073001,0.9736313,0.00003026345,0.00006746955,0.000002344854,0.001115246,0.009866508,0.00001997555,0.01283238,0.00002196001,0.002303099],"study_design_scores_gemma":[0.00115667,0.00001905012,0.6138492,0.00005922477,0.00001174212,5.590358e-7,0.0009569836,0.3818685,0.000001049755,0.00002651073,0.00173019,0.0003202676],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.994378,0.00008491382,0.002482191,0.00005924868,0.001120197,0.0006065374,0.00002662356,0.00003870722,0.001203585],"genre_scores_gemma":[0.9982123,0.000006461466,0.00003749372,0.00006497838,0.0002138719,0.00004995956,0.00002618625,0.00002802126,0.001360761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.372002,"threshold_uncertainty_score":0.8952441,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001033784,0.0003562682,0.0003980105,0.0001989714,0.0007791067,0.0005297711,0.0005337138,0.0001558317,0.00000768313],"category_scores_gemma":[0.00008618327,0.0003407899,0.0001437544,0.0004119226,0.00003895762,0.0003902216,0.0004270154,0.0002350032,0.0002146709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001909576,"about_ca_system_score_gemma":0.00006483382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001284435,"about_ca_topic_score_gemma":0.000006025089,"domain_scores_codex":[0.9971378,0.0001312546,0.0007305323,0.0006728976,0.0004484908,0.0008790228],"domain_scores_gemma":[0.9984505,0.0001743862,0.0004454863,0.000565514,0.0001308376,0.0002333283],"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.000005528162,0.00002294842,0.002244665,0.000197118,0.0001152087,0.00001463633,0.000990572,0.9843906,0.0001360415,0.002202862,0.006256566,0.003423227],"study_design_scores_gemma":[0.0009559125,0.0001681401,0.003061454,0.00009140838,0.00003061205,0.000009899033,0.0002424809,0.8512602,0.00005534204,0.000006109,0.143784,0.0003344143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008090792,0.0001510313,0.9851484,0.0002303316,0.003703816,0.001636824,0.000002448216,0.0008248229,0.0002115696],"genre_scores_gemma":[0.9615466,0.0004706599,0.01246109,0.000195581,0.000403608,0.0003066923,0.0001148115,0.00006315859,0.02443781],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9726873,"threshold_uncertainty_score":0.9999044,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003047884,0.0003227625,0.0003790743,0.0001480499,0.0005804267,0.0002112168,0.0006309227,0.0001283709,0.00003740257],"category_scores_gemma":[0.00003171905,0.0002701684,0.000128235,0.0002104303,0.0001099707,0.0002778896,0.000216424,0.0001364855,0.0003352775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001282484,"about_ca_system_score_gemma":0.0001708795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000218804,"about_ca_topic_score_gemma":0.000007060095,"domain_scores_codex":[0.9977644,0.0001554994,0.0004832204,0.0007085952,0.000384432,0.0005038337],"domain_scores_gemma":[0.9987634,0.00008678647,0.0002322254,0.0004660999,0.000144724,0.0003067071],"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.00008885047,0.007511517,0.3144796,0.001179152,0.001229708,0.004253802,0.02955326,0.2650644,0.0004853384,0.2025685,0.1344059,0.03917999],"study_design_scores_gemma":[0.001681399,0.0001078846,0.0751284,0.00004096196,0.00001397772,0.000148608,0.00004582726,0.8797224,0.00002804326,0.00008752349,0.04257088,0.0004240988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1405538,0.001439271,0.8487293,0.0002580739,0.002693164,0.0009750901,0.0000245015,0.0005550665,0.00477177],"genre_scores_gemma":[0.9844626,0.0000520036,0.01119202,0.0006512688,0.0001198501,0.00006038028,0.00003259062,0.00002099004,0.003408318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8439088,"threshold_uncertainty_score":0.999975,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001250985,0.0002638902,0.0004045254,0.00009876016,0.0002435834,0.0004742069,0.0003742022,0.0001008498,0.000002390985],"category_scores_gemma":[0.00020744,0.0002119821,0.00007261861,0.00009098468,0.00005924341,0.0002903315,0.0002886099,0.00008966384,0.00001745362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008608238,"about_ca_system_score_gemma":0.00008933196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002282963,"about_ca_topic_score_gemma":0.00001158678,"domain_scores_codex":[0.9982526,0.0001635155,0.0003775835,0.0006217101,0.000134649,0.000449911],"domain_scores_gemma":[0.9986817,0.0001981086,0.000192289,0.0004095635,0.0001228743,0.0003954599],"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.00006635278,0.001066945,0.02690945,0.001801446,0.0007597348,0.0001578217,0.05413082,0.0007038501,0.002194105,0.1056117,0.02844078,0.7781569],"study_design_scores_gemma":[0.001923406,0.0002459784,0.005873594,0.00008334428,0.00005191981,0.00009874158,0.000561604,0.8180392,0.0001637234,0.0003883298,0.1720605,0.0005095708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01739162,0.007342553,0.9710312,0.00008152275,0.00198177,0.0008224841,0.000006527944,0.0002017245,0.001140532],"genre_scores_gemma":[0.920433,0.0001310904,0.07466979,0.0001245085,0.0001850026,0.000114374,0.000005984894,0.00002737026,0.004308813],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9030414,"threshold_uncertainty_score":0.8644381,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007425547,0.0003024093,0.0003325786,0.0002737012,0.0004747839,0.0005043563,0.0006014588,0.0001131736,0.00002090005],"category_scores_gemma":[0.00006675496,0.0002772574,0.00008699841,0.0004512795,0.00007357893,0.0004049147,0.000494472,0.0002455379,0.0006371072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001233007,"about_ca_system_score_gemma":0.00009985054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000201536,"about_ca_topic_score_gemma":0.000002196738,"domain_scores_codex":[0.9975739,0.0001142136,0.0006312952,0.0005437264,0.0004529827,0.0006839052],"domain_scores_gemma":[0.998746,0.00008953743,0.0003010334,0.0005279179,0.0000851294,0.0002503404],"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.000002131181,0.00001861299,0.002719218,0.00009860898,0.00009120273,0.00007282429,0.001942393,0.9805279,0.0002079779,0.009686578,0.00167692,0.002955642],"study_design_scores_gemma":[0.0008601074,0.0001270528,0.003126947,0.00006706882,0.00001300567,0.00002652875,0.0004760858,0.9354092,0.0000359511,0.000004595324,0.05953708,0.0003163065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01567437,0.0001092069,0.9742734,0.0002566894,0.001858122,0.0009206998,0.000002094269,0.001297945,0.005607435],"genre_scores_gemma":[0.9623129,0.0001513691,0.001991423,0.0001536921,0.00006928064,0.00006198142,0.00004116448,0.00002911661,0.03518905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.972282,"threshold_uncertainty_score":0.9999679,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003658539,0.000154285,0.0002070815,0.0001183913,0.0001113659,0.0002733139,0.0003261265,0.00005362069,0.000005362598],"category_scores_gemma":[0.00007373021,0.0001411435,0.00001907072,0.0002297546,0.00005306677,0.0009038743,0.0004884029,0.00005136776,0.00002065754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005044747,"about_ca_system_score_gemma":0.00003503231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004114833,"about_ca_topic_score_gemma":0.000005198751,"domain_scores_codex":[0.998713,0.00008236905,0.0003642142,0.0004183776,0.0002333339,0.0001887252],"domain_scores_gemma":[0.999026,0.00002006906,0.0002501723,0.000376431,0.0001806159,0.0001467092],"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.0000383859,0.001190686,0.1362212,0.002086059,0.0006147706,0.0001417936,0.02234863,0.0005759569,0.002963796,0.01985654,0.008766417,0.8051958],"study_design_scores_gemma":[0.005386313,0.0004468439,0.07772891,0.0006018674,0.0001738309,0.0002658931,0.002742973,0.8560377,0.001596828,0.0008580842,0.05291084,0.001249893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6540123,0.0006771191,0.3416758,0.0002270274,0.001662523,0.0009362779,0.00003879957,0.0001999007,0.0005703252],"genre_scores_gemma":[0.948997,0.0003196582,0.04946663,0.00006923407,0.00008908485,0.00002557551,0.0001050241,0.0000204329,0.0009073338],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8554618,"threshold_uncertainty_score":0.5755664,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001783755,0.0001659656,0.0003361162,0.0003102276,0.0007214989,0.0002266632,0.0005552181,0.0001024275,0.00005800734],"category_scores_gemma":[0.000140274,0.0001342305,0.00007785756,0.00056351,0.00008657634,0.0001635009,0.0008347104,0.0001453092,0.00009120572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007434049,"about_ca_system_score_gemma":0.00003236773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005183255,"about_ca_topic_score_gemma":0.0001001158,"domain_scores_codex":[0.9980151,0.0002390551,0.0005981201,0.0005432017,0.0002970545,0.0003074883],"domain_scores_gemma":[0.998779,0.0003742404,0.0001831527,0.0004843601,0.00007537062,0.000103872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00004432764,0.0005710177,0.837191,0.00006482792,0.0001425524,0.00005527405,0.008407103,0.03550508,0.0003156792,0.04305447,0.01072239,0.06392626],"study_design_scores_gemma":[0.001322679,0.00002416766,0.4787438,0.0001469391,0.00003718134,0.000006811028,0.003898111,0.3802756,0.00002464279,0.001435888,0.1337475,0.0003366795],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8917679,0.001197433,0.09986929,0.0003483176,0.001272228,0.0007716287,0.00001324417,0.00007825922,0.004681666],"genre_scores_gemma":[0.9839528,0.00005393155,0.00009389504,0.0002746664,0.00004146933,0.00003772311,0.000003572087,0.000006842723,0.01553516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3584473,"threshold_uncertainty_score":0.5549259,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008425469,0.0003609989,0.0004848728,0.0003330534,0.0007260157,0.0009636536,0.001004586,0.0001582571,0.000001977927],"category_scores_gemma":[0.00004904246,0.0003461397,0.0001229342,0.0002708468,0.00005047682,0.0003840046,0.0003332779,0.0001711669,0.00002600265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003610183,"about_ca_system_score_gemma":0.00008910843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001009866,"about_ca_topic_score_gemma":0.00003236633,"domain_scores_codex":[0.9974563,0.0002450326,0.0007049081,0.0006421753,0.0003809047,0.0005707559],"domain_scores_gemma":[0.9979829,0.0002079385,0.0003757188,0.001000621,0.0002133675,0.0002194507],"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.000008751922,0.00008882831,0.002484124,0.0003909447,0.0001527785,0.000007527508,0.004378841,0.9864802,0.0002007845,0.003498037,0.001853689,0.0004554999],"study_design_scores_gemma":[0.001332688,0.0000789085,0.005863879,0.0006834547,0.00005772389,0.00001537061,0.002544072,0.9722301,0.0003587011,0.000004688977,0.01642115,0.0004092654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008677289,0.0009966324,0.9845087,0.0008397721,0.001591848,0.00291632,0.00002170882,0.0002681827,0.000179533],"genre_scores_gemma":[0.9727675,0.0001302255,0.02223361,0.0005256783,0.00005524897,0.0006015357,0.00003208838,0.00003117767,0.003622988],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9640902,"threshold_uncertainty_score":0.9998991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}