{"meta":{"query_hash":"a643a06750ce","filters":{"venue":"Autonomous Agents and Multi-Agent Systems"},"cohort_total":27,"direct_labels_cover":0,"predictions_cover":27,"exported":27,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a643a06750ce","api":"https://metacan.xera.ac/api/v1/cohort?venue=Autonomous+Agents+and+Multi-Agent+Systems"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science","score_opus":0.02424286771596026,"score_gpt":0.2672952112842475,"score_spread":0.24305234356828723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520809503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26487887,0.00047361074,0.641113,0.0021762887,0.00031756386,0.00061998115,0.0011488559,0.0362247,0.05304715],"genre_scores_gemma":[0.8059297,0.0002634454,0.16698696,0.00041801087,0.000114750255,0.00026240578,0.00084794377,0.0013531991,0.023823654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985536,0.0007020741,0.0001017099,0.00015633287,0.0004047807,0.00008166099],"domain_scores_gemma":[0.99660873,0.0021472522,0.0001504564,0.00035006594,0.0005335512,0.0002100657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019459447,0.00066041446,0.00044035623,0.0009226108,0.00066131505,0.0039096745,0.00090410217,0.001816292,0.011750269],"category_scores_gemma":[0.009273869,0.00036396133,0.00025872077,0.00060710363,0.00051192794,0.003550852,0.0015909865,0.00093313557,0.0031700912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004092974,0.0007997339,0.014979329,0.0008364012,0.00011974879,0.00389125,0.029744763,0.015270366,0.11198899,0.07762172,0.07469913,0.6659555],"study_design_scores_gemma":[0.00044535962,0.0006254833,0.01283983,0.0004477611,0.00037475923,0.002052677,0.008639469,0.5512988,0.113756076,0.061195843,0.24796852,0.00035541432],"about_ca_topic_score_codex":0.0030117834,"about_ca_topic_score_gemma":0.0026032026,"teacher_disagreement_score":0.011750269,"about_ca_system_score_codex":0.00053596083,"about_ca_system_score_gemma":0.00047997825,"threshold_uncertainty_score":0.039308608},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Matching (statistics); The Internet; Semantic matching; Process (computing); Context (archaeology); Java; Signature (topology); Software agent; Information retrieval; World Wide Web; Programming language; Artificial intelligence","score_opus":0.02508627846054041,"score_gpt":0.25330056853637845,"score_spread":0.22821429007583804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944800461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046092737,0.00042030797,0.9157842,0.0008022426,0.0004786343,0.0002442072,0.00025837883,0.021281032,0.014638291],"genre_scores_gemma":[0.60613894,0.00033129597,0.36449906,0.0003573797,0.00012168744,0.00024068804,0.00076706364,0.0012226809,0.026321204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839944,0.0005072239,0.000097558295,0.00032800346,0.00047091962,0.00019682168],"domain_scores_gemma":[0.997577,0.001106057,0.00017401199,0.00065150816,0.00021473684,0.00027664367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024783516,0.00064580154,0.0011417962,0.0009677408,0.0014160258,0.0037415081,0.0025418315,0.0015639174,0.010406527],"category_scores_gemma":[0.0070125596,0.00085745286,0.0005507736,0.00097448565,0.0017341413,0.0067037083,0.0055410895,0.0015442747,0.0027718302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025740797,0.00075745553,0.003060269,0.00062178593,0.00024291883,0.0015282365,0.0020886434,0.17707913,0.045305636,0.1918101,0.03733351,0.53759825],"study_design_scores_gemma":[0.0002170659,0.00018265765,0.0006677377,0.000034408673,0.00008862684,0.00029944582,0.0005929415,0.82408506,0.02323697,0.10684091,0.04368153,0.00007263325],"about_ca_topic_score_codex":0.003232417,"about_ca_topic_score_gemma":0.00410478,"teacher_disagreement_score":0.010406527,"about_ca_system_score_codex":0.0008287454,"about_ca_system_score_gemma":0.0012940629,"threshold_uncertainty_score":0.034813285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Normative; Psychology; Computer science; Epistemology; Philosophy","score_opus":0.062155087902471595,"score_gpt":0.2906736339763972,"score_spread":0.22851854607392563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975467105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007891318,0.001310497,0.7666297,0.008706741,0.0007005774,0.00015429808,0.00038593268,0.0004948631,0.21372601],"genre_scores_gemma":[0.65715295,0.00249124,0.23042978,0.0020703056,0.0012882923,0.0015428268,0.0012368526,0.00045649736,0.10333125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961069,0.0018379184,0.00025997948,0.0004451618,0.0010468025,0.0003031987],"domain_scores_gemma":[0.99312043,0.003277197,0.00042880664,0.0012280656,0.0016757083,0.00026988855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038454398,0.001198674,0.0007914271,0.0016488504,0.0028044172,0.0051844693,0.002837373,0.0033514,0.014082431],"category_scores_gemma":[0.013455901,0.0007309065,0.0010453605,0.0016351544,0.0044517745,0.010995931,0.002432494,0.00401521,0.0029544288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001949787,0.0000046649834,0.000011728785,0.000007786359,0.0000014608553,0.000008752961,0.0000613515,0.00095877034,0.000018882358,0.9968509,0.00085673895,0.0012170343],"study_design_scores_gemma":[0.0000038582825,0.0000024091453,0.0000087068975,0.000010864239,0.000002942654,0.000015832722,0.00004298644,0.010396111,0.000058964033,0.9813457,0.008107247,0.0000043532596],"about_ca_topic_score_codex":0.0044302894,"about_ca_topic_score_gemma":0.003694362,"teacher_disagreement_score":0.014082431,"about_ca_system_score_codex":0.0031407198,"about_ca_system_score_gemma":0.0022086557,"threshold_uncertainty_score":0.04711044},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10166313198612774,"score_gpt":0.2630290996846375,"score_spread":0.16136596769850975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994414840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11271315,0.00011884603,0.8832496,0.00026667424,0.000026247459,0.000069972,0.00021761018,0.0005421478,0.0027957896],"genre_scores_gemma":[0.64882296,0.00015023774,0.34721106,0.00008717652,0.00002201546,0.00011066802,0.00085881364,0.00012009223,0.00261703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988483,0.0002785002,0.0000889217,0.0002958166,0.0003299833,0.00015844147],"domain_scores_gemma":[0.9961778,0.0009821677,0.000368151,0.0016295096,0.000563927,0.0002784446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090303586,0.00021406279,0.0005936428,0.0010844495,0.0011941941,0.0019722034,0.001398986,0.0007882238,0.0014100751],"category_scores_gemma":[0.0041408134,0.00045396676,0.0008101429,0.0013094416,0.001262223,0.0034275185,0.003388255,0.0015581035,0.00038596845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051330175,0.000294403,0.009800439,0.0002314354,0.00009434817,0.00050030113,0.0021664742,0.12548268,0.04036725,0.48328853,0.0070353774,0.33022547],"study_design_scores_gemma":[0.000019858197,0.00008616675,0.0014587914,0.000034994435,0.000039201477,0.0003215301,0.00063164375,0.72697186,0.018495707,0.24561456,0.0062948107,0.000030938547],"about_ca_topic_score_codex":0.0012776587,"about_ca_topic_score_gemma":0.0013597782,"teacher_disagreement_score":0.0019722034,"about_ca_system_score_codex":0.0006907251,"about_ca_system_score_gemma":0.0011764808,"threshold_uncertainty_score":0.005011618},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.10237441112004474,"score_gpt":0.32111085098820047,"score_spread":0.21873643986815572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997518979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041716136,0.00011814449,0.93779635,0.0016598771,0.00023998538,0.00046413342,0.00048971863,0.010815395,0.006700255],"genre_scores_gemma":[0.64236414,0.00012205643,0.34639192,0.00094095943,0.00016283948,0.0006160082,0.0014397454,0.0030172216,0.004945028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9800909,0.0076140044,0.0010428606,0.002982425,0.00526009,0.0030097535],"domain_scores_gemma":[0.9186373,0.052084655,0.0033312615,0.018233605,0.0063379672,0.0013751588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008120264,0.0017905274,0.0018794592,0.0017318594,0.002038981,0.004349048,0.0061627943,0.002406636,0.009922516],"category_scores_gemma":[0.055600785,0.0017512394,0.0068632127,0.0015104625,0.005000559,0.008596772,0.011194097,0.009683112,0.0017375959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015211757,0.0005592918,0.0046561025,0.0010448967,0.00046425656,0.00084059144,0.0016709602,0.5098969,0.011052893,0.31452584,0.012540601,0.14122646],"study_design_scores_gemma":[0.00018663998,0.000121629186,0.00023601831,0.00006955131,0.00018383982,0.00008298576,0.0003168246,0.75111884,0.013944276,0.23038791,0.0032908497,0.000060642902],"about_ca_topic_score_codex":0.026866239,"about_ca_topic_score_gemma":0.024292452,"teacher_disagreement_score":0.026866239,"about_ca_system_score_codex":0.0041975714,"about_ca_system_score_gemma":0.010766457,"threshold_uncertainty_score":0.05341971},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Variety (cybernetics); Computer science; Bayesian probability; Artificial intelligence; Machine learning; Bayesian inference","score_opus":0.11342614202947376,"score_gpt":0.3749390473540108,"score_spread":0.261512905324537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020087586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27704504,0.00039257103,0.7095726,0.0008929794,0.0000931478,0.00020506485,0.00010277017,0.00018806507,0.011507826],"genre_scores_gemma":[0.94447404,0.00012759514,0.051004708,0.000057269885,0.00003885954,0.00017299401,0.00006843609,0.00003168189,0.0040244376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811685,0.0009359522,0.00009573708,0.00030187602,0.00028627994,0.00026329944],"domain_scores_gemma":[0.98973644,0.0074414155,0.0010748891,0.00060768926,0.00064597005,0.0004936845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033716562,0.000864766,0.0021369257,0.0006140659,0.0007857505,0.0014746196,0.00240559,0.0020173707,0.0026076187],"category_scores_gemma":[0.013400855,0.0010198108,0.0006942287,0.0008711196,0.001875848,0.0029225424,0.0020929847,0.0014964147,0.00025074437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032605775,0.0001569848,0.00058872637,0.00008009011,0.00009084811,0.00014833029,0.00019470854,0.90839905,0.0011840933,0.07123088,0.00074786803,0.016852383],"study_design_scores_gemma":[0.000059097754,0.00007187455,0.00013242428,0.0000064789824,0.0000135503415,0.000023134737,0.00004609667,0.93298125,0.00033201824,0.06609451,0.00023012448,0.000009400487],"about_ca_topic_score_codex":0.0035209733,"about_ca_topic_score_gemma":0.0036997031,"teacher_disagreement_score":0.0035209733,"about_ca_system_score_codex":0.0015940852,"about_ca_system_score_gemma":0.0020105278,"threshold_uncertainty_score":0.017831206},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06030290389340378,"score_gpt":0.26632870243759305,"score_spread":0.20602579854418926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032636061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002067583,0.00034605543,0.9897934,0.00034518295,0.00006538622,0.000094942065,0.000058163863,0.000128727,0.0071005286],"genre_scores_gemma":[0.16257612,0.0010157052,0.82423514,0.000239734,0.00022399475,0.0007570613,0.00030568108,0.00021840126,0.010428079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720407,0.001413008,0.00015282884,0.00029016536,0.0006964159,0.00024357319],"domain_scores_gemma":[0.9978574,0.0013826053,0.00010841414,0.00021648766,0.00022339082,0.0002116951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434424,0.0012309966,0.001823151,0.0016335462,0.0019943917,0.0041156127,0.005088882,0.0023197003,0.010116659],"category_scores_gemma":[0.008312771,0.0011051323,0.0022987265,0.0030377556,0.002070205,0.0050236825,0.004382339,0.0043404526,0.0012864769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048756767,0.00008874869,0.00010223351,0.00010685195,0.000054061285,0.00012280757,0.00016482739,0.1430359,0.00049028604,0.82479167,0.0034984173,0.027495451],"study_design_scores_gemma":[0.000049462473,0.000024610548,0.000037133403,0.000032381595,0.00002309206,0.000049773786,0.000051126794,0.6209632,0.00017789626,0.36999804,0.008573902,0.000019292942],"about_ca_topic_score_codex":0.0048883366,"about_ca_topic_score_gemma":0.0047993697,"teacher_disagreement_score":0.010116659,"about_ca_system_score_codex":0.0018771653,"about_ca_system_score_gemma":0.0022474185,"threshold_uncertainty_score":0.033843637},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019681265154324345,"score_gpt":0.2523091613955709,"score_spread":0.23262789624124658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033411943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049748246,0.015959183,0.74485934,0.010827111,0.00084933505,0.00022524247,0.00018529549,0.0004293614,0.17691697],"genre_scores_gemma":[0.7820892,0.007487062,0.18141854,0.00059875957,0.00059556356,0.0005682257,0.00024382117,0.000087898086,0.02691092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985784,0.00076257985,0.00007704781,0.0001559172,0.00030909284,0.000116964045],"domain_scores_gemma":[0.9976058,0.0012073417,0.00029726702,0.00029805704,0.0003369887,0.00025441466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015526245,0.0006480514,0.0005583562,0.0013180922,0.0017448639,0.008397176,0.0013890172,0.0026471373,0.0048772525],"category_scores_gemma":[0.0043280832,0.0006835164,0.0004977536,0.002054557,0.0046608555,0.00918679,0.0019123472,0.002218047,0.00065378187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018769483,0.0000047194485,0.000028624754,0.000012685222,0.0000022519598,0.000011311506,0.000120193,0.0017807109,0.00006337628,0.99606365,0.00026328632,0.0016473242],"study_design_scores_gemma":[0.000008884127,0.000005426932,0.000048399572,0.000022443803,0.000005502425,0.000018272525,0.00010061128,0.01124582,0.00010190644,0.9766659,0.0117720775,0.0000047379526],"about_ca_topic_score_codex":0.001449426,"about_ca_topic_score_gemma":0.0018351201,"teacher_disagreement_score":0.008397176,"about_ca_system_score_codex":0.0023310704,"about_ca_system_score_gemma":0.0016074957,"threshold_uncertainty_score":0.016913116},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07330937049235403,"score_gpt":0.3619929258109881,"score_spread":0.28868355531863404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049584363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5588111,0.0007054877,0.41745788,0.0025675944,0.00008798443,0.00020813379,0.00016320785,0.00020176673,0.019796854],"genre_scores_gemma":[0.99162287,0.00011812951,0.006075303,0.00003816012,0.000026034359,0.000026281448,0.000017598115,0.000014383107,0.0020612197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965257,0.0018813388,0.0002411248,0.00042258308,0.00044299927,0.00048621738],"domain_scores_gemma":[0.9357426,0.050165467,0.0068579246,0.0025922863,0.0033000659,0.0013415716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0097518815,0.00056940236,0.0016263911,0.0010910762,0.0012396596,0.0053086057,0.0024634756,0.002719654,0.0066180504],"category_scores_gemma":[0.0729712,0.0012585052,0.00099124,0.0010313739,0.0031086951,0.008301457,0.0017631281,0.002106111,0.0005805041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014320138,0.0004779381,0.01422948,0.00037150484,0.00028291062,0.0010725535,0.0019946531,0.22156934,0.002533372,0.7100822,0.0029093737,0.04304468],"study_design_scores_gemma":[0.00015370167,0.0001631185,0.002561901,0.000032031687,0.00008714417,0.00024669984,0.0006274315,0.71188873,0.0007199752,0.28288403,0.0005617585,0.0000734431],"about_ca_topic_score_codex":0.003539929,"about_ca_topic_score_gemma":0.00273774,"teacher_disagreement_score":0.0097518815,"about_ca_system_score_codex":0.0024111012,"about_ca_system_score_gemma":0.001604678,"threshold_uncertainty_score":0.051573515},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06430470677447479,"score_gpt":0.28584377584545256,"score_spread":0.22153906907097776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055921164","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019540193,0.008520793,0.9814387,0.00026697555,0.00010075221,0.00008090495,0.00013235926,0.00068773446,0.0068178372],"genre_scores_gemma":[0.118885204,0.024617137,0.84826297,0.00041781476,0.00034379357,0.00056700903,0.00088466314,0.00047175607,0.0055496343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.00029575298,0.00011221246,0.0001586496,0.00042897576,0.000067078014],"domain_scores_gemma":[0.9987143,0.0008001769,0.00006625631,0.00014506267,0.00023244595,0.000041753232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015685823,0.001619746,0.002730085,0.0012371318,0.0006101618,0.002119256,0.0040091393,0.0018575037,0.006367066],"category_scores_gemma":[0.0040429784,0.0011555156,0.0015403294,0.003400004,0.0008185172,0.0020589572,0.002403722,0.0022292084,0.0024083573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010457624,0.00011788833,0.00054641813,0.0012383085,0.00016622432,0.000050988558,0.000071665985,0.52662337,0.0006656771,0.05297909,0.0076984004,0.4097374],"study_design_scores_gemma":[0.000055487122,0.000048419024,0.00012639757,0.00014830244,0.000041359137,0.00004812752,0.000024196921,0.950703,0.0005168721,0.036987953,0.011283031,0.000016816532],"about_ca_topic_score_codex":0.004555707,"about_ca_topic_score_gemma":0.004043397,"teacher_disagreement_score":0.006367066,"about_ca_system_score_codex":0.0008268436,"about_ca_system_score_gemma":0.0016999706,"threshold_uncertainty_score":0.021299958},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018608350479378317,"score_gpt":0.2431439821922506,"score_spread":0.2245356317128723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067398088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052188843,0.0007636092,0.7890155,0.0053426214,0.0006009474,0.00020017383,0.00055554626,0.0018837256,0.14944914],"genre_scores_gemma":[0.89802974,0.00030520267,0.07937373,0.000504225,0.00029621116,0.0004165462,0.00063446845,0.0005423473,0.019897496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950293,0.002500495,0.00041415365,0.00071289664,0.000814705,0.00052846776],"domain_scores_gemma":[0.9873604,0.0072239367,0.00049168227,0.0025512779,0.0016578713,0.0007148875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042592864,0.00076586386,0.0007514428,0.0011813624,0.003546131,0.006633511,0.0022144725,0.0022114664,0.011791598],"category_scores_gemma":[0.017905978,0.00102901,0.0012670737,0.0012972677,0.0039050463,0.015468716,0.0057537453,0.004367306,0.0020119336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006898459,0.000016175381,0.00005918644,0.000039920193,0.000009002647,0.000112325666,0.001102348,0.0009962708,0.0007071038,0.9915468,0.0010966758,0.0042452174],"study_design_scores_gemma":[0.000031697913,0.000011824116,0.000036947422,0.000020366628,0.000014328236,0.000058573794,0.00048715563,0.01162365,0.00093262515,0.9762353,0.010534842,0.00001266229],"about_ca_topic_score_codex":0.001773373,"about_ca_topic_score_gemma":0.0012290307,"teacher_disagreement_score":0.011791598,"about_ca_system_score_codex":0.0017908317,"about_ca_system_score_gemma":0.0014810037,"threshold_uncertainty_score":0.03944677},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science","score_opus":0.06283576573167605,"score_gpt":0.27752194740119823,"score_spread":0.2146861816695222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082633051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016018482,0.002765454,0.7599642,0.01331966,0.00059691665,0.00019907481,0.00055093266,0.0009781636,0.20560709],"genre_scores_gemma":[0.48477677,0.00260533,0.45324582,0.002383547,0.0005822096,0.00038838337,0.0012800681,0.00018481305,0.054553054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982431,0.00070505746,0.00014201048,0.00029671745,0.0005038591,0.00010936944],"domain_scores_gemma":[0.99667007,0.0016843412,0.0001964519,0.00064409,0.00057583756,0.0002292862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018209023,0.0005527436,0.0005327729,0.0013290858,0.001616383,0.0071377894,0.0019236983,0.001459437,0.011118243],"category_scores_gemma":[0.0065268795,0.0004359465,0.00076455425,0.0009646192,0.0040835836,0.006164468,0.0026301038,0.0021743618,0.002298338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001596822,0.000022439159,0.00013822947,0.00004308074,0.000011467262,0.000041518862,0.00017611547,0.0020325521,0.00026731653,0.9836035,0.0023488202,0.011299082],"study_design_scores_gemma":[0.000018354354,0.0000096397425,0.000065968605,0.00003063118,0.000012386141,0.000047644546,0.00008265743,0.015255091,0.0004837271,0.9457412,0.038244378,0.000008173228],"about_ca_topic_score_codex":0.0017480154,"about_ca_topic_score_gemma":0.0018304834,"teacher_disagreement_score":0.011118243,"about_ca_system_score_codex":0.0018485975,"about_ca_system_score_gemma":0.001791489,"threshold_uncertainty_score":0.037194192},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016203147845006535,"score_gpt":0.23492205431767213,"score_spread":0.2187189064726656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084476420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26048622,0.00042257278,0.73020756,0.0006005348,0.0000890756,0.00010363286,0.000041121944,0.00023005885,0.007819189],"genre_scores_gemma":[0.98797077,0.00007471161,0.010565004,0.000020917121,0.000014085745,0.000036144265,0.000016174186,0.000011143315,0.0012910734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994869,0.00016321237,0.00003310751,0.00008415776,0.0001546561,0.0000778799],"domain_scores_gemma":[0.998642,0.00046862458,0.00034334388,0.00010101274,0.00031694517,0.0001281097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018978,0.0006753654,0.00067526405,0.0004545217,0.00067624036,0.001385928,0.0010546639,0.00072014245,0.0010954734],"category_scores_gemma":[0.0039207763,0.00022029465,0.00049909385,0.0002554325,0.0006289581,0.0011564966,0.0015418652,0.0005975025,0.00014608346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011129997,0.00012804808,0.0044101323,0.000077017925,0.00012171191,0.00033657876,0.00033217258,0.916661,0.006933534,0.035168253,0.0007652972,0.034954954],"study_design_scores_gemma":[0.000005643623,0.000036503654,0.00041668984,0.0000035659216,0.000012943365,0.000030905238,0.00004265272,0.9906007,0.00033741066,0.0083037615,0.00020275949,0.000006481426],"about_ca_topic_score_codex":0.0021239987,"about_ca_topic_score_gemma":0.0013138665,"teacher_disagreement_score":0.0021239987,"about_ca_system_score_codex":0.0008320101,"about_ca_system_score_gemma":0.0007927215,"threshold_uncertainty_score":0.006036639},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09158207467992324,"score_gpt":0.30080259471826953,"score_spread":0.2092205200383463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109721731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016365583,0.00011678272,0.99686396,0.00011406668,0.000019040215,0.000021004767,0.000036506746,0.00018129576,0.0010107912],"genre_scores_gemma":[0.15016839,0.00092543085,0.8422598,0.00015783787,0.0000906556,0.00033935587,0.0006448912,0.00032064551,0.005093014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975109,0.0010552723,0.00020145735,0.00040513618,0.0006857442,0.00014147205],"domain_scores_gemma":[0.99594045,0.0012567912,0.0002892612,0.0009574261,0.0013940303,0.00016210042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033838972,0.00084050157,0.0015385844,0.0022599278,0.0009767462,0.0037118364,0.0041508614,0.0026606217,0.0032426035],"category_scores_gemma":[0.014267542,0.000799509,0.0014567204,0.0027916261,0.0015411928,0.0069639212,0.0034506267,0.001881036,0.0013906864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049109676,0.00003419934,0.0009071413,0.00015657995,0.000038887913,0.00013684093,0.0004946831,0.34369168,0.0020947077,0.57971627,0.0024536909,0.070226215],"study_design_scores_gemma":[0.000009761694,0.000034367025,0.00010168019,0.00003594061,0.000015800852,0.000047437265,0.000089702,0.8289437,0.0007351226,0.15925989,0.010708484,0.00001802438],"about_ca_topic_score_codex":0.007493241,"about_ca_topic_score_gemma":0.006309642,"teacher_disagreement_score":0.007493241,"about_ca_system_score_codex":0.0015715611,"about_ca_system_score_gemma":0.0016559731,"threshold_uncertainty_score":0.017895937},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09222533319818163,"score_gpt":0.31385528637234716,"score_spread":0.22162995317416553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130891285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012654087,0.00006875904,0.9913926,0.00007988109,0.000039367154,0.00015905807,0.00006467283,0.004642065,0.0022882288],"genre_scores_gemma":[0.025629304,0.00033225832,0.9685154,0.00012107259,0.000021542364,0.0005731801,0.0003128881,0.0014945916,0.0029997693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822944,0.00077211915,0.0001741572,0.00019620838,0.00052737526,0.0001006522],"domain_scores_gemma":[0.9979663,0.0009628167,0.00021911276,0.00037414595,0.00033618748,0.00014140671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027012855,0.00077247893,0.00051137415,0.0009245868,0.00069702434,0.0018807827,0.0022038356,0.00085674884,0.004388628],"category_scores_gemma":[0.0052746395,0.0009754586,0.0012969613,0.0005767571,0.00078619504,0.002438552,0.0021295757,0.0019695088,0.0017527204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028669153,0.0003420496,0.002049205,0.0024151672,0.00038706217,0.0010999588,0.0023451636,0.049507946,0.03800288,0.37365937,0.030608995,0.49929544],"study_design_scores_gemma":[0.0003551323,0.0003329372,0.0006421818,0.00072355394,0.0003383502,0.0021121977,0.00035531304,0.3957331,0.037498523,0.15800352,0.40377086,0.00013432636],"about_ca_topic_score_codex":0.0007044493,"about_ca_topic_score_gemma":0.0012161273,"teacher_disagreement_score":0.004388628,"about_ca_system_score_codex":0.00044382387,"about_ca_system_score_gemma":0.0020764165,"threshold_uncertainty_score":0.0146814585},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020836358479426498,"score_gpt":0.2700609247711642,"score_spread":0.24922456629173773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131335988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031371468,0.00010519852,0.97459906,0.0003486884,0.00024112147,0.0003259018,0.0006963261,0.012848424,0.007698213],"genre_scores_gemma":[0.22214812,0.0003008787,0.74105513,0.0010389828,0.00015368304,0.0017530761,0.0027260552,0.0036986042,0.027125517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997255,0.0013726627,0.00035656354,0.00036969388,0.00045025157,0.00019595254],"domain_scores_gemma":[0.9973863,0.0012735593,0.00019016367,0.00042296175,0.00041408805,0.00031294825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026545764,0.0012021816,0.0009925409,0.0008328318,0.0012040214,0.0038255174,0.0027816088,0.0015733488,0.011024353],"category_scores_gemma":[0.0055061006,0.0009055285,0.0011791111,0.00054730894,0.00203769,0.0047041243,0.005163428,0.0030293295,0.0035324777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009491994,0.00024370881,0.0005638089,0.0008124541,0.00009247409,0.00048678747,0.0018936921,0.016561043,0.010339864,0.8562347,0.03414371,0.07767852],"study_design_scores_gemma":[0.00043946665,0.00024893312,0.00022187707,0.00021645804,0.00012345446,0.0004995554,0.00039305573,0.25901747,0.017222313,0.3485066,0.37289783,0.00021314088],"about_ca_topic_score_codex":0.001843133,"about_ca_topic_score_gemma":0.0024264893,"teacher_disagreement_score":0.011024353,"about_ca_system_score_codex":0.0009473338,"about_ca_system_score_gemma":0.0016825645,"threshold_uncertainty_score":0.036880136},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.052207662290725036,"score_gpt":0.3052295429635948,"score_spread":0.25302188067286974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134303121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014385266,0.00008990649,0.9951687,0.00036550427,0.000067756206,0.00011887752,0.000053309508,0.0004096484,0.0022878672],"genre_scores_gemma":[0.1049048,0.0002805078,0.88917285,0.00024921607,0.00013529124,0.00067938433,0.00024984597,0.00025616025,0.0040718787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98984563,0.0049941656,0.0011920093,0.0010177067,0.002435255,0.00051518326],"domain_scores_gemma":[0.98839885,0.0052871727,0.0007195168,0.0024128265,0.0026311525,0.00055040506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009383628,0.0012718502,0.0016031609,0.0020564036,0.0025031131,0.011719749,0.008333954,0.006405812,0.006970265],"category_scores_gemma":[0.023049513,0.0017045164,0.002821067,0.0022422313,0.006129305,0.013139858,0.004641782,0.0072256355,0.0024508599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041296036,0.000068105524,0.00016824511,0.00012341459,0.000034284498,0.00009692125,0.0005847326,0.030555129,0.0010049416,0.9551624,0.0010245749,0.011135934],"study_design_scores_gemma":[0.000073022136,0.000042350934,0.00006157936,0.00011057057,0.00005609656,0.00009896926,0.00013384347,0.3667331,0.0022798341,0.61612856,0.014232685,0.000049430975],"about_ca_topic_score_codex":0.004119453,"about_ca_topic_score_gemma":0.0035004602,"teacher_disagreement_score":0.011719749,"about_ca_system_score_codex":0.0037315341,"about_ca_system_score_gemma":0.0043575717,"threshold_uncertainty_score":0.049625993},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08074663229481495,"score_gpt":0.34863336652353255,"score_spread":0.2678867342287176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227054253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005649361,0.00088700623,0.9854682,0.00037164902,0.000091503534,0.00007850634,0.00010715717,0.0002567651,0.007089864],"genre_scores_gemma":[0.21100536,0.0011839034,0.78026986,0.0003376033,0.00021073269,0.00040621654,0.00034648785,0.00018038027,0.006059447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976653,0.000940081,0.00013515848,0.00025323618,0.00076444005,0.00024187802],"domain_scores_gemma":[0.99144226,0.007276281,0.00026125155,0.000460643,0.00040882034,0.00015078204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033660799,0.0014276454,0.0018146167,0.00209664,0.00091266196,0.0021004544,0.0031183595,0.0017946614,0.00803981],"category_scores_gemma":[0.015890352,0.000805629,0.0014511946,0.002343478,0.0024293049,0.004079965,0.001883219,0.0031489204,0.0006724948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017918125,0.00020432136,0.0005911634,0.00044405827,0.000112588285,0.00006261649,0.0001909339,0.42753392,0.00054339383,0.4097198,0.0048683924,0.15554966],"study_design_scores_gemma":[0.00005918254,0.000022535834,0.00008652076,0.00003809022,0.00002481714,0.000017341488,0.00003351907,0.67583376,0.00019716378,0.32222825,0.001447255,0.000011642348],"about_ca_topic_score_codex":0.0102362465,"about_ca_topic_score_gemma":0.014640516,"teacher_disagreement_score":0.0102362465,"about_ca_system_score_codex":0.0027190347,"about_ca_system_score_gemma":0.0027991736,"threshold_uncertainty_score":0.026895821},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07740140233226057,"score_gpt":0.2746905057048963,"score_spread":0.19728910337263572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513805426","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60193247,0.0004319158,0.37350595,0.0029388175,0.000103774524,0.000076326636,0.00029300302,0.00023217783,0.020485587],"genre_scores_gemma":[0.9867072,0.00007599505,0.010973323,0.00006946325,0.000031376912,0.000032616495,0.00009931598,0.000029324137,0.0019814298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978543,0.0012099504,0.000084467225,0.00027464985,0.00025937715,0.0003173043],"domain_scores_gemma":[0.97565395,0.020638533,0.0012712824,0.0009874356,0.0006777132,0.0007711821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035618169,0.00040513693,0.0017246691,0.0008728594,0.0013445888,0.003941013,0.002401467,0.0020659636,0.0077914884],"category_scores_gemma":[0.036056735,0.00080386264,0.0009660112,0.0009384634,0.0030881988,0.005553553,0.0018163595,0.0025073194,0.00040964887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023672658,0.000112821996,0.0040158005,0.00011789369,0.00007602111,0.00016585385,0.00045931147,0.33673304,0.000729295,0.6468266,0.0016230856,0.0089034885],"study_design_scores_gemma":[0.000025597576,0.0000150631295,0.00046832787,0.00000976845,0.000011722297,0.000024774414,0.00009189558,0.6644429,0.0001491924,0.3345417,0.00020860389,0.000010505625],"about_ca_topic_score_codex":0.007555264,"about_ca_topic_score_gemma":0.008219821,"teacher_disagreement_score":0.0077914884,"about_ca_system_score_codex":0.001806312,"about_ca_system_score_gemma":0.0018650406,"threshold_uncertainty_score":0.026065111},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07563508047408636,"score_gpt":0.3298468779985365,"score_spread":0.25421179752445017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553081833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013596287,0.00069902575,0.9935355,0.00020852232,0.00014796038,0.000021255426,0.000030480634,0.00011165687,0.0038860068],"genre_scores_gemma":[0.16055913,0.0036296626,0.8268811,0.00036302127,0.000708858,0.00030480887,0.00023347963,0.000292488,0.0070274225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942756,0.00025749268,0.000031390544,0.00006307453,0.00018822066,0.00003229132],"domain_scores_gemma":[0.99957114,0.00017857981,0.000038303242,0.00010503934,0.00007226529,0.000034799777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002981,0.0012207475,0.001506794,0.001198754,0.0006383315,0.0018270565,0.0014164263,0.0011437219,0.0021790783],"category_scores_gemma":[0.0025052119,0.000397494,0.0011598063,0.0020897742,0.0012084305,0.00211455,0.002067982,0.002737986,0.00075618527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045783498,0.000068648005,0.000540472,0.00024024266,0.00010915695,0.00008021931,0.00014925437,0.19497623,0.0021930113,0.6763718,0.0066339765,0.118591234],"study_design_scores_gemma":[0.000020587357,0.00003493035,0.00014592978,0.000029738927,0.000029736431,0.000055081335,0.000022816308,0.7866739,0.00053796935,0.19790061,0.014532054,0.000016557495],"about_ca_topic_score_codex":0.0015414819,"about_ca_topic_score_gemma":0.0014383319,"teacher_disagreement_score":0.0021790783,"about_ca_system_score_codex":0.0006092945,"about_ca_system_score_gemma":0.0007401271,"threshold_uncertainty_score":0.0072897673},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07665672668725818,"score_gpt":0.26176025875086656,"score_spread":0.18510353206360838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592731255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.923975,0.00021807262,0.07118414,0.00051315123,0.000020391324,0.00015488135,0.00014701454,0.00009926217,0.003688171],"genre_scores_gemma":[0.9929509,0.00011496458,0.0056000906,0.000035362027,0.000016203941,0.0000734503,0.0000750414,0.000013904608,0.0011201398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637777,0.0017976707,0.0002176629,0.0005728136,0.0003229498,0.0007110743],"domain_scores_gemma":[0.88659656,0.07975184,0.018310308,0.007601809,0.0037110676,0.0040283334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013255682,0.0004383031,0.0017439622,0.001817367,0.0012098108,0.0034165208,0.0030125182,0.0030136253,0.008087756],"category_scores_gemma":[0.07704912,0.00070822594,0.0011284052,0.001606895,0.002266714,0.0065742387,0.0016807809,0.001828244,0.00045657592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015353898,0.0008941473,0.024906209,0.00036796642,0.00040482153,0.0004118561,0.0014832075,0.10122825,0.009035324,0.82532823,0.0017999405,0.032604624],"study_design_scores_gemma":[0.00038928873,0.0004649859,0.007863561,0.00006210014,0.00017149046,0.00030492473,0.00089098455,0.57777977,0.002174285,0.40917066,0.0006383121,0.00008964509],"about_ca_topic_score_codex":0.0007936921,"about_ca_topic_score_gemma":0.000693981,"teacher_disagreement_score":0.013255682,"about_ca_system_score_codex":0.0014819426,"about_ca_system_score_gemma":0.0017878762,"threshold_uncertainty_score":0.070103586},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.020011942607476265,"score_gpt":0.28256204998217105,"score_spread":0.2625501073746948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919919830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85733396,0.00021317527,0.13908273,0.0005408944,0.000033045846,0.000041378167,0.00039525158,0.00008923775,0.0022703828],"genre_scores_gemma":[0.9951958,0.00004892611,0.004237052,0.000019095274,0.000022883778,0.000015786005,0.00017300843,0.000005114385,0.00028222753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980102,0.001067082,0.00009282183,0.00041569717,0.00024733256,0.0001668543],"domain_scores_gemma":[0.9758682,0.02060903,0.0013447196,0.0010494177,0.00079576095,0.00033289887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003103582,0.0004094724,0.00080946385,0.0012838251,0.0006998452,0.0015981308,0.001218282,0.001389839,0.0011249427],"category_scores_gemma":[0.0310356,0.0004873184,0.00043745406,0.00089244044,0.00087086356,0.0032583787,0.00087845215,0.001155978,0.00040979515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012429665,0.0007465944,0.290762,0.0003348837,0.0006576967,0.0009836806,0.001493586,0.50756294,0.0045903577,0.06349405,0.0036429365,0.12448827],"study_design_scores_gemma":[0.000020064572,0.00003730453,0.010429788,0.000012940103,0.000031861,0.000060091756,0.00016196563,0.9549278,0.00073625374,0.033335786,0.00023410647,0.000012065931],"about_ca_topic_score_codex":0.002673212,"about_ca_topic_score_gemma":0.004657475,"teacher_disagreement_score":0.003103582,"about_ca_system_score_codex":0.00062983367,"about_ca_system_score_gemma":0.00034540283,"threshold_uncertainty_score":0.01641351},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04836751343613718,"score_gpt":0.297593845586143,"score_spread":0.2492263321500058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214891036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057146393,0.00012558873,0.93622667,0.0008575499,0.00011042369,0.00022480077,0.00017708706,0.0007287811,0.0044026324],"genre_scores_gemma":[0.9041887,0.000100111276,0.09350461,0.00012300599,0.0000635686,0.00017248554,0.00016008633,0.000106692976,0.0015806532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98487526,0.0059966776,0.0011674769,0.001493621,0.0049704416,0.0014965917],"domain_scores_gemma":[0.9253759,0.053590566,0.004117184,0.008321701,0.007567477,0.0010271347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01242894,0.0007394658,0.001179265,0.001191352,0.0015118928,0.004573942,0.003337126,0.0021412952,0.0032177442],"category_scores_gemma":[0.061048172,0.00092716893,0.002618924,0.0008179648,0.0058253226,0.0070266253,0.004574212,0.0039089187,0.00034844925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033793153,0.0002213118,0.0028004705,0.0003781841,0.00020473385,0.0008133885,0.0019919707,0.22252569,0.0045736637,0.74120855,0.0013424483,0.02360157],"study_design_scores_gemma":[0.00013698013,0.00006291625,0.00038876125,0.00007518021,0.00008435795,0.0000843762,0.00020483199,0.6535435,0.005190641,0.33821067,0.0019786078,0.000039126666],"about_ca_topic_score_codex":0.010828628,"about_ca_topic_score_gemma":0.006873777,"teacher_disagreement_score":0.01242894,"about_ca_system_score_codex":0.0035274003,"about_ca_system_score_gemma":0.0048797964,"threshold_uncertainty_score":0.06573129},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Semantics (computer science); Artificial intelligence; Action (physics); Action selection; Artificial neural network; Multi-agent system; Programming language; Perception","score_opus":0.08029373040729547,"score_gpt":0.3143184978309977,"score_spread":0.2340247674237022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388551180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003725223,0.00012398913,0.98666763,0.000193353,0.00014200898,0.00008172087,0.0007976446,0.005330429,0.0029378557],"genre_scores_gemma":[0.36841822,0.00041364305,0.61817014,0.00034918095,0.00008897608,0.0006619643,0.0026344056,0.00089380477,0.008369761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963856,0.00012609792,0.00002832627,0.00007360692,0.00009893697,0.000034459776],"domain_scores_gemma":[0.99928147,0.0003043014,0.000054362215,0.00012709494,0.00016594527,0.00006689933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009295625,0.00060987694,0.00064889865,0.0006783214,0.00042676504,0.0009724643,0.0012268673,0.0008524017,0.0069792713],"category_scores_gemma":[0.0030703505,0.00030919057,0.0005946842,0.00052339886,0.00059078645,0.0014271255,0.0010334615,0.0014778248,0.0013917078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064214406,0.00021848206,0.0010427422,0.00033065054,0.000088133835,0.0001942069,0.00012415854,0.5040024,0.004956281,0.19107346,0.02917764,0.2681497],"study_design_scores_gemma":[0.00003111059,0.000028762386,0.000095887975,0.000015900527,0.000013736816,0.00003266247,0.000010255721,0.89956784,0.0016537757,0.08935808,0.00918216,0.000009831511],"about_ca_topic_score_codex":0.0058868504,"about_ca_topic_score_gemma":0.00775491,"teacher_disagreement_score":0.0069792713,"about_ca_system_score_codex":0.0010554262,"about_ca_system_score_gemma":0.0015514717,"threshold_uncertainty_score":0.023347914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04139100013431038,"score_gpt":0.2750660092176482,"score_spread":0.2336750090833378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389395619","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027625462,0.0006804053,0.95548433,0.00050969626,0.00012214326,0.00006332522,0.00011390369,0.00041219307,0.014988574],"genre_scores_gemma":[0.9422298,0.00031267013,0.046350304,0.00021169982,0.00006872074,0.00015169264,0.00017928921,0.00009292757,0.010402894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935514,0.00022258733,0.000029895253,0.00017270369,0.00013540163,0.000084188236],"domain_scores_gemma":[0.9980286,0.0012385149,0.00014817098,0.0001806703,0.00025844286,0.00014573056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096506457,0.0008828427,0.0011022814,0.00037454168,0.00039079922,0.0010353462,0.0010017859,0.0011899734,0.006524146],"category_scores_gemma":[0.0058326735,0.00040598327,0.0003059603,0.0004668394,0.0013304302,0.0014364108,0.0018903662,0.0012665386,0.00061807776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023686828,0.00008823974,0.00043204834,0.00013291732,0.000044533703,0.000085458036,0.000042510004,0.84270465,0.0015195337,0.09946688,0.00337268,0.05187372],"study_design_scores_gemma":[0.000020271702,0.00003177453,0.00007608325,0.00000794145,0.000004967699,0.000013111182,0.0000042866536,0.978216,0.00033219502,0.020699125,0.00058966264,0.0000046621617],"about_ca_topic_score_codex":0.0031834473,"about_ca_topic_score_gemma":0.0022853785,"teacher_disagreement_score":0.006524146,"about_ca_system_score_codex":0.0009976408,"about_ca_system_score_gemma":0.0009828283,"threshold_uncertainty_score":0.021825433},"labels":[],"label_agreement":null},{"id":"W4412368978","doi":"10.1007/s10458-025-09714-8","title":"Diversity-seeking jump games in networks","year":2025,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Price of anarchy; Jump; Mathematical economics; Node (physics); Fraction (chemistry); Diversity (politics); Class (philosophy); Computer science; Function (biology); Stability (learning theory); Mathematical optimization; Mathematics; Economics; Price of stability; Artificial intelligence","score_opus":0.09937112948378411,"score_gpt":0.3655412427002712,"score_spread":0.2661701132164871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412368978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.490094,0.00043654942,0.48232785,0.0019775392,0.00007004342,0.00012543258,0.00016843902,0.00009814903,0.024701895],"genre_scores_gemma":[0.9894475,0.000118375036,0.0077434126,0.00011543951,0.000023837038,0.00006671671,0.000029354638,0.0000072509965,0.002448232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989278,0.0006096061,0.000032355423,0.00013306712,0.0001519748,0.00014515179],"domain_scores_gemma":[0.9962547,0.0028513065,0.00029553453,0.00009957777,0.0001735599,0.00032539474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013977734,0.00047567495,0.0008733198,0.00068384054,0.0006776565,0.0013728543,0.0009610384,0.0012891073,0.0024064449],"category_scores_gemma":[0.0054704053,0.00024041448,0.00049422384,0.00055167434,0.0020469606,0.0018127407,0.0011515811,0.0011326823,0.0001343074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000154151,0.00006906036,0.0011123021,0.00008455934,0.00006844645,0.00025956717,0.0002922861,0.44090202,0.0029695495,0.54683584,0.0012682469,0.0059840335],"study_design_scores_gemma":[0.000038559057,0.00004987206,0.00022804707,0.000010757166,0.000008609919,0.000034781526,0.00008688747,0.74583787,0.00031195406,0.25268027,0.00070069614,0.00001162026],"about_ca_topic_score_codex":0.0023795608,"about_ca_topic_score_gemma":0.0017151054,"teacher_disagreement_score":0.0024064449,"about_ca_system_score_codex":0.0013983126,"about_ca_system_score_gemma":0.00044361493,"threshold_uncertainty_score":0.010145485},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06207849552602331,"score_gpt":0.2945134472691957,"score_spread":0.23243495174317239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413370993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023162242,0.0001556589,0.9739067,0.00026527,0.00005395036,0.00010169978,0.000029103148,0.00036945954,0.001955889],"genre_scores_gemma":[0.91411823,0.00019778628,0.083021365,0.00017573686,0.000042006202,0.00027065264,0.00007613219,0.0001227034,0.0019754858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873286,0.00035712955,0.00008905916,0.00028825435,0.00028029227,0.00025239697],"domain_scores_gemma":[0.9940555,0.0035822545,0.0009181711,0.0004207869,0.00069084804,0.00033240224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024700994,0.0013525673,0.0012696129,0.00073971815,0.000714843,0.0013990313,0.0015912502,0.0017119999,0.0016628229],"category_scores_gemma":[0.011756294,0.0009662874,0.00067121064,0.0004636885,0.0015829215,0.00173056,0.0025937841,0.002481741,0.0005220297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012263547,0.00006611555,0.0004623902,0.000094695424,0.000050673465,0.00010291665,0.00014268667,0.957977,0.0038186687,0.01818707,0.00069632014,0.01827882],"study_design_scores_gemma":[0.000020104244,0.00003375463,0.00006172196,0.000009153151,0.000007239302,0.000012725124,0.000018239707,0.9912509,0.00067154836,0.00769392,0.00021535257,0.0000053742956],"about_ca_topic_score_codex":0.0023357926,"about_ca_topic_score_gemma":0.0016487231,"teacher_disagreement_score":0.0024700994,"about_ca_system_score_codex":0.0010862434,"about_ca_system_score_gemma":0.0020041333,"threshold_uncertainty_score":0.013063312},"labels":[],"label_agreement":null}]}