{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15181339,0.002287665,0.8398295,0.00037560466,0.0019022101,0.002776072,0.000043121818,0.00026438065,0.0007080393],"genre_scores_gemma":[0.9960783,0.00014243792,0.0022021004,0.00014841172,0.00004448721,0.00031323163,0.000015204253,0.000017550929,0.0010382857],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977877,0.0002331187,0.00087547564,0.00046126166,0.00022558676,0.00041687075],"domain_scores_gemma":[0.99867606,0.0001482189,0.000556995,0.00030195748,0.00018585972,0.0001309291],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006799713,0.0002818851,0.00039971678,0.0002372101,0.00024997548,0.00054394413,0.0003555356,0.00012480219,0.000010168625],"category_scores_gemma":[0.00017004095,0.00026378353,0.00006638907,0.00029562617,0.000032422304,0.0015662456,0.00013324975,0.00017660053,0.00006362407],"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.00023164766,0.0015706448,0.0969827,0.003829774,0.0006413522,0.00009024522,0.4982719,0.04560299,0.0064110085,0.050066154,0.021239452,0.2750621],"study_design_scores_gemma":[0.0016043745,0.00011026054,0.0011495526,0.00039252336,0.0000061390992,0.000009297574,0.002333436,0.8896671,0.00009329033,0.0000034940679,0.10434143,0.00028912883],"about_ca_topic_score_codex":0.00028919868,"about_ca_topic_score_gemma":0.00018250864,"teacher_disagreement_score":0.8442649,"about_ca_system_score_codex":0.00028189746,"about_ca_system_score_gemma":0.000037632944,"threshold_uncertainty_score":0.99998146},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9320387,0.0032958519,0.060403336,0.00028959796,0.0019074987,0.0011441297,0.000021855076,0.0004938459,0.0004051383],"genre_scores_gemma":[0.99410206,0.00020073426,0.003752224,0.0007052553,0.00005804634,0.00009253001,0.000014008591,0.000046573754,0.0010285801],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969932,0.00019297228,0.00061366777,0.000992622,0.00040848603,0.00079904514],"domain_scores_gemma":[0.99843293,0.000070116264,0.00030125535,0.0008465249,0.000059641472,0.00028954016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027835582,0.0004612051,0.00048582302,0.00033137025,0.00029122207,0.00046936198,0.0009964514,0.00018376818,0.000039612856],"category_scores_gemma":[0.000008745146,0.00042365916,0.00012194294,0.00044436537,0.00004997123,0.000504203,0.000514574,0.0002613858,0.00012433385],"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.000053465606,0.0036959485,0.5422171,0.0029652282,0.001332251,0.005723967,0.14363536,0.1339629,0.0009095653,0.0019305196,0.0026133386,0.16096038],"study_design_scores_gemma":[0.0015911638,0.000086125074,0.06377299,0.00036865668,0.000028883778,0.00015047197,0.00054966495,0.9179452,0.000048793845,0.00002240192,0.014693166,0.0007424557],"about_ca_topic_score_codex":0.0022312931,"about_ca_topic_score_gemma":0.0012339705,"teacher_disagreement_score":0.78398234,"about_ca_system_score_codex":0.00018059435,"about_ca_system_score_gemma":0.000019907233,"threshold_uncertainty_score":0.99982154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025286287,0.0020163518,0.96735644,0.00072959147,0.0009826623,0.0024460775,0.000050040515,0.00028996225,0.0008426003],"genre_scores_gemma":[0.9641896,0.00030240839,0.03172298,0.00037070407,0.00015773546,0.0004972299,0.00005936665,0.000031854317,0.0026681337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975327,0.00021570895,0.00083103415,0.0006161661,0.00032237006,0.00048197724],"domain_scores_gemma":[0.998026,0.00011267739,0.00049483444,0.0009341598,0.00019493794,0.00023736675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000829804,0.00033834815,0.0004215274,0.00017257687,0.0005461266,0.00042845134,0.0007644455,0.00014835416,0.000009075885],"category_scores_gemma":[0.000021103962,0.00030331602,0.0001410705,0.00014979539,0.000041796033,0.0013121498,0.00026630645,0.00012461389,0.000097890406],"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.00009856817,0.003365566,0.0038454405,0.0018558331,0.0013348607,0.000023727203,0.09672873,0.26347294,0.0032224294,0.31273273,0.060056604,0.25326258],"study_design_scores_gemma":[0.0014495703,0.00005605096,0.0017279922,0.0000902305,0.000022992093,0.00001620461,0.00026872815,0.9171127,0.00015259383,0.00006814337,0.078685366,0.00034940912],"about_ca_topic_score_codex":0.0004909126,"about_ca_topic_score_gemma":0.00007267455,"teacher_disagreement_score":0.9389033,"about_ca_system_score_codex":0.00026284723,"about_ca_system_score_gemma":0.000059446626,"threshold_uncertainty_score":0.9999419},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65401226,0.0006771191,0.34167576,0.0002270274,0.0016625227,0.0009362779,0.000038799568,0.00019990069,0.0005703252],"genre_scores_gemma":[0.948997,0.0003196582,0.04946663,0.00006923407,0.00008908485,0.000025575515,0.00010502409,0.000020432897,0.0009073338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871296,0.00008236905,0.00036421424,0.00041837763,0.00023333394,0.00018872517],"domain_scores_gemma":[0.999026,0.000020069056,0.00025017234,0.00037643104,0.00018061587,0.00014670916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036585392,0.00015428498,0.00020708147,0.00011839132,0.00011136588,0.00027331387,0.00032612652,0.000053620686,0.000005362598],"category_scores_gemma":[0.00007373021,0.00014114348,0.000019070721,0.00022975462,0.000053066775,0.0009038743,0.0004884029,0.000051367762,0.000020657537],"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.000038385904,0.0011906858,0.13622116,0.0020860587,0.00061477063,0.00014179361,0.022348627,0.0005759569,0.002963796,0.019856537,0.008766417,0.8051958],"study_design_scores_gemma":[0.0053863134,0.00044684394,0.07772891,0.00060186745,0.0001738309,0.0002658931,0.0027429732,0.85603774,0.001596828,0.0008580842,0.052910842,0.0012498926],"about_ca_topic_score_codex":0.00041148326,"about_ca_topic_score_gemma":0.000005198751,"teacher_disagreement_score":0.8554618,"about_ca_system_score_codex":0.000050447474,"about_ca_system_score_gemma":0.000035032306,"threshold_uncertainty_score":0.5755664},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26505062,0.0018120625,0.72977567,0.00024846074,0.0008272867,0.0019004714,0.000028012098,0.00017817061,0.00017925582],"genre_scores_gemma":[0.9371183,0.00014610433,0.060079418,0.00034765608,0.00012460318,0.0005146919,0.000035008175,0.000054600478,0.0015796283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969409,0.00017027404,0.00090392976,0.0007632375,0.00039096674,0.00083069963],"domain_scores_gemma":[0.9977251,0.00008438541,0.00049952953,0.0010133616,0.00014438754,0.00053318223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001519712,0.0004496397,0.00054859417,0.00024507343,0.00081959215,0.0004968818,0.0006538253,0.00017706759,0.0000018940686],"category_scores_gemma":[0.000048353962,0.0004296646,0.00011781276,0.0001720701,0.00003823814,0.0010176592,0.00060267455,0.00016714963,0.000018581013],"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.000104583196,0.0026697842,0.03601916,0.003236355,0.0010147301,0.000009748617,0.1396724,0.6427128,0.04227419,0.04330078,0.007730648,0.08125483],"study_design_scores_gemma":[0.001212043,0.000043824188,0.004907985,0.00032813943,0.00004105459,0.000016000355,0.00029184247,0.98813385,0.0004509876,0.000023058716,0.004056801,0.00049438945],"about_ca_topic_score_codex":0.0006547272,"about_ca_topic_score_gemma":0.000025515672,"teacher_disagreement_score":0.6720677,"about_ca_system_score_codex":0.00033768016,"about_ca_system_score_gemma":0.00006162388,"threshold_uncertainty_score":0.9998155},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7482691,0.000036392605,0.24798262,0.00042398213,0.0014121379,0.0006945967,0.00007525989,0.00013813845,0.0009677746],"genre_scores_gemma":[0.9916003,0.000013123392,0.0008201906,0.00018761102,0.00014205283,0.00010044412,0.00008617619,0.000014548075,0.007035599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976971,0.00021539102,0.00082725246,0.0004986185,0.00049950014,0.0002620959],"domain_scores_gemma":[0.9983653,0.00014774945,0.00045423637,0.0005644647,0.00027275478,0.00019553208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018693801,0.00018525783,0.0002489338,0.00016073883,0.00055977673,0.00047605197,0.00031653425,0.00014969846,0.0003815009],"category_scores_gemma":[0.00015349132,0.00014328341,0.0000936721,0.00025331933,0.00012316323,0.00052510266,0.000086784086,0.00018963049,0.00047128132],"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.00026493552,0.0018167384,0.006564217,0.00017595553,0.00045708887,0.000053203756,0.0123923635,0.3120495,0.16125728,0.378393,0.045771793,0.08080392],"study_design_scores_gemma":[0.0018989344,0.00008849852,0.016462825,0.000035978144,0.000071318966,0.00021826524,0.0059864484,0.6504373,0.001450173,0.0022192972,0.32049206,0.000638917],"about_ca_topic_score_codex":0.0002630151,"about_ca_topic_score_gemma":0.0000835573,"teacher_disagreement_score":0.37617368,"about_ca_system_score_codex":0.00006154322,"about_ca_system_score_gemma":0.000056934136,"threshold_uncertainty_score":0.6057525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016696361,0.000085355474,0.9926186,0.000088110704,0.003618152,0.0014101322,0.000009302943,0.00024282864,0.00025785883],"genre_scores_gemma":[0.7118708,0.00006046599,0.28741574,0.00010426601,0.00010701683,0.0002007259,0.000029755316,0.000019023852,0.00019223381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986569,0.00007451565,0.00042522885,0.00043101844,0.00015793258,0.0002543704],"domain_scores_gemma":[0.9990821,0.000054232427,0.00028098366,0.00029679292,0.00015248524,0.00013339637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027888492,0.00018560291,0.00021038677,0.00012110533,0.0002622811,0.00023851791,0.00022444066,0.00016489685,0.000030015199],"category_scores_gemma":[0.000057553512,0.00017882016,0.00006387105,0.0001620799,0.000029822677,0.0004617252,0.000069036476,0.0000888932,0.0000127861085],"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.00006166081,0.0010186903,0.015880812,0.0004799373,0.00032457433,0.0000105955205,0.0236057,0.2339273,0.00012679432,0.6695105,0.0007140328,0.054339398],"study_design_scores_gemma":[0.0012040124,0.000102715654,0.0062020337,0.00005651707,0.000020691286,0.000008559285,0.00009928778,0.9896084,0.000021220469,0.000561714,0.0018774704,0.0002373763],"about_ca_topic_score_codex":0.00013722271,"about_ca_topic_score_gemma":0.000004784154,"teacher_disagreement_score":0.7556811,"about_ca_system_score_codex":0.000080923,"about_ca_system_score_gemma":0.000059403963,"threshold_uncertainty_score":0.72920746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5325283,0.002355704,0.456194,0.0003911448,0.004605366,0.0023237227,0.00008758978,0.00079752784,0.000716668],"genre_scores_gemma":[0.98032403,0.000045494646,0.0129339015,0.00032700397,0.0004628542,0.00009914888,0.00010378375,0.00006705594,0.0056367265],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601895,0.00028304636,0.0010424847,0.0011842604,0.0007282108,0.0007430491],"domain_scores_gemma":[0.99798864,0.000083694016,0.00054622086,0.00084310735,0.00021048072,0.00032787916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004449597,0.00060768874,0.00057572895,0.00034369147,0.0006579201,0.0007423622,0.00085143803,0.0002479528,0.00009007498],"category_scores_gemma":[0.00005349615,0.0005182776,0.00016184349,0.00038413372,0.00008694938,0.00032747514,0.00036609112,0.00023291087,0.00024879564],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013370007,0.0065209167,0.37005064,0.002826554,0.0022583765,0.0012854956,0.025342235,0.1639468,0.07821407,0.2577591,0.046952322,0.044709805],"study_design_scores_gemma":[0.003913526,0.00014838787,0.36865032,0.00013921605,0.000070389484,0.00036146797,0.00023852779,0.569272,0.0014364693,0.00027555,0.054091323,0.0014028649],"about_ca_topic_score_codex":0.003976764,"about_ca_topic_score_gemma":0.00017427572,"teacher_disagreement_score":0.44779578,"about_ca_system_score_codex":0.00022262905,"about_ca_system_score_gemma":0.00014934975,"threshold_uncertainty_score":0.9997269},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549577,0.00025627328,0.04155231,0.00017449114,0.00021080815,0.0016260105,0.000013021747,0.000058874226,0.0011504971],"genre_scores_gemma":[0.99133605,0.00004483952,0.00041623393,0.000057375793,0.00005863719,0.0005482166,0.000007533309,0.000014311759,0.007516809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975412,0.00018685212,0.0011260156,0.0005670366,0.00023262866,0.00034625348],"domain_scores_gemma":[0.9983407,0.00032440745,0.0008718494,0.00014458685,0.00021661552,0.00010183694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020668316,0.00017648298,0.00032931395,0.00018214191,0.00035706244,0.000414288,0.00012193869,0.000091012,0.00014512784],"category_scores_gemma":[0.0002967863,0.00013748444,0.000053768963,0.00027717862,0.00007823463,0.00046596458,0.000048041726,0.00011961072,0.000041226886],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035127648,0.0014555367,0.3463298,0.00040146528,0.00058049633,0.000015337782,0.023660352,0.010071047,0.02071531,0.5071709,0.01541509,0.073833324],"study_design_scores_gemma":[0.002696193,0.00025234092,0.3128085,0.0000979521,0.00005237916,0.00011929641,0.061807655,0.419966,0.00031776732,0.007678901,0.19348893,0.0007140513],"about_ca_topic_score_codex":0.00045419068,"about_ca_topic_score_gemma":0.00014544251,"teacher_disagreement_score":0.49949205,"about_ca_system_score_codex":0.00008240964,"about_ca_system_score_gemma":0.00008377685,"threshold_uncertainty_score":0.5606453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05566288,0.000502663,0.94075906,0.00004546454,0.0018558758,0.0005434519,0.000012730497,0.0001311061,0.00048676413],"genre_scores_gemma":[0.9934121,0.000017270515,0.0053309817,0.00013101747,0.0000355932,0.000018086454,0.00001985863,0.00001945481,0.0010156432],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806863,0.00023435,0.0005365442,0.0003106401,0.0003368746,0.00051296566],"domain_scores_gemma":[0.9985338,0.00013642237,0.00036756974,0.0006006775,0.00011660068,0.0002449627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161357,0.00022240492,0.0003408771,0.000140295,0.00012836228,0.0001267125,0.0005132077,0.00009352862,0.000014104096],"category_scores_gemma":[0.00007851667,0.00019794652,0.000072166775,0.00020902036,0.000059284397,0.0004050514,0.00020021645,0.00011148414,0.00006527548],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132826835,0.000477245,0.7583708,0.00038785758,0.00024423888,0.000013375568,0.0037265634,0.22626781,0.00063388946,0.0026971267,0.0038552473,0.0033125666],"study_design_scores_gemma":[0.00076743105,0.00007488515,0.2529084,0.00005041674,0.0000140188995,0.0000051588654,0.00006118571,0.741416,0.00018933094,2.886011e-7,0.0042845504,0.00022836482],"about_ca_topic_score_codex":0.0018676431,"about_ca_topic_score_gemma":0.000012816754,"teacher_disagreement_score":0.9377492,"about_ca_system_score_codex":0.00008877759,"about_ca_system_score_gemma":0.000085583146,"threshold_uncertainty_score":0.80720246},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23662318,0.0016939698,0.7523275,0.00100908,0.0038185343,0.002435733,0.00013832735,0.0005680815,0.0013855669],"genre_scores_gemma":[0.988677,0.00004290314,0.0019990094,0.00020633431,0.00015030328,0.00007744977,0.00015778754,0.000027045746,0.00866217],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974832,0.00017074423,0.0007138056,0.0006524805,0.00047870827,0.0005010562],"domain_scores_gemma":[0.9987033,0.000064444015,0.00039018734,0.0005172224,0.00013970523,0.00018514211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044271236,0.00033608344,0.00037483784,0.00014450256,0.0003876158,0.00045615275,0.0004638389,0.00014569465,0.0000223067],"category_scores_gemma":[0.000013001273,0.0003087151,0.00009216619,0.00018020307,0.00005077853,0.0005012923,0.00018662123,0.00011076371,0.00011100427],"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.000049453447,0.00425017,0.31820053,0.0015098337,0.0010324653,0.0003291098,0.0067512407,0.006237113,0.013726954,0.19708633,0.44149035,0.009336442],"study_design_scores_gemma":[0.0036835393,0.00009333605,0.050385993,0.000081495666,0.00004218106,0.000046475325,0.00034487445,0.762612,0.0004176074,0.00005540719,0.18149622,0.0007408919],"about_ca_topic_score_codex":0.0022310808,"about_ca_topic_score_gemma":0.0000332773,"teacher_disagreement_score":0.7563749,"about_ca_system_score_codex":0.00021654945,"about_ca_system_score_gemma":0.00006532737,"threshold_uncertainty_score":0.9999365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14055377,0.0014392714,0.8487293,0.00025807394,0.0026931644,0.00097509014,0.000024501504,0.00055506645,0.00477177],"genre_scores_gemma":[0.98446256,0.000052003605,0.011192021,0.00065126875,0.000119850105,0.000060380276,0.000032590622,0.000020990037,0.0034083182],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977644,0.00015549941,0.00048322038,0.0007085952,0.00038443197,0.0005038337],"domain_scores_gemma":[0.99876344,0.000086786466,0.00023222539,0.00046609994,0.00014472402,0.00030670705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030478844,0.00032276247,0.0003790743,0.00014804988,0.0005804267,0.00021121683,0.0006309227,0.0001283709,0.00003740257],"category_scores_gemma":[0.00003171905,0.00027016844,0.00012823495,0.00021043031,0.000109970744,0.0002778896,0.00021642396,0.00013648553,0.00033527752],"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.00008885047,0.0075115166,0.31447962,0.001179152,0.0012297084,0.004253802,0.029553255,0.26506442,0.00048533845,0.20256846,0.1344059,0.03917999],"study_design_scores_gemma":[0.0016813988,0.00010788457,0.0751284,0.000040961964,0.000013977719,0.00014860804,0.000045827255,0.8797224,0.000028043261,0.00008752349,0.04257088,0.00042409883],"about_ca_topic_score_codex":0.00021880402,"about_ca_topic_score_gemma":0.0000070600954,"teacher_disagreement_score":0.8439088,"about_ca_system_score_codex":0.00012824844,"about_ca_system_score_gemma":0.00017087955,"threshold_uncertainty_score":0.999975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23491761,0.0049952664,0.74621266,0.000020073254,0.007058931,0.0047509554,0.00011153542,0.0014770709,0.00045591127],"genre_scores_gemma":[0.97239125,0.0028550625,0.02225909,0.000037857735,0.00026815105,0.0007436094,0.000067930254,0.00023657308,0.0011404754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995528,0.00018519214,0.0014664943,0.0010709155,0.00051864976,0.0012307378],"domain_scores_gemma":[0.9980467,0.000084798376,0.00042725744,0.00082410255,0.00014438103,0.00047276268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014216654,0.000856875,0.0008669018,0.000293433,0.000824307,0.00040710293,0.0005033065,0.0002485262,0.000021275744],"category_scores_gemma":[0.000027360602,0.00080389844,0.00024661998,0.00020698906,0.00003042959,0.0002456076,0.00023422939,0.00031620136,0.00012225108],"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.00002736628,0.0010553711,0.008207169,0.008508677,0.0037190695,0.00007690881,0.010859246,0.9168959,0.0018561336,0.0022402264,0.0014238,0.045130126],"study_design_scores_gemma":[0.0013478905,0.00011189043,0.0018564283,0.00030853518,0.00034511488,0.00002739753,0.0016596512,0.9180037,0.00014802553,0.0000031031186,0.075282685,0.0009055856],"about_ca_topic_score_codex":0.00041518454,"about_ca_topic_score_gemma":0.00004337239,"teacher_disagreement_score":0.7374736,"about_ca_system_score_codex":0.00082514575,"about_ca_system_score_gemma":0.000025584262,"threshold_uncertainty_score":0.9994412},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040396653,0.0026345872,0.94799006,0.00007221116,0.0025690177,0.004919465,0.0000726738,0.0004974763,0.0008478429],"genre_scores_gemma":[0.9767069,0.00080901943,0.009276704,0.00028424157,0.00020053373,0.0033118539,0.00007217268,0.00007561928,0.009262926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953056,0.00030106213,0.0011206156,0.0014881971,0.0006370559,0.0011474605],"domain_scores_gemma":[0.99720526,0.00011869969,0.0005209789,0.0014413889,0.00023068702,0.00048298726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017268227,0.0006220591,0.00075741904,0.00027197323,0.00054541504,0.00096689904,0.0013438947,0.00019801476,0.000012084656],"category_scores_gemma":[0.000028817365,0.00056788954,0.00019044212,0.00037727712,0.000060545215,0.0005585767,0.00068215054,0.00019954817,0.00008191387],"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.000055585475,0.0007882027,0.0026449102,0.0011268408,0.00051281415,0.0002217226,0.0027312106,0.88798934,0.00022484118,0.021108862,0.014234546,0.06836115],"study_design_scores_gemma":[0.0013370133,0.0001608737,0.0009094941,0.00014985644,0.000048644535,0.000035662415,0.00020214985,0.8988651,0.000010137299,0.000020830441,0.09766509,0.00059515424],"about_ca_topic_score_codex":0.0016112954,"about_ca_topic_score_gemma":0.00007816347,"teacher_disagreement_score":0.9387134,"about_ca_system_score_codex":0.0005764695,"about_ca_system_score_gemma":0.000192808,"threshold_uncertainty_score":0.99967724},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23241203,0.0006304829,0.7621904,0.00010837211,0.003004441,0.00110224,0.000012611695,0.0004823027,0.000057121535],"genre_scores_gemma":[0.76821285,0.00007440759,0.22946073,0.0003499665,0.00019517454,0.00022478141,0.00008160359,0.00005863829,0.0013418458],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956428,0.00053890725,0.0011416712,0.001288171,0.00054906507,0.0008394258],"domain_scores_gemma":[0.9976508,0.000081405546,0.0005352253,0.0009875769,0.00018756025,0.0005574504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012488384,0.0005539199,0.0006943492,0.00032560958,0.000665837,0.0003746518,0.0008227883,0.00026920522,0.000023542381],"category_scores_gemma":[0.000078565085,0.0004919429,0.00013178121,0.00032199637,0.000070336384,0.0008734062,0.00035430928,0.00021609334,0.00021500007],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025051468,0.011252312,0.099071406,0.003442951,0.0036006903,0.002032753,0.20468242,0.056610078,0.02811508,0.16478227,0.0043676323,0.42179188],"study_design_scores_gemma":[0.021687085,0.0014885267,0.2988199,0.0009983733,0.00025287856,0.0009981061,0.004468791,0.2149239,0.007867709,0.0002730248,0.4427434,0.0054783057],"about_ca_topic_score_codex":0.0014666192,"about_ca_topic_score_gemma":0.00016698321,"teacher_disagreement_score":0.5358008,"about_ca_system_score_codex":0.0004929107,"about_ca_system_score_gemma":0.00027186214,"threshold_uncertainty_score":0.99975324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8665085,0.0022875923,0.12431975,0.00094732404,0.0011955018,0.0030257546,0.00022909895,0.00061325176,0.0008732732],"genre_scores_gemma":[0.9965941,0.000055496686,0.0010239112,0.00036793054,0.00012825672,0.00018032908,0.00041780388,0.000039197064,0.0011929773],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971651,0.0005794029,0.0006500619,0.0007182046,0.00040254384,0.00048469397],"domain_scores_gemma":[0.9984119,0.00010320818,0.00042033973,0.0007704199,0.00008391743,0.00021024208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006786602,0.00039573002,0.0004430194,0.00018064665,0.0006742208,0.00058780814,0.0005369711,0.00017973219,0.000009058415],"category_scores_gemma":[0.00001763377,0.00035953295,0.00008315337,0.0001622607,0.0000803185,0.0004821258,0.00018456395,0.0001592558,0.000021590298],"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.00045415203,0.023534829,0.30279183,0.003919898,0.0014387644,0.0006905353,0.10332957,0.014656211,0.0356463,0.08357052,0.23868264,0.19128475],"study_design_scores_gemma":[0.004948547,0.00029151698,0.12134808,0.00013732859,0.000056374145,0.000012348215,0.001313509,0.84432524,0.00038746977,0.00002391474,0.02625108,0.00090461114],"about_ca_topic_score_codex":0.0050152475,"about_ca_topic_score_gemma":0.0002096719,"teacher_disagreement_score":0.829669,"about_ca_system_score_codex":0.00022142923,"about_ca_system_score_gemma":0.000044750344,"threshold_uncertainty_score":0.9998857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64611936,0.0010168024,0.35127133,0.00022873627,0.00016343677,0.0010028266,0.000022042203,0.00006123529,0.000114239905],"genre_scores_gemma":[0.97763664,0.00045151496,0.021376107,0.00009287415,0.000024940457,0.00011979353,0.000035644294,0.000014763592,0.00024775736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979007,0.00014713725,0.0008892698,0.00041693338,0.0002954665,0.00035045482],"domain_scores_gemma":[0.9988296,0.00002841709,0.00044670358,0.0004819526,0.00008561425,0.00012770323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007981152,0.00023208445,0.0003511543,0.00023709013,0.00016985097,0.00014894984,0.00034263436,0.000094595016,0.0000066988437],"category_scores_gemma":[0.000013894433,0.00021608708,0.0000550086,0.00015702767,0.000047109166,0.0010017205,0.00029700418,0.000099140365,0.0000066364646],"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.00012863589,0.0034133922,0.104021914,0.0024387133,0.0007083629,0.000019673711,0.08817126,0.10669112,0.0425211,0.12578872,0.0018592977,0.5242378],"study_design_scores_gemma":[0.0019670266,0.000047920705,0.024047233,0.00011188246,0.000014896018,0.000008226493,0.00039162175,0.9699677,0.0008836874,0.000015773301,0.0023255143,0.0002185074],"about_ca_topic_score_codex":0.001017632,"about_ca_topic_score_gemma":0.00018584763,"teacher_disagreement_score":0.8632766,"about_ca_system_score_codex":0.00017071214,"about_ca_system_score_gemma":0.00006029568,"threshold_uncertainty_score":0.88117754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017391622,0.007342553,0.97103125,0.000081522754,0.0019817697,0.00082248414,0.000006527944,0.00020172453,0.0011405317],"genre_scores_gemma":[0.92043304,0.00013109039,0.07466979,0.0001245085,0.00018500265,0.00011437395,0.0000059848944,0.000027370263,0.0043088133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825263,0.00016351555,0.0003775835,0.00062171015,0.00013464896,0.000449911],"domain_scores_gemma":[0.9986817,0.00019810855,0.00019228898,0.0004095635,0.00012287432,0.0003954599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012509848,0.00026389022,0.0004045254,0.00009876016,0.00024358339,0.00047420687,0.00037420218,0.000100849764,0.0000023909847],"category_scores_gemma":[0.00020744004,0.00021198213,0.00007261861,0.00009098468,0.000059243408,0.0002903315,0.00028860988,0.000089663845,0.000017453616],"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.000066352775,0.0010669448,0.026909452,0.0018014462,0.0007597348,0.00015782168,0.054130822,0.00070385006,0.0021941047,0.10561174,0.028440781,0.77815694],"study_design_scores_gemma":[0.0019234064,0.00024597844,0.005873594,0.000083344275,0.000051919815,0.00009874158,0.000561604,0.81803924,0.0001637234,0.00038832985,0.17206052,0.00050957076],"about_ca_topic_score_codex":0.00022829628,"about_ca_topic_score_gemma":0.000011586784,"teacher_disagreement_score":0.9030414,"about_ca_system_score_codex":0.00008608238,"about_ca_system_score_gemma":0.00008933196,"threshold_uncertainty_score":0.86443806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.989032,0.0003640788,0.0011476614,0.00004460432,0.00051701406,0.00049069413,0.000096537246,0.000032144915,0.008275278],"genre_scores_gemma":[0.9982796,0.000016266222,0.00015490856,0.000013172762,0.000041805117,0.000040454823,0.000022005608,0.000023316026,0.0014085051],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985602,0.000040154002,0.00068023195,0.0003962451,0.00005453222,0.0002686678],"domain_scores_gemma":[0.9987189,0.00002751817,0.0007580336,0.00035570425,0.000048770977,0.00009107434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055678544,0.0001838277,0.00047552586,0.00019376843,0.0002996519,0.00018819924,0.00023037773,0.000097438606,0.000036430374],"category_scores_gemma":[0.000022840355,0.0001806894,0.000054080076,0.000079998776,0.000090829235,0.00018099985,0.00004357414,0.000121921694,0.000050071867],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017265236,0.00027034417,0.81454813,0.00010223927,0.00007933712,0.0000211034,0.0007024827,0.0054010544,0.00002928535,0.17875923,0.000022272416,0.0000472691],"study_design_scores_gemma":[0.0021151593,0.00016241125,0.94787985,0.0001513563,0.00001635894,0.000038308495,0.00048703348,0.04680965,0.000031160318,0.0015465918,0.0004382554,0.00032386414],"about_ca_topic_score_codex":0.004658769,"about_ca_topic_score_gemma":0.0002858911,"teacher_disagreement_score":0.17721264,"about_ca_system_score_codex":0.000085420565,"about_ca_system_score_gemma":0.000043645785,"threshold_uncertainty_score":0.73683},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013264943,0.00009646617,0.9956675,0.0008272551,0.000976307,0.0008763601,0.00001608585,0.00012159326,0.000091935304],"genre_scores_gemma":[0.7109598,0.00023127891,0.28291705,0.00018538193,0.00013524418,0.00031115898,0.000008025463,0.000026352925,0.005225733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843615,0.00005266346,0.0004411816,0.00047352994,0.00025556912,0.00034090562],"domain_scores_gemma":[0.9988038,0.00025396346,0.00017080556,0.00037955883,0.0002071703,0.00018473578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053952873,0.0001542735,0.00018636792,0.00009214629,0.00019660481,0.0002767459,0.00033961798,0.000086181535,0.000041705058],"category_scores_gemma":[0.00023442585,0.00011117444,0.000052818512,0.0001563365,0.000030143661,0.0004303228,0.000118832126,0.000054355183,0.000044434782],"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.000073222865,0.0013325829,0.0013962672,0.0003573272,0.00029080792,0.00002265098,0.0020758405,0.4944169,0.0070138713,0.030146083,0.0034428944,0.45943156],"study_design_scores_gemma":[0.00067642477,0.00009926391,0.00034318352,0.000038188882,0.000009003967,0.000015485717,0.0000491666,0.99069345,0.002261379,0.000014799955,0.005632829,0.00016684741],"about_ca_topic_score_codex":0.00011503907,"about_ca_topic_score_gemma":0.0000035414068,"teacher_disagreement_score":0.71275043,"about_ca_system_score_codex":0.00008798652,"about_ca_system_score_gemma":0.00006257659,"threshold_uncertainty_score":0.45335624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768859,0.00075158896,0.020129582,0.000042699146,0.00089063094,0.00052068505,0.00017409225,0.000046154983,0.0005586245],"genre_scores_gemma":[0.99791574,0.00021518536,0.0009146355,0.00007913761,0.00014639509,0.000033019463,0.000008881765,0.000028908544,0.0006580654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981262,0.00014171486,0.000922435,0.00044279217,0.00006824468,0.00029860574],"domain_scores_gemma":[0.99824744,0.00017031592,0.0010839786,0.00033536312,0.000051801653,0.00011111186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016733507,0.00022865541,0.00056493,0.00009942518,0.00045285196,0.0002125634,0.00022950313,0.000120095436,0.0000306372],"category_scores_gemma":[0.00012993616,0.0001887551,0.00005685723,0.00009134869,0.00022943516,0.00013774622,0.00013772794,0.00016322504,0.000050858747],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018904824,0.00029821327,0.4653366,0.0007898906,0.00091679266,0.0000030406109,0.021359997,0.0002073628,0.0012588742,0.50692695,0.00007468347,0.0028086933],"study_design_scores_gemma":[0.0013393055,0.0003308321,0.939127,0.0006785968,0.00012151275,0.000032081443,0.0026739044,0.027866721,0.00025065345,0.025394803,0.0014583621,0.00072621665],"about_ca_topic_score_codex":0.0044367574,"about_ca_topic_score_gemma":0.00013542743,"teacher_disagreement_score":0.48153216,"about_ca_system_score_codex":0.000040662864,"about_ca_system_score_gemma":0.000019666193,"threshold_uncertainty_score":0.76972103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.994378,0.000084913816,0.0024821914,0.00005924868,0.0011201975,0.00060653745,0.000026623564,0.000038707218,0.0012035853],"genre_scores_gemma":[0.9982123,0.000006461466,0.00003749372,0.00006497838,0.0002138719,0.000049959563,0.000026186253,0.00002802126,0.0013607607],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99855673,0.00006937985,0.00047006787,0.00035250152,0.00013135227,0.00041995448],"domain_scores_gemma":[0.99948865,0.000042012205,0.00019514737,0.00015153755,0.000031921274,0.000090726775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024231039,0.00023158787,0.00044148657,0.00007859192,0.0002083032,0.00016905871,0.00015513854,0.0000915323,0.000054694334],"category_scores_gemma":[0.000003133007,0.00021953654,0.00011332356,0.00010766825,0.000032316577,0.00015549669,0.00011393323,0.00020850309,0.000042609627],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002131789,0.000107300104,0.9736313,0.000030263454,0.000067469555,0.0000023448542,0.0011152456,0.009866508,0.000019975554,0.012832385,0.000021960008,0.002303099],"study_design_scores_gemma":[0.0011566704,0.000019050121,0.6138492,0.000059224767,0.0000117421205,5.590358e-7,0.0009569836,0.3818685,0.0000010497555,0.000026510732,0.0017301899,0.00032026757],"about_ca_topic_score_codex":0.0024367913,"about_ca_topic_score_gemma":0.000033489574,"teacher_disagreement_score":0.372002,"about_ca_system_score_codex":0.00007431241,"about_ca_system_score_gemma":0.00003327137,"threshold_uncertainty_score":0.89524406},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889036,0.003471328,0.0020860385,0.000109256594,0.0016458292,0.0027993105,0.00011955779,0.00009858992,0.0007665359],"genre_scores_gemma":[0.9971973,0.00028685297,0.00008413482,0.00003476763,0.00007333168,0.000528671,0.00004514461,0.00002471311,0.001725103],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9972584,0.0005328522,0.0007490741,0.00047625962,0.0004666875,0.00051670504],"domain_scores_gemma":[0.99899703,0.000051075207,0.00044921058,0.0002418402,0.000069773145,0.0001910834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015026055,0.00022688544,0.00046481297,0.00020553816,0.00087919174,0.00016816678,0.00029070122,0.00011119651,0.000042596366],"category_scores_gemma":[0.000042204087,0.00021332853,0.00006370814,0.00028766107,0.00016509193,0.00039193075,0.00018894054,0.00019204116,0.0000063272523],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004786458,0.004655056,0.7690208,0.002161406,0.00072435266,0.00025994453,0.115413815,0.013812068,0.0051291073,0.04650087,0.0008483613,0.04099558],"study_design_scores_gemma":[0.0092395395,0.00038593356,0.40580562,0.000194109,0.00014761164,0.000033492568,0.060263578,0.39152828,0.00003465532,0.000010107744,0.13135675,0.001000343],"about_ca_topic_score_codex":0.025361834,"about_ca_topic_score_gemma":0.0007771831,"teacher_disagreement_score":0.3777162,"about_ca_system_score_codex":0.0002974996,"about_ca_system_score_gemma":0.00010954632,"threshold_uncertainty_score":0.9811284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008090792,0.00015103132,0.9851484,0.00023033164,0.0037038159,0.0016368243,0.0000024482165,0.00082482287,0.00021156958],"genre_scores_gemma":[0.9615466,0.0004706599,0.0124610895,0.00019558103,0.00040360802,0.00030669232,0.00011481148,0.00006315859,0.024437811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971378,0.0001312546,0.00073053234,0.0006728976,0.00044849075,0.0008790228],"domain_scores_gemma":[0.99845046,0.0001743862,0.00044548634,0.000565514,0.0001308376,0.00023332835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010337839,0.00035626823,0.00039801045,0.00019897136,0.0007791067,0.00052977115,0.00053371384,0.00015583173,0.00000768313],"category_scores_gemma":[0.000086183274,0.0003407899,0.00014375444,0.00041192258,0.000038957623,0.00039022163,0.0004270154,0.00023500316,0.00021467087],"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.000005528162,0.000022948416,0.0022446648,0.00019711796,0.00011520873,0.00001463633,0.000990572,0.9843906,0.00013604155,0.0022028617,0.0062565664,0.0034232272],"study_design_scores_gemma":[0.0009559125,0.0001681401,0.0030614536,0.00009140838,0.000030612053,0.000009899033,0.00024248086,0.85126024,0.00005534204,0.0000061089995,0.143784,0.0003344143],"about_ca_topic_score_codex":0.0001284435,"about_ca_topic_score_gemma":0.000006025089,"teacher_disagreement_score":0.9726873,"about_ca_system_score_codex":0.00019095761,"about_ca_system_score_gemma":0.00006483382,"threshold_uncertainty_score":0.9999044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015674375,0.00010920692,0.97427344,0.00025668944,0.0018581221,0.0009206998,0.000002094269,0.0012979449,0.0056074355],"genre_scores_gemma":[0.96231294,0.00015136905,0.0019914228,0.0001536921,0.000069280635,0.000061981424,0.000041164483,0.000029116605,0.035189047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757385,0.000114213595,0.0006312952,0.00054372643,0.0004529827,0.0006839052],"domain_scores_gemma":[0.99874604,0.000089537425,0.00030103337,0.0005279179,0.0000851294,0.0002503404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074255466,0.00030240935,0.0003325786,0.0002737012,0.0004747839,0.00050435634,0.0006014588,0.00011317356,0.000020900048],"category_scores_gemma":[0.00006675496,0.00027725744,0.000086998414,0.00045127945,0.00007357893,0.0004049147,0.000494472,0.00024553793,0.0006371072],"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.000002131181,0.000018612991,0.0027192184,0.00009860898,0.00009120273,0.00007282429,0.0019423934,0.9805279,0.0002079779,0.009686578,0.0016769199,0.0029556423],"study_design_scores_gemma":[0.00086010736,0.00012705283,0.0031269474,0.000067068824,0.0000130056715,0.000026528745,0.0004760858,0.93540925,0.000035951103,0.000004595324,0.05953708,0.00031630645],"about_ca_topic_score_codex":0.00020153598,"about_ca_topic_score_gemma":0.0000021967378,"teacher_disagreement_score":0.972282,"about_ca_system_score_codex":0.00012330066,"about_ca_system_score_gemma":0.00009985054,"threshold_uncertainty_score":0.99996793},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8917679,0.0011974329,0.09986929,0.00034831755,0.0012722283,0.0007716287,0.00001324417,0.00007825922,0.0046816664],"genre_scores_gemma":[0.98395276,0.00005393155,0.00009389504,0.00027466644,0.000041469335,0.000037723108,0.0000035720873,0.0000068427225,0.015535158],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980151,0.00023905507,0.0005981201,0.0005432017,0.0002970545,0.00030748826],"domain_scores_gemma":[0.998779,0.00037424042,0.00018315269,0.0004843601,0.00007537062,0.000103872044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017837546,0.0001659656,0.00033611624,0.00031022762,0.0007214989,0.00022666324,0.0005552181,0.00010242755,0.000058007343],"category_scores_gemma":[0.00014027402,0.00013423055,0.00007785756,0.00056351,0.000086576336,0.00016350092,0.00083471043,0.00014530921,0.00009120572],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432764,0.00057101774,0.83719105,0.000064827924,0.00014255242,0.000055274053,0.008407103,0.035505075,0.00031567918,0.04305447,0.010722386,0.063926265],"study_design_scores_gemma":[0.0013226789,0.000024167663,0.47874376,0.0001469391,0.00003718134,0.000006811028,0.0038981114,0.3802756,0.000024642786,0.0014358882,0.13374752,0.0003366795],"about_ca_topic_score_codex":0.0005183255,"about_ca_topic_score_gemma":0.00010011575,"teacher_disagreement_score":0.35844725,"about_ca_system_score_codex":0.00007434049,"about_ca_system_score_gemma":0.000032367727,"threshold_uncertainty_score":0.5549259},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008677289,0.0009966324,0.9845087,0.00083977205,0.0015918479,0.0029163202,0.000021708816,0.0002681827,0.00017953299],"genre_scores_gemma":[0.9727675,0.00013022551,0.022233611,0.0005256783,0.00005524897,0.00060153566,0.000032088385,0.000031177675,0.003622988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745625,0.00024503257,0.0007049081,0.00064217526,0.00038090468,0.0005707559],"domain_scores_gemma":[0.9979829,0.00020793849,0.0003757188,0.0010006205,0.00021336749,0.00021945068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008425469,0.00036099888,0.00048487278,0.00033305338,0.00072601566,0.0009636536,0.0010045862,0.00015825714,0.0000019779272],"category_scores_gemma":[0.000049042465,0.00034613966,0.00012293423,0.00027084682,0.00005047682,0.0003840046,0.00033327795,0.00017116686,0.00002600265],"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.000008751922,0.00008882831,0.002484124,0.00039094468,0.00015277855,0.0000075275084,0.0043788413,0.9864802,0.00020078447,0.003498037,0.0018536894,0.0004554999],"study_design_scores_gemma":[0.0013326879,0.000078908495,0.005863879,0.00068345474,0.000057723886,0.00001537061,0.0025440715,0.9722301,0.00035870113,0.0000046889772,0.016421149,0.00040926537],"about_ca_topic_score_codex":0.0010098661,"about_ca_topic_score_gemma":0.000032366333,"teacher_disagreement_score":0.96409017,"about_ca_system_score_codex":0.00036101826,"about_ca_system_score_gemma":0.000089108435,"threshold_uncertainty_score":0.9998991},"labels":[],"label_agreement":null}]}