{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":63,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":63,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"1fb3a78d8e29","filters":{"venue":"Adaptive Agents and Multi-Agents Systems"}},"results":[{"id":"W2123268776","doi":"10.1109/aamas.2004.145","title":"Improving User Satisfaction in Agent-Based Electronic Marketplaces by Reputation Modelling and Adjustable Product Quality","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reputation; Quality (philosophy); Product (mathematics); Reinforcement learning; Purchasing; Exploit; Computer science; Value (mathematics); Business; Marketing; Computer security; Artificial intelligence; Machine learning","authors":[{"name":"Thomas Tran","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.113563233541252,"gpt":0.3651636397994741,"spread":0.2516004062582221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002836179,0.0002191948,0.0003100609,0.0002002077,0.0003738408,0.0002522157,0.000148741,0.00008943169,0.00002641264],"category_scores_gemma":[0.0002302794,0.0001864958,0.00004681814,0.000419831,0.00008903939,0.0006878322,0.00005314697,0.0001808134,0.00002383533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002037176,"about_ca_system_score_gemma":0.0000846237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004734028,"about_ca_topic_score_gemma":0.0003499227,"domain_scores_codex":[0.9969911,0.0004746495,0.0007735669,0.0008427313,0.0005513935,0.0003665817],"domain_scores_gemma":[0.9986341,0.0002276725,0.0004960765,0.0003415811,0.0001739176,0.0001266258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009928498,0.001142981,0.1353865,0.000271971,0.0002279689,0.00001429425,0.005630582,0.7454301,0.01479086,0.0200224,0.001509562,0.07457996],"study_design_scores_gemma":[0.00679098,0.0002518297,0.1108839,0.0002313426,0.00008168558,0.00002182518,0.01334615,0.8519894,0.002521198,0.004360235,0.00845,0.001071532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6857045,0.0008196257,0.3123352,0.00008654069,0.0001592991,0.0007666867,0.00003762953,0.00003442684,0.00005610604],"genre_scores_gemma":[0.99703,0.0001182475,0.001074105,0.00006982981,0.00003602604,0.0001309714,0.00001874208,0.00001879176,0.001503332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3113254,"threshold_uncertainty_score":0.7605076,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2190606234","doi":"10.5555/2936924.2936996","title":"State of the Art Control of Atari Games Using Shallow Reinforcement Learning","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Benchmark (surveying); Representation (politics); Artificial intelligence; Set (abstract data type); Strengths and weaknesses; Simple (philosophy); Key (lock); Artificial neural network; Feature learning; Machine learning","authors":[{"name":"Yitao Liang","is_ca":false},{"name":"Marlos C. Machado","is_ca":true},{"name":"Erik Talvitie","is_ca":false},{"name":"Michael Bowling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04777979186199204,"gpt":0.2658761195988801,"spread":0.218096327736888,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000522711,0.000224929,0.0003864034,0.00009769399,0.0001512565,0.00005925732,0.0006308009,0.00005453277,0.000008249152],"category_scores_gemma":[0.00009829664,0.0001325069,0.0001132085,0.0001723518,0.0001406671,0.0004295114,0.0003965565,0.0001181445,0.00001319185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007828774,"about_ca_system_score_gemma":0.00006089575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002497356,"about_ca_topic_score_gemma":0.000006314018,"domain_scores_codex":[0.9977903,0.0002549258,0.0006700302,0.0003490713,0.000583498,0.0003521264],"domain_scores_gemma":[0.9981955,0.0001361202,0.0008156036,0.0005317581,0.0002241899,0.00009679316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002873874,0.00004502024,0.03742846,0.00008640031,0.0003013826,0.000005115685,0.001289596,0.9482355,0.007769123,0.0011858,0.00007662026,0.003548306],"study_design_scores_gemma":[0.00189214,0.0001803956,0.01216922,0.0006079295,0.00003565308,0.000005253548,0.0001152476,0.9818466,0.0007525636,0.000006083937,0.002207422,0.0001814743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05036366,0.0001757146,0.9479423,0.00003966939,0.0005319819,0.0006639892,0.000005972487,0.00002941503,0.0002472771],"genre_scores_gemma":[0.9947135,0.00009203773,0.001628949,0.00004644096,0.00001993433,0.00001173028,0.0000010307,0.00001693143,0.003469455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9463134,"threshold_uncertainty_score":0.5403474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169619645","doi":"10.5555/2484920.2485084","title":"Smart exploration in reinforcement learning using absolute temporal difference errors","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Temporal difference learning; Computer science; State (computer science); Function (biology); Artificial intelligence; Function approximation; Control (management); Machine learning; Algorithm; Artificial neural network","authors":[{"name":"Clement Gehring","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1078690293136804,"gpt":0.2926166985086204,"spread":0.18474766919494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004013775,0.000326112,0.0003495043,0.0002562618,0.0002838597,0.000422989,0.0004722606,0.0001140976,0.00001898418],"category_scores_gemma":[0.00005351395,0.0002987753,0.00004944437,0.0003205286,0.00005872198,0.00142779,0.0004100343,0.0002925943,0.0001084446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001910326,"about_ca_system_score_gemma":0.00004879791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00421482,"about_ca_topic_score_gemma":0.00003224123,"domain_scores_codex":[0.9973987,0.0002485389,0.0006908059,0.000579794,0.0005194232,0.0005627802],"domain_scores_gemma":[0.9987924,0.00005292565,0.0004134124,0.0004035714,0.0001493699,0.0001883981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006353057,0.00005383734,0.03842801,0.00005249882,0.00005739905,0.00001976851,0.003624791,0.9550254,0.0006567722,0.0008062542,0.0001252262,0.001143648],"study_design_scores_gemma":[0.0008635098,0.0001604327,0.0436471,0.0001924341,0.000008756949,0.000006031671,0.0007918809,0.9534333,0.00002698218,0.00001229365,0.0005362582,0.0003209717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1902142,0.00009192763,0.8075156,0.00004357572,0.0006564858,0.00103637,5.479687e-7,0.00009644435,0.0003449435],"genre_scores_gemma":[0.9886762,0.00006678287,0.007528981,0.00008723621,0.00003992909,0.00010097,0.00001331936,0.00002503665,0.003461479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7999865,"threshold_uncertainty_score":0.9999464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2207815291","doi":"10.5555/2772879.2773387","title":"Quality and Budget Aware Task Allocation for Spatial Crowdsourcing","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Crowdsourcing; Reputation; Computer science; Task (project management); Quality (philosophy); Field (mathematics); Budget constraint; Trustworthiness; Computer security; World Wide Web; Engineering; Economics; Microeconomics","authors":[{"name":"Han Yu","is_ca":false},{"name":"Chunyan Miao","is_ca":false},{"name":"Zhiqi Shen","is_ca":false},{"name":"Cyril Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1176461571073611,"gpt":0.3282903362198304,"spread":0.2106441791124694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001140612,0.0002758338,0.0003736472,0.000101599,0.0003525261,0.0004081026,0.0002724978,0.0001237138,8.393608e-7],"category_scores_gemma":[0.0001399527,0.000251165,0.00006225977,0.0001273154,0.00007523593,0.0003939093,0.0002343323,0.0001111585,0.000008975973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008425104,"about_ca_system_score_gemma":0.00007002073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002602888,"about_ca_topic_score_gemma":0.0000899623,"domain_scores_codex":[0.9978067,0.0002464427,0.0004752361,0.0007122252,0.0003483842,0.0004110331],"domain_scores_gemma":[0.998477,0.0001259135,0.0002771584,0.0004426168,0.0003255557,0.0003517111],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001029039,0.002717799,0.1849001,0.0031102,0.002355831,0.0002779725,0.1238473,0.02521829,0.01831085,0.04729099,0.04531319,0.5456284],"study_design_scores_gemma":[0.003149115,0.0002473766,0.03100028,0.0001863854,0.00003744565,0.00004533188,0.00221127,0.9509006,0.0002410093,0.0001310363,0.011278,0.000572207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.188614,0.0005550627,0.8086303,0.0001576255,0.000929346,0.0008242006,0.00002868321,0.0001204019,0.0001403677],"genre_scores_gemma":[0.993108,0.00002174456,0.005784993,0.000210881,0.0001797447,0.00007757151,0.00001783286,0.00002532646,0.0005739085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9256822,"threshold_uncertainty_score":0.999994,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185548553","doi":"10.5555/2615731.2615791","title":"Reputation-aware task allocation for human trustees","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Reputation; Task (project management); Computer science; Workload; Delegation; Crowdsourcing; Resource allocation; Operations research; Economics; Computer network; World Wide Web; Mathematics","authors":[{"name":"Han Yu","is_ca":false},{"name":"Chunyan Miao","is_ca":false},{"name":"Bo An","is_ca":false},{"name":"Zhiqi Shen","is_ca":false},{"name":"Cyril Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04947797062188094,"gpt":0.2924733497182121,"spread":0.2429953790963311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005587741,0.0002191453,0.0002647101,0.0001062485,0.0005378046,0.0003389188,0.0003054861,0.00009297681,0.000002350526],"category_scores_gemma":[0.00005948356,0.0001994343,0.00007480376,0.0001072628,0.00004670738,0.0003299899,0.0001021584,0.00007663319,0.00001679533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004996128,"about_ca_system_score_gemma":0.00002145658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004027116,"about_ca_topic_score_gemma":0.0000329207,"domain_scores_codex":[0.9982788,0.0001613989,0.000384531,0.0006060567,0.0002437631,0.0003254377],"domain_scores_gemma":[0.9988285,0.000109554,0.0002415359,0.0004554923,0.0002192395,0.0001456249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001841553,0.002290344,0.0273182,0.002365161,0.001795771,0.000080347,0.06285778,0.04766236,0.03644472,0.3511183,0.03744551,0.4304373],"study_design_scores_gemma":[0.001445103,0.0002141318,0.00871352,0.000179764,0.00003225958,0.0000161964,0.0006635374,0.9708052,0.0002958022,0.000228618,0.01704132,0.0003645129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09325492,0.0001407629,0.904435,0.00008107971,0.000760576,0.0007977804,0.00001112511,0.0001520783,0.0003667283],"genre_scores_gemma":[0.9925984,0.000009371985,0.005027448,0.0001717332,0.0001573352,0.000114844,0.00002693178,0.00002391619,0.001869988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9231429,"threshold_uncertainty_score":0.8132694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2621346283","doi":"10.5555/3091125.3091215","title":"Divide and Conquer: Using Geographic Manipulation to Win District-Based Elections","year":2017,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Gerrymandering; Ballot; Divide and conquer algorithms; Computer science; Voting; Redistricting; Secret ballot; Political science; Computer security; Law; Algorithm; Politics; Democracy","authors":[{"name":"Yoad Lewenberg","is_ca":false},{"name":"Omer Lev","is_ca":true},{"name":"Jeffrey S. Rosenschein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1650542679779625,"gpt":0.302302601841162,"spread":0.1372483338631995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007058154,0.0002350887,0.000429979,0.0002549994,0.0009471124,0.0004119583,0.0001913013,0.0001139342,0.00003069392],"category_scores_gemma":[0.00015291,0.0002517108,0.00007237884,0.0001008764,0.00009092241,0.0002821347,0.00009724993,0.0001079343,0.00006800283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006697835,"about_ca_system_score_gemma":0.000009993149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004617658,"about_ca_topic_score_gemma":0.00007673866,"domain_scores_codex":[0.9984473,0.00007405449,0.0005377952,0.0005443054,0.00006208992,0.0003344517],"domain_scores_gemma":[0.9986813,0.00005805713,0.0005667038,0.0004353052,0.00005723238,0.0002013844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00003692502,0.000138539,0.9410152,0.0001005837,0.0001971623,0.00001129512,0.0004599307,0.001026636,0.000193562,0.05625463,0.0002019919,0.0003635118],"study_design_scores_gemma":[0.001437444,0.0001329799,0.816964,0.0002450546,0.00003870881,0.00001223615,0.0002178665,0.1722614,0.00003245253,0.0006344024,0.007485597,0.0005378625],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9432294,0.0007334675,0.05287823,0.00009043465,0.000849642,0.000850488,0.0002317435,0.00004266408,0.001093952],"genre_scores_gemma":[0.9985039,0.000033195,0.0002376444,0.00008689786,0.0001114174,0.00005168421,0.00001381901,0.0000317314,0.0009296812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1712347,"threshold_uncertainty_score":0.9999935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2399400183","doi":"10.5555/2615731.2616114","title":"An agent-based game for the predictive diagnosis of parkinson's disease","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Parkinson's Disease Mechanisms and Treatments","field":"Medicine","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Disease; Computer science; Dimension (graph theory); Parkinson's disease; Artificial intelligence; Psychology; Medicine; Pathology","authors":[{"name":"Yundong Cai","is_ca":false},{"name":"Zhiqi Shen","is_ca":false},{"name":"Siyuan Liu","is_ca":false},{"name":"Han Yu","is_ca":false},{"name":"Xiaogang Han","is_ca":false},{"name":"Junhua Ji","is_ca":false},{"name":"Martin J. McKeown","is_ca":true},{"name":"Cyril Leung","is_ca":true},{"name":"Chunyan Miao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04910252149115665,"gpt":0.3015570224745988,"spread":0.2524545009834422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003511333,0.0003665745,0.0005350933,0.0001180143,0.0002325717,0.00004859644,0.0001853477,0.00009703527,0.00003598085],"category_scores_gemma":[0.0001236729,0.0002431582,0.0002394581,0.0001248021,0.0001379383,0.000127838,0.00004538907,0.00008943386,0.0000113286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008112643,"about_ca_system_score_gemma":0.0000878663,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003384327,"about_ca_topic_score_gemma":0.00001378353,"domain_scores_codex":[0.9978777,0.000207468,0.0004097501,0.0006380285,0.0004517812,0.0004153221],"domain_scores_gemma":[0.9979458,0.0002599278,0.0002999235,0.0006139662,0.0002388382,0.0006415801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.005838342,0.008379606,0.9379359,0.001298721,0.003582401,0.0001554115,0.001366619,0.003162472,0.0004276664,0.001550319,0.003134911,0.03316767],"study_design_scores_gemma":[0.006988733,0.001225212,0.5645131,0.0003252878,0.001244357,0.000002827778,0.0004034177,0.3680252,0.0002736729,0.00002435779,0.05673841,0.0002353969],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8914613,0.003597511,0.0959218,0.0002135778,0.0009659889,0.00587211,0.001729946,0.0001130809,0.0001246941],"genre_scores_gemma":[0.9963678,0.0002935711,0.0006211714,0.0003968471,0.0001743993,0.001637708,0.0001510931,0.00006155594,0.0002958767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3734227,"threshold_uncertainty_score":0.9915702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067164575","doi":"10.1109/aamas.2004.225","title":"RedAgent-2003: An Autonomous Market-Based Supply-Chain Management Agent","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Supply chain; Competition (biology); Key (lock); Autonomous agent; Supply chain management; Order (exchange); Heuristic; Domain (mathematical analysis); Industrial organization; Risk analysis (engineering); Operations research; Business; Artificial intelligence; Computer security; Marketing; Engineering","authors":[{"name":"Philipp W. Keller","is_ca":true},{"name":"Felix-Olivier Duguay","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1206537016970483,"gpt":0.3621967737325457,"spread":0.2415430720354974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002425581,0.0004408346,0.0004949854,0.0004063873,0.0008486777,0.0004432055,0.0008407523,0.0001565815,0.0006910112],"category_scores_gemma":[0.0001345672,0.0003600883,0.0001465812,0.0009113706,0.0002429142,0.0004663935,0.000222888,0.0001865008,0.0007223875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002358996,"about_ca_system_score_gemma":0.00009504773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003365275,"about_ca_topic_score_gemma":0.00004761605,"domain_scores_codex":[0.9952723,0.0005853939,0.001083155,0.001285932,0.001176239,0.0005969852],"domain_scores_gemma":[0.9972222,0.0001242297,0.0005250258,0.00118465,0.0003901481,0.0005537851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001680287,0.01275578,0.02540901,0.0003700384,0.002301065,0.001453518,0.01517227,0.1556161,0.001590189,0.4335035,0.1104707,0.2396775],"study_design_scores_gemma":[0.01209733,0.0008378812,0.1472055,0.0003576131,0.000322608,0.000104603,0.02671899,0.2123341,0.0006081801,0.007231264,0.5899282,0.002253772],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.36665,0.001092221,0.5979459,0.0009584814,0.004302322,0.006897636,0.0006851889,0.0005423421,0.02092584],"genre_scores_gemma":[0.9695865,0.00007399073,0.00501742,0.000582541,0.0001330542,0.0003763305,0.00004902406,0.00004659821,0.02413452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6029364,"threshold_uncertainty_score":0.9998851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W189510620","doi":"10.5555/1838206.1838300","title":"Optimal policy switching algorithms for reinforcement learning","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Function approximation; Term (time); Function (biology); Artificial intelligence; Mathematical optimization; Q-learning; Machine learning; Algorithm; Mathematics; Artificial neural network; Engineering","authors":[{"name":"Gheorghe Comanici","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05548713756434804,"gpt":0.3163627497273219,"spread":0.2608756121629739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072665,0.0003748134,0.0003739524,0.0002639217,0.000655353,0.0006429353,0.000762779,0.0001634604,0.000008847484],"category_scores_gemma":[0.0002019615,0.0003414323,0.0001251228,0.0002515775,0.00005588511,0.0008118253,0.0005037243,0.0004893672,0.00004698865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009004336,"about_ca_system_score_gemma":0.0001047327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005621783,"about_ca_topic_score_gemma":0.000005915185,"domain_scores_codex":[0.9973838,0.00009431536,0.0005935272,0.0006824409,0.0005060001,0.0007399363],"domain_scores_gemma":[0.9983873,0.0001413403,0.0004104633,0.0005359778,0.0002184811,0.0003063809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002124426,0.00007026424,0.001339009,0.00009151302,0.0002252631,0.00001811232,0.003370405,0.9617352,0.002095703,0.01786132,0.0004684745,0.01270345],"study_design_scores_gemma":[0.001594601,0.0002906306,0.001124516,0.00008843073,0.00002096011,0.00002360533,0.0003784449,0.9735807,0.0001502521,0.000009275698,0.02235008,0.0003884586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01375788,0.00008064912,0.9821928,0.000116347,0.001683894,0.001191839,0.000002751896,0.0001990298,0.0007748594],"genre_scores_gemma":[0.918988,0.00006690561,0.07539506,0.0001797037,0.0003784862,0.0001383453,0.0000158374,0.00004316452,0.004794449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9067977,"threshold_uncertainty_score":0.9999038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1530765895","doi":"10.5555/1402821.1402883","title":"A new approach to cooperative pathfinding","year":2008,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Computer science; Plan (archaeology); Fidelity; Path (computing); Human–computer interaction; Distributed computing; Operations research; Artificial intelligence; Shortest path problem; Theoretical computer science; Engineering; Computer network","authors":[{"name":"Renee Jansen","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1323674272381753,"gpt":0.2951577467995893,"spread":0.1627903195614141,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003069453,0.0003240148,0.0004074562,0.0001827721,0.0004471135,0.0001792382,0.0006804323,0.0001008847,0.000005064367],"category_scores_gemma":[0.00006047963,0.0002800398,0.0000590499,0.000457011,0.00004262282,0.0004346403,0.0003757818,0.0001718201,0.0002694764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009427808,"about_ca_system_score_gemma":0.0001160442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007515693,"about_ca_topic_score_gemma":0.000001355304,"domain_scores_codex":[0.9975634,0.0001915916,0.0003771481,0.0008721158,0.0004634947,0.0005322554],"domain_scores_gemma":[0.9986116,0.00006234862,0.0001415922,0.0005179736,0.0001276737,0.0005388258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002067125,0.00363677,0.05771827,0.0003633848,0.002524965,0.003936135,0.3063135,0.2209567,0.002866337,0.04959951,0.2837064,0.06817134],"study_design_scores_gemma":[0.001568304,0.0001910475,0.02900501,0.0001343385,0.00001657125,0.0003317742,0.0007286678,0.9617422,0.00006130755,0.000006281556,0.005627213,0.0005872498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01149471,0.0002707916,0.9830629,0.00004801481,0.0009314141,0.0009140591,0.00001455218,0.00015561,0.003108009],"genre_scores_gemma":[0.6268398,0.00003667596,0.3623576,0.0003247683,0.0001638395,0.00007971437,0.000008374624,0.00002929003,0.01016005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7407855,"threshold_uncertainty_score":0.9999652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2465754415","doi":"10.5555/2936924.2936979","title":"The Echo Chamber: Strategic Voting and Homophily in Social Networks","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Homophily; Voting; Politics; Population; Social network (sociolinguistics); Voter model; Echo (communications protocol); Ideology; Phenomenon; Political science; Microeconomics; Computer science; Economics; Sociology; Computer security; Social psychology; Law; Social media; Psychology; Mathematics","authors":[{"name":"Alan Tsang","is_ca":true},{"name":"Kate Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04929803298486006,"gpt":0.293394228016417,"spread":0.2440961950315569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002986633,0.0001863449,0.00022157,0.00003110001,0.000567369,0.0001582524,0.00009953793,0.00006934791,0.000008713757],"category_scores_gemma":[0.000003645392,0.0001154031,0.00005163916,0.00008975585,0.0001341496,0.000132509,0.0000981189,0.0001264006,0.000006534636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003129819,"about_ca_system_score_gemma":0.00002137808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00106964,"about_ca_topic_score_gemma":0.00007491709,"domain_scores_codex":[0.9987795,0.0001263414,0.0003039706,0.0002943556,0.0001307291,0.0003651123],"domain_scores_gemma":[0.9994883,0.00009567285,0.0001683773,0.00009996586,0.00005624832,0.00009142675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00007568533,0.0003029072,0.6107571,0.00003870267,0.0004594048,0.00002406432,0.004247847,0.0006156545,0.0001951823,0.3357841,0.0003898423,0.0471096],"study_design_scores_gemma":[0.006321154,0.0001750852,0.5335445,0.000550065,0.00006126059,0.000005458594,0.01618283,0.4343341,0.000005309028,0.002970678,0.004665696,0.001183897],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.991694,0.0005727443,0.003880329,0.0001617833,0.0006136239,0.0006070199,0.00007570615,0.00002092624,0.002373848],"genre_scores_gemma":[0.9985834,0.0001437571,0.0000179194,0.00002929432,0.0003591578,0.00004517807,0.000004612089,0.00001814398,0.0007985522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4337184,"threshold_uncertainty_score":0.4706001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W108564685","doi":"10.5555/2484920.2484946","title":"The impact of culture on crowd dynamics: an empirical approach","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Crowds; Pedestrian; Crowd simulation; Macro; Computer science; Crowd psychology; Set (abstract data type); Domain (mathematical analysis); Dynamics (music); Human–computer interaction; Data science; Simulation; Artificial intelligence; Computer security; Transport engineering; Sociology; Engineering; Mathematics","authors":[{"name":"Natalie Fridman","is_ca":false},{"name":"Gal A. Kaminka","is_ca":false},{"name":"Avishay Zilka","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04528727989469312,"gpt":0.3138364174435642,"spread":0.2685491375488711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001557225,0.0002447748,0.000245083,0.00005425565,0.0001566316,0.0001254777,0.0001992885,0.0001317767,0.00001888761],"category_scores_gemma":[0.000016018,0.0001470961,0.0001013121,0.0001161327,0.00006718734,0.0001902967,0.00003288135,0.00017321,0.00004013681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001397829,"about_ca_system_score_gemma":0.00001418097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004921257,"about_ca_topic_score_gemma":0.00002864891,"domain_scores_codex":[0.9988457,0.00009572805,0.0003260151,0.0002268971,0.0002220098,0.0002836474],"domain_scores_gemma":[0.9992795,0.00003639525,0.00008555369,0.0003041181,0.0001188606,0.000175553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000199901,0.002401608,0.1403901,0.000533673,0.0034849,0.00002008089,0.02053302,0.7324818,0.002446485,0.007747477,0.05602232,0.03373866],"study_design_scores_gemma":[0.0004885085,0.0001531145,0.07974432,0.00002557553,0.00001434638,0.000004905686,0.001982612,0.9171114,0.000006222434,0.00001524961,0.0002875588,0.0001662131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9738685,0.0005073983,0.01779369,0.00001446533,0.0003850972,0.001107279,0.0001153816,0.0001341326,0.006074062],"genre_scores_gemma":[0.9980672,0.0001461493,0.0003233029,0.0000233864,0.00005120345,0.00007524768,0.00005631512,0.0000376912,0.001219501],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1846296,"threshold_uncertainty_score":0.5998406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1514520309","doi":"10.5555/1838206.1838534","title":"On multi-robot area coverage","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Robot; Task (project management); Computer science; Point (geometry); Path (computing); Mobile robot; Actuator; Motion planning; Robot kinematics; Human–computer interaction; Robot control; Task analysis; Artificial intelligence; Real-time computing; Engineering; Computer network; Systems engineering","authors":[{"name":"Pooyan Fazli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07079121496115787,"gpt":0.2913392058689059,"spread":0.220547990907748,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004742963,0.0004267689,0.0004331078,0.0001872309,0.0003508747,0.0003406911,0.0008791683,0.0002020207,0.00001809777],"category_scores_gemma":[0.0001277942,0.0003617572,0.00009688722,0.0002384126,0.00009084569,0.0004350137,0.000333814,0.0004788426,0.0002963074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005557877,"about_ca_system_score_gemma":0.00005272185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000427017,"about_ca_topic_score_gemma":0.00001486427,"domain_scores_codex":[0.9972617,0.0001661328,0.0004532484,0.0009481253,0.0005451074,0.0006256665],"domain_scores_gemma":[0.9981196,0.0001797572,0.0002667935,0.0009015305,0.0001412054,0.0003911261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005692892,0.01840817,0.1686023,0.001074612,0.00491483,0.01118703,0.0518564,0.2231862,0.05564465,0.1514358,0.07816609,0.2349546],"study_design_scores_gemma":[0.002160768,0.0001978612,0.05746984,0.0001312563,0.00001811125,0.00007791084,0.00008345091,0.9363019,0.0001151029,0.00003640672,0.002898092,0.0005092956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08123308,0.0001584605,0.9108025,0.00008421673,0.005271426,0.0009505602,0.00005374839,0.0002891868,0.001156849],"genre_scores_gemma":[0.9325032,0.00002834508,0.06369387,0.0003808806,0.0001189017,0.00006824553,0.00001254288,0.00003643183,0.00315764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8512701,"threshold_uncertainty_score":0.9998834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080977664","doi":"10.1109/aamas.2004.31","title":"A Study of Limited-Precision, Incremental Elicitation in Auctions","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Common value auction; Mathematics; Statistics","authors":[{"name":"Alexander Kreß","is_ca":true},{"name":"Craig Boutilier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2353454774043542,"gpt":0.4198643718112466,"spread":0.1845188944068924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001388603,0.0001658094,0.0003191617,0.0004432038,0.000267371,0.00008404146,0.0003083075,0.00007005656,0.00004158594],"category_scores_gemma":[0.0003235697,0.0001323776,0.00005733681,0.000901019,0.00009190387,0.0003708798,0.0001263105,0.0001147781,0.0001043273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008493935,"about_ca_system_score_gemma":0.00003186121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001360108,"about_ca_topic_score_gemma":0.0004075488,"domain_scores_codex":[0.9972133,0.000358005,0.0009690875,0.0005210267,0.0007499073,0.0001886414],"domain_scores_gemma":[0.9985148,0.0002555257,0.0004219202,0.0004120039,0.0002838234,0.0001119349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0009224226,0.0321693,0.4841737,0.00006816025,0.0009906569,0.0001256263,0.1807539,0.1467665,0.01238094,0.07722002,0.0054013,0.05902745],"study_design_scores_gemma":[0.009182845,0.0009722941,0.7282798,0.0001589013,0.00007378665,0.00003432328,0.2405542,0.01084414,0.0004726324,0.005752669,0.003175607,0.0004988372],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840295,0.00009109169,0.01364516,0.0000564449,0.0003723516,0.0012816,0.0000397538,0.00002308849,0.0004610495],"genre_scores_gemma":[0.9986912,0.00002403221,0.0004393215,0.00003775376,0.0000382185,0.0001569794,0.000006662275,0.00001183953,0.0005940212],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2441061,"threshold_uncertainty_score":0.5398201,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965168983","doi":"10.1109/aamas.2004.79","title":"Building a Multi-Agent System for Automatic Negotiation in Web Service Applications","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Interoperability; The Internet; Automation; Web service; Computer science; Negotiation; Context (archaeology); World Wide Web; Service (business); Service-oriented architecture; Software engineering; Engineering; Business","authors":[{"name":"Ambroise Ncho","is_ca":true},{"name":"Esma Aı̈meur","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0593280038444144,"gpt":0.3003480340789453,"spread":0.2410200302345309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009040083,0.0005096562,0.0006409576,0.0004676861,0.0004738917,0.0003783263,0.0007625822,0.0002358582,0.000002632013],"category_scores_gemma":[0.00004076092,0.0004857953,0.000145312,0.0008025676,0.0000325312,0.0009172771,0.0002479091,0.000177493,0.00008736402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000735303,"about_ca_system_score_gemma":0.0001563896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001745978,"about_ca_topic_score_gemma":0.0005178219,"domain_scores_codex":[0.9961952,0.000241063,0.001175629,0.001137214,0.000533672,0.0007172137],"domain_scores_gemma":[0.9977877,0.0001262377,0.0006795338,0.0007619404,0.0003393889,0.0003052208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002547932,0.01048705,0.04166197,0.01967547,0.002646079,0.0003117495,0.05894387,0.2549711,0.05933513,0.4725707,0.001509106,0.077633],"study_design_scores_gemma":[0.006149777,0.00008862816,0.01627544,0.0007839164,0.00004895991,0.00003790654,0.001168466,0.9718735,0.0002343881,0.00003828816,0.002733422,0.000567294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0899353,0.0006694242,0.9020802,0.0001634834,0.001148546,0.005497814,0.00007470397,0.00037469,0.00005577504],"genre_scores_gemma":[0.927121,0.00004493963,0.07007895,0.0001713674,0.0001499809,0.002212272,0.00003320794,0.00005469919,0.0001335197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8371857,"threshold_uncertainty_score":0.9997594,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165274745","doi":"10.1109/aamas.2004.188","title":"Multiagent Planning as Control Synthesis","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Distributed computing; Multi-agent system; Event (particle physics); Control (management); Relation (database); Constraint (computer-aided design); Simple (philosophy); Software; Supervisory control; Artificial intelligence; Engineering; Data mining; Programming language","authors":[{"name":"Kiam-Tian Seow","is_ca":false},{"name":"Chuan Ma","is_ca":true},{"name":"Makoto Yokoo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07099639763208417,"gpt":0.2985471640996341,"spread":0.22755076646755,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007512894,0.0004691849,0.0006141269,0.0002637675,0.0004444717,0.000407201,0.0009695783,0.00018039,0.000009535928],"category_scores_gemma":[0.0001657051,0.0004154202,0.0001406103,0.0003209032,0.00007457921,0.0006775871,0.0003455136,0.0002155661,0.0002471623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002635157,"about_ca_system_score_gemma":0.0001048454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00123932,"about_ca_topic_score_gemma":0.00000856383,"domain_scores_codex":[0.9964989,0.0002797328,0.0007288306,0.001029599,0.0007228869,0.0007400169],"domain_scores_gemma":[0.9980205,0.0002160766,0.0003720123,0.0007995061,0.0001833897,0.0004085372],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003236353,0.002526707,0.02653537,0.0007642829,0.003485417,0.004140807,0.03464624,0.820695,0.006255048,0.05714758,0.002721347,0.04075856],"study_design_scores_gemma":[0.005394722,0.0002081077,0.007416565,0.001105098,0.00008923578,0.0002629973,0.001345321,0.9771374,0.0005134931,0.0001169417,0.005425885,0.0009841772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1180322,0.002459551,0.8747199,0.0001289644,0.001886986,0.001176152,0.00003431535,0.0003137999,0.001248159],"genre_scores_gemma":[0.9873607,0.00007423817,0.01133358,0.0003704159,0.0001535557,0.0002142909,0.000002495362,0.00004421813,0.0004464729],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8693286,"threshold_uncertainty_score":0.9998298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1555338578","doi":"10.5555/1838206.1838401","title":"Using bisimulation for policy transfer in MDPs","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Markov decision process; Computer science; Bisimulation; Artificial intelligence; Markov process; Work (physics); Theoretical computer science; Mathematics","authors":[{"name":"Pablo Samuel Castro","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1285799627275599,"gpt":0.3554582096881,"spread":0.2268782469605402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003589092,0.00019336,0.0002271718,0.0002670496,0.0001581891,0.0001818818,0.0003343244,0.0001205586,0.000002545551],"category_scores_gemma":[0.00006086274,0.0001790246,0.00005731546,0.0002719289,0.00004286201,0.000473701,0.00008850333,0.0001677586,0.000008193044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007082217,"about_ca_system_score_gemma":0.00006606551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00110339,"about_ca_topic_score_gemma":0.0000551378,"domain_scores_codex":[0.9985343,0.00007165417,0.0003829431,0.000400286,0.0002406153,0.0003702175],"domain_scores_gemma":[0.9992909,0.00008075221,0.00009036305,0.0003181046,0.0001035865,0.0001162718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003427463,0.0001816662,0.02503603,0.0001424466,0.0001134289,0.00001706311,0.004427384,0.9009987,0.00936086,0.05498131,0.00009625358,0.004610579],"study_design_scores_gemma":[0.001419381,0.00007965182,0.01204898,0.00005056735,0.000008773159,0.000005859238,0.00005800115,0.9837282,0.0001253144,0.00002831322,0.002246993,0.0001999363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1618139,0.00002626436,0.8362215,0.00004938491,0.0008022456,0.0008798485,0.000006339263,0.0000451384,0.0001553874],"genre_scores_gemma":[0.9801678,0.00001168891,0.01909513,0.00009867714,0.0001235239,0.00003271797,0.000005768107,0.00002053577,0.0004441455],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8183539,"threshold_uncertainty_score":0.7300411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2494900181","doi":"10.5555/2936924.2936947","title":"Strategy-Proofness in the Stable Matching Problem with Couples","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Matching (statistics); Complementarity (molecular biology); Stable marriage problem; Preference; Set (abstract data type); Computer science; Mathematical economics; Pareto principle; Stability (learning theory); Economics; Microeconomics; Mathematical optimization; Mathematics; Statistics","authors":[{"name":"Andrew Perrault","is_ca":true},{"name":"Joanna Drummond","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08909092805595974,"gpt":0.2513758493690016,"spread":0.1622849213130419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609966,0.0002536167,0.0004504028,0.000129839,0.0001942959,0.0001822152,0.0003112181,0.00008959535,0.00004144051],"category_scores_gemma":[0.0000197066,0.0001457206,0.00004638482,0.0001810892,0.00008806914,0.0003490193,0.00005332833,0.0001236218,0.000139649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006897611,"about_ca_system_score_gemma":0.00001694997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00211307,"about_ca_topic_score_gemma":0.0001923962,"domain_scores_codex":[0.9981834,0.0001424258,0.0006215633,0.0005189613,0.0000923764,0.0004413034],"domain_scores_gemma":[0.9990079,0.0001214632,0.0004143532,0.0003364302,0.00003953333,0.00008031578],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.000250447,0.000775795,0.4081325,0.0005355697,0.0004757508,0.0001241179,0.01363782,0.001896329,0.0002800459,0.5697916,0.0008011279,0.003298856],"study_design_scores_gemma":[0.02439022,0.002063346,0.7553023,0.005672586,0.0001256762,0.0003354585,0.050954,0.0375052,0.0001341017,0.02520701,0.09402546,0.004284639],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.975434,0.002114363,0.01285863,0.0001409171,0.0003512111,0.001481865,0.0002049624,0.00004877733,0.007365245],"genre_scores_gemma":[0.9955309,0.0001142014,0.0001400474,0.00006591947,0.00007188257,0.0001551099,0.000004977613,0.00003370984,0.003883259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5445846,"threshold_uncertainty_score":0.5942312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295665692","doi":"10.5555/2034396.2034406","title":"Efficient planning in R-max","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Computer science; Mathematical optimization; Markov decision process; Value (mathematics); Artificial intelligence; Algorithm; Machine learning; Mathematics; Markov process","authors":[{"name":"Marek Grześ","is_ca":true},{"name":"Jesse Hoey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1242030640907431,"gpt":0.2922210493630056,"spread":0.1680179852722625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000422518,0.0002346339,0.0002696829,0.0002077403,0.0001380108,0.000114042,0.0005529722,0.00008858023,0.00001162173],"category_scores_gemma":[0.00003259089,0.0002087858,0.00004602688,0.0002605201,0.00005130504,0.0001791261,0.0003597204,0.0001831429,0.00009271448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007863747,"about_ca_system_score_gemma":0.00002743268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005488077,"about_ca_topic_score_gemma":0.000003993842,"domain_scores_codex":[0.9981008,0.0001423727,0.0004327447,0.000508761,0.0003472177,0.0004681678],"domain_scores_gemma":[0.9991097,0.00004626529,0.0002006228,0.0004206666,0.00006413563,0.0001586307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000303231,0.0003485225,0.09871728,0.00008848376,0.0001419465,0.0004054215,0.02814539,0.8585681,0.0001266363,0.01105008,0.0006090404,0.001768763],"study_design_scores_gemma":[0.0008460768,0.0001054863,0.0825232,0.0001589551,0.000006765047,0.00001216061,0.0006013604,0.9145647,0.00003155422,0.000005588693,0.0009060698,0.0002381151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1227022,0.0004130622,0.8687607,0.00001131772,0.001201179,0.0006809322,0.000002480599,0.0001216693,0.006106424],"genre_scores_gemma":[0.9890969,0.00001631232,0.009579816,0.00009156671,0.00002860669,0.00003332719,0.000001919376,0.00001770074,0.001133824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8663947,"threshold_uncertainty_score":0.8514036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2182474583","doi":"10.5555/2772879.2772886","title":"Decision-theoretic Clustering of Strategies","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Gambling Behavior and Treatments","field":"Psychology","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Cluster analysis; Computer science; Constrained clustering; Greedy algorithm; Metric (unit); Correlation clustering; Mathematical optimization; Artificial intelligence; Machine learning; Data mining; Mathematics; CURE data clustering algorithm; Algorithm","authors":[{"name":"Nolan Bard","is_ca":true},{"name":"Deon Nicholas","is_ca":true},{"name":"Csaba Szepesvaári","is_ca":true},{"name":"Michael Bowling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2497690893926628,"gpt":0.4187938455534094,"spread":0.1690247561607466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003052258,0.0002500716,0.0003762729,0.0001382105,0.00007924324,0.00006624263,0.0001784037,0.000129753,0.00009851574],"category_scores_gemma":[0.00002372754,0.0002021617,0.00007431849,0.0001239179,0.0001234894,0.0001434367,0.0001022823,0.00009607287,0.0001445864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004964239,"about_ca_system_score_gemma":0.00003627096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001690857,"about_ca_topic_score_gemma":0.00004282189,"domain_scores_codex":[0.9983475,0.0001585148,0.0004439068,0.0004145792,0.0003071824,0.0003283852],"domain_scores_gemma":[0.9989501,0.0000716053,0.0002048819,0.0003746618,0.0001599498,0.0002387743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.003077884,0.008695107,0.7264142,0.0004716302,0.004259768,0.002006987,0.09682046,0.004961812,0.0009181739,0.0499132,0.01302709,0.08943368],"study_design_scores_gemma":[0.02703971,0.002632313,0.8351437,0.000983245,0.0008656881,0.0003378243,0.09111179,0.03094052,0.0001245508,0.0009443609,0.008310519,0.001565759],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9715986,0.001286075,0.01675742,0.000006318851,0.00272226,0.0006820042,0.00007204599,0.00005734626,0.006817918],"genre_scores_gemma":[0.9966406,0.00003143542,0.001091514,0.00001673115,0.00004807918,0.00006616468,0.00001321296,0.00003526009,0.002056957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1087295,"threshold_uncertainty_score":0.8243915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406623448","doi":"10.5555/2615731.2616087","title":"Policy optimization by marginal-map probabilistic inference in generative models","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially observable Markov decision process; Inference; Computer science; Mathematical optimization; Generative model; Bounded function; Benchmark (surveying); Probabilistic logic; Machine learning; Artificial intelligence; Algorithm; Mathematics; Generative grammar; Markov model; Markov chain","authors":[{"name":"Igor Kiselev","is_ca":true},{"name":"Pascal Poupart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03596804359116691,"gpt":0.2878306369712302,"spread":0.2518625933800633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365471,0.0002701982,0.0003154947,0.0001894682,0.0001794698,0.0002503299,0.0004250907,0.00009178725,0.000005002717],"category_scores_gemma":[0.0001400624,0.0002331631,0.00003741258,0.0003124257,0.00005575934,0.0005186242,0.0002187804,0.0001881699,0.00001789557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008824976,"about_ca_system_score_gemma":0.00005898947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001901074,"about_ca_topic_score_gemma":0.00002375159,"domain_scores_codex":[0.9978576,0.0004472027,0.0003695677,0.0006364839,0.0002973771,0.0003918054],"domain_scores_gemma":[0.9990417,0.0001202265,0.0001927187,0.0003509352,0.0001212966,0.0001730989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005898322,0.0001474871,0.0009283916,0.00004447163,0.00002544766,0.000005727647,0.001490386,0.9716963,0.00002749147,0.02017974,0.0002979081,0.005150808],"study_design_scores_gemma":[0.0008691485,0.0001152213,0.0008838316,0.00009517078,0.000005503269,0.000003147766,0.00006257046,0.9965168,0.000006108496,0.000344099,0.0008332927,0.0002651038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004409754,0.0002042871,0.9935559,0.000252152,0.0003250711,0.0005507965,0.00001635414,0.00008184145,0.0006038528],"genre_scores_gemma":[0.9679099,0.00006610774,0.02979838,0.000215262,0.0001037709,0.00009281952,0.00002350684,0.00001895733,0.001771283],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9637575,"threshold_uncertainty_score":0.9508114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105888928","doi":"10.5555/2343896.2344007","title":"Detecting and identifying coalitions","year":2012,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer security; Population; Risk analysis (engineering); Business","authors":[{"name":"Reid Kerr","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3996401673442485,"gpt":0.4423090878843384,"spread":0.04266892054008997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002122323,0.000169553,0.0002526758,0.0001474619,0.0006541705,0.0003034175,0.0002215593,0.00007173748,0.00008816607],"category_scores_gemma":[0.0003662678,0.0001317576,0.00005480567,0.0002748553,0.000124689,0.0005681558,0.000198749,0.0001171446,0.0002660062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002336527,"about_ca_system_score_gemma":0.000009829195,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001847073,"about_ca_topic_score_gemma":0.00001703773,"domain_scores_codex":[0.9979551,0.0003278802,0.0004940006,0.0003999823,0.0004532639,0.0003697489],"domain_scores_gemma":[0.9984736,0.0004987443,0.0002478512,0.0003432373,0.0001368217,0.000299696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001252159,0.00157,0.6248916,0.0001795826,0.0007303432,0.00003265473,0.05206383,0.0003618299,0.01690736,0.1730469,0.009824811,0.1202659],"study_design_scores_gemma":[0.002619103,0.0001205906,0.790402,0.0002590916,0.0001978567,0.0002208379,0.06607859,0.03896363,0.0007384875,0.005490775,0.09380262,0.001106436],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9504225,0.001417016,0.04447325,0.00006422732,0.0006872566,0.0005837023,0.00006517047,0.0000543071,0.002232512],"genre_scores_gemma":[0.9955357,0.00004920459,0.0007338856,0.00009727835,0.0001361825,0.00007553087,0.000003585982,0.0000148788,0.003353754],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1675561,"threshold_uncertainty_score":0.5372917,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111063504","doi":"10.1109/aamas.2004.142","title":"Improving Modeling of Other Agents Using Stereotypes and Compactification of Observations","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Stereotype (UML); Compactification (mathematics); Computer science; k-nearest neighbors algorithm; Artificial intelligence; Econometrics; Mathematics","authors":[{"name":"Jörg Denzinger","is_ca":true},{"name":"Jasmine Hamdan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1938495909650498,"gpt":0.3111745553459577,"spread":0.1173249643809078,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003941456,0.0002247173,0.0003876573,0.0001894201,0.0001836594,0.00008710937,0.00026201,0.00009801951,0.000002427306],"category_scores_gemma":[0.00003165324,0.0002045444,0.00006318818,0.000228776,0.00005330813,0.0007013766,0.0001439153,0.00007825687,0.00000215461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007837111,"about_ca_system_score_gemma":0.00005405749,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007487637,"about_ca_topic_score_gemma":0.00004825767,"domain_scores_codex":[0.998106,0.0001244257,0.0007214188,0.0004621979,0.0003462944,0.0002396776],"domain_scores_gemma":[0.998525,0.0000368139,0.0006654218,0.0003976021,0.0002591686,0.0001159979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001401078,0.002108406,0.1365089,0.002241293,0.001302141,0.00001883785,0.03893381,0.5485894,0.2190602,0.03947184,0.00007629338,0.01154886],"study_design_scores_gemma":[0.001219272,0.00006029095,0.02443042,0.0003215996,0.00003673674,0.000006653915,0.0005923811,0.9723502,0.000724205,0.00002899178,0.0000376305,0.0001916304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5357512,0.0003252101,0.4630939,0.00001341506,0.0002684948,0.0004803244,0.00002355061,0.00002224781,0.00002166819],"genre_scores_gemma":[0.9783913,0.00003807652,0.02140405,0.00002963223,0.0000357192,0.00001487836,0.000006741761,0.00002068813,0.00005894569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4426401,"threshold_uncertainty_score":0.9991216,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W145585440","doi":"10.5555/2484920.2485185","title":"Model based approach to detect emergent behavior in multi-agent systems","year":2013,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Calgary","funders":"","keywords":"Agent-oriented software engineering; Computer science; Unified Modeling Language; Sequence diagram; Software engineering; Software deployment; Multi-agent system; Software; Software development; Systems engineering; Artificial intelligence; Engineering","authors":[{"name":"Mohammad Moshirpour","is_ca":true},{"name":"Nariman Mani","is_ca":true},{"name":"Armin Eberlein","is_ca":false},{"name":"Behrouz H. Far","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1820800483831218,"gpt":0.3285164316386605,"spread":0.1464363832555388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007690073,0.0005765939,0.0006914908,0.0004546794,0.0001728758,0.0002693442,0.001016122,0.0002013457,0.000003383258],"category_scores_gemma":[0.0002010369,0.0005153036,0.0001198839,0.0005257977,0.00005149129,0.0006245443,0.0005102578,0.0002890266,0.00008312963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002957824,"about_ca_system_score_gemma":0.00005844996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001335435,"about_ca_topic_score_gemma":0.00001605777,"domain_scores_codex":[0.9960795,0.0004403637,0.0008158744,0.001216671,0.0005584555,0.000889154],"domain_scores_gemma":[0.9979503,0.0001651946,0.0002252213,0.000962309,0.0002169346,0.0004800956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009368571,0.0003503178,0.00164402,0.0001223859,0.00004932367,0.00002672476,0.0009139729,0.9910446,0.001379604,0.0003183563,0.0002940915,0.003847189],"study_design_scores_gemma":[0.001177567,0.000110128,0.01693385,0.0001240315,0.0000186812,0.00001119157,0.0003406637,0.9803486,0.0001043998,0.00001150477,0.0002255876,0.0005938289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03538429,0.0009465194,0.9583864,0.00001813753,0.001370559,0.003452992,0.00002750339,0.000363463,0.00005011879],"genre_scores_gemma":[0.5833144,0.00003416944,0.4141683,0.00007526844,0.00002444198,0.001812827,0.00000536127,0.00004396136,0.0005213135],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5479301,"threshold_uncertainty_score":0.9997299,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2620853660","doi":"10.5555/3091125.3091207","title":"Forward Actor-Critic for Nonlinear Function Approximation in Reinforcement Learning","year":2017,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Bellman equation; Function approximation; Nonlinear system; Function (biology); Class (philosophy); Artificial intelligence; Temporal difference learning; Mathematical optimization; Machine learning; Artificial neural network; Mathematics","authors":[{"name":"Vivek Veeriah","is_ca":true},{"name":"Harm van Seijen","is_ca":true},{"name":"Richard S. Sutton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07223075096191683,"gpt":0.309418597286914,"spread":0.2371878463249972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006936602,0.0002544191,0.0003079817,0.0001641078,0.0007158094,0.0007739886,0.0005820224,0.0001180466,0.000004181938],"category_scores_gemma":[0.0002332062,0.0002410812,0.00006871614,0.00007773365,0.00005591044,0.001365982,0.0003209945,0.000200038,0.00002851236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001364622,"about_ca_system_score_gemma":0.00003919481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002303363,"about_ca_topic_score_gemma":0.00001289189,"domain_scores_codex":[0.9980228,0.00009896817,0.0005160042,0.0005155409,0.0003923136,0.0004543734],"domain_scores_gemma":[0.998518,0.00007976295,0.0004985808,0.0006020628,0.000173859,0.0001277722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001343552,0.0001696242,0.01879159,0.0005424324,0.0002547882,0.00001923575,0.003381806,0.9513159,0.0005697796,0.01077828,0.0004754629,0.01356674],"study_design_scores_gemma":[0.002114725,0.0003722293,0.01187954,0.0002672307,0.00002202149,0.000002869716,0.0003278439,0.9791633,0.00005173621,0.00001977584,0.005518189,0.0002605273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01229442,0.00008575003,0.9839391,0.00006000205,0.001187937,0.001753775,0.000002672321,0.00007801624,0.0005983266],"genre_scores_gemma":[0.9859113,0.00007322879,0.01103823,0.00006920133,0.0001131222,0.000227079,0.00003295676,0.00002487665,0.002510067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9736168,"threshold_uncertainty_score":0.9831004,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102177865","doi":"10.5555/1838206.1838528","title":"Coalition detection and identification","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Experimental Behavioral Economics Studies","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Identification (biology); Computer science; Population; Internet privacy; Public relations; Data science; Computer security; Knowledge management; Political science; Sociology","authors":[{"name":"Reid Kerr","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07904217333949029,"gpt":0.3523602975403669,"spread":0.2733181242008766,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000399102,0.0001087818,0.0001329537,0.00005500207,0.000706804,0.0001579823,0.000068622,0.00009286345,0.00001867135],"category_scores_gemma":[0.00003424103,0.0001103868,0.00002451483,0.00005674735,0.0002248121,0.0003242287,0.0000529229,0.00009464508,0.00003225717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006496662,"about_ca_system_score_gemma":0.00001274978,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01089158,"about_ca_topic_score_gemma":0.004504797,"domain_scores_codex":[0.9990813,0.00009810101,0.0002172861,0.000282191,0.0001354463,0.0001856542],"domain_scores_gemma":[0.9995483,0.00002522317,0.0001371879,0.0001022931,0.00007250273,0.0001145163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0001400767,0.001009939,0.2937653,0.000128715,0.000400239,0.00002257511,0.1153914,0.00001701803,0.4706861,0.06304174,0.001489116,0.05390782],"study_design_scores_gemma":[0.003120962,0.0002410321,0.7952189,0.00009915631,0.0001732588,0.00001846529,0.1150179,0.01253355,0.006828848,0.0004005634,0.06517117,0.001176192],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9951602,0.0002477203,0.0004545022,0.00006569707,0.001497946,0.0006135244,0.00002269928,0.0000481829,0.001889567],"genre_scores_gemma":[0.9979718,0.0002624255,0.0001175675,0.00002992503,0.0001197133,0.0000854741,0.00000555297,0.00001085758,0.001396622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5014536,"threshold_uncertainty_score":0.995695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2220059168","doi":"10.5555/2772879.2773464","title":"Voting with Social Influence: Using Arguments to Uncover Ground Truth","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ground truth; Voting; Estimator; Computer science; Social network (sociolinguistics); Class (philosophy); Social choice theory; Artificial intelligence; Mathematical economics; Mathematics; Social media; Political science; Statistics; Law","authors":[{"name":"Alan Tsang","is_ca":true},{"name":"John A. Doucette","is_ca":true},{"name":"Hadi Hosseini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08594709231979451,"gpt":0.3299775380734479,"spread":0.2440304457536534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002478187,0.0002881452,0.0003487731,0.00007342859,0.000399867,0.0002439566,0.0001679911,0.00006720088,0.0000130057],"category_scores_gemma":[0.00001012462,0.0002479243,0.00005878911,0.0002138726,0.00007375494,0.0003550998,0.0001391437,0.0001410897,0.00003268212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001303201,"about_ca_system_score_gemma":0.00009727743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005271079,"about_ca_topic_score_gemma":0.00001665007,"domain_scores_codex":[0.9982784,0.0001010127,0.0003435845,0.0004371901,0.0004015943,0.000438202],"domain_scores_gemma":[0.9990162,0.00002316062,0.0002310227,0.0001384126,0.0002607664,0.0003303853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002698939,0.0007955443,0.8820356,0.00009227993,0.001289886,0.00003984441,0.02425438,0.03351666,0.0003590799,0.05265523,0.0008688393,0.003822761],"study_design_scores_gemma":[0.01557302,0.001029091,0.5192851,0.001050968,0.0004289277,0.00001637794,0.05276468,0.388215,0.00006407481,0.0007810154,0.01726088,0.003530834],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9853276,0.00003312289,0.01252412,0.00001776482,0.0006099879,0.0005976231,0.0001115038,0.00002501065,0.0007532783],"genre_scores_gemma":[0.9981357,9.481251e-7,0.000723032,0.0001165081,0.0003112217,0.00003873241,0.0000197962,0.00003653247,0.0006174579],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3627505,"threshold_uncertainty_score":0.9999973,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157501503","doi":"10.5555/1402795.1402817","title":"Cooperative search for optimizing pipeline operations","year":2008,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"TransCanada (Canada); University of Calgary","funders":"","keywords":"Computer science; Pipeline (software); State (computer science); Beam search; Search and rescue; Search algorithm; Energy (signal processing); Mathematical optimization; Distributed computing; Artificial intelligence; Algorithm","authors":[{"name":"T. Mora","is_ca":true},{"name":"A.B. Sesay","is_ca":true},{"name":"Jörg Denzinger","is_ca":true},{"name":"H. Golshan","is_ca":true},{"name":"G. Poissant","is_ca":true},{"name":"C. Konecnik","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3490364379878854,"gpt":0.4289179732325101,"spread":0.07988153524462477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001250145,0.0002069194,0.0003428994,0.0001728977,0.001534166,0.0002024267,0.0003572441,0.00008827059,0.0001501959],"category_scores_gemma":[0.0002927568,0.0001544751,0.00009946946,0.0004088395,0.0002271574,0.0004209521,0.0001193979,0.0001248729,0.0002574756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004249494,"about_ca_system_score_gemma":0.0000774721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001597962,"about_ca_topic_score_gemma":0.00002158289,"domain_scores_codex":[0.9975265,0.0003106079,0.0006658055,0.0006462569,0.0005427438,0.0003081004],"domain_scores_gemma":[0.997942,0.0004511283,0.000125283,0.0004077547,0.0008517957,0.0002220922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007150426,0.002969438,0.01154907,0.0000731464,0.0008428047,0.00008167937,0.0479542,0.5457987,0.009089498,0.2132105,0.1433855,0.02433042],"study_design_scores_gemma":[0.002392427,0.0001901693,0.003297498,0.00003911234,0.00003606915,0.00007972788,0.01354332,0.9097008,0.001114095,0.0001338896,0.06903137,0.0004415314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.136226,0.0003237987,0.8589824,0.0003052556,0.00052372,0.001827035,0.0003118462,0.00005750186,0.001442469],"genre_scores_gemma":[0.9609297,0.0001113806,0.005957823,0.0002250715,0.0001790487,0.0003444155,0.00003356839,0.0000212681,0.03219772],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8530245,"threshold_uncertainty_score":0.9997657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293023860","doi":"10.5555/2772879.2773541","title":"Emotional Interactions between Artificial Companion Agents and the Elderly","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Innovative Human-Technology Interaction","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Economic shortage; Bridge (graph theory); Population; Psychology; Computer science; Applied psychology; Artificial intelligence; Medicine; Environmental health","authors":[{"name":"Xinjia Yu","is_ca":false},{"name":"Charles T. Salmon","is_ca":false},{"name":"Cyril Leung","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1652682457520546,"gpt":0.3399170186184293,"spread":0.1746487728663747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006996644,0.0002782473,0.0003566718,0.0002426227,0.0004963218,0.0003316579,0.0004720183,0.0001203946,0.0000131103],"category_scores_gemma":[0.00009519628,0.0002076492,0.00006210778,0.0003048179,0.0003053152,0.0008404691,0.0003983702,0.0003778445,0.0001197059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001429606,"about_ca_system_score_gemma":0.00004380568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005232437,"about_ca_topic_score_gemma":0.00004717963,"domain_scores_codex":[0.9977413,0.000398775,0.0005422517,0.0005680728,0.0004128813,0.0003366594],"domain_scores_gemma":[0.9985271,0.0001560731,0.0003694831,0.0003996408,0.0004050606,0.00014269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000582408,0.001855706,0.09974833,0.0001721078,0.003296064,0.0001921102,0.03488619,0.0008912756,0.001143954,0.6735969,0.06477278,0.1188622],"study_design_scores_gemma":[0.009979378,0.0009283851,0.2720461,0.0004727491,0.0001844224,0.0003445198,0.007724768,0.6409013,0.0003588635,0.004676557,0.06117507,0.001207818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6786213,0.0001748985,0.3137236,0.001374626,0.003422994,0.001199004,0.00004369142,0.0002037257,0.001236153],"genre_scores_gemma":[0.9970963,0.0000149454,0.001385043,0.0001899692,0.0002426587,0.00007236315,0.00002539457,0.00001758607,0.0009557405],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6689203,"threshold_uncertainty_score":0.8467687,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2407630320","doi":"10.5555/2615731.2617513","title":"Distributed multiagent resource allocation with adaptive preemption for dynamic tasks","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Preemption; Computer science; Distributed computing; Resource allocation; Task (project management); Multi-agent system; Resource (disambiguation); Resource management (computing); Computer network; Artificial intelligence; Engineering; Operating system","authors":[{"name":"Graham Pinhey","is_ca":true},{"name":"John A. Doucette","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03835147418583962,"gpt":0.2688820053874795,"spread":0.2305305312016399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008662071,0.000505886,0.0005296962,0.0002026986,0.0005203412,0.000302955,0.0005605409,0.0002109262,0.000004650448],"category_scores_gemma":[0.0000715199,0.0004137701,0.0001218323,0.0003030443,0.00008099747,0.0007170703,0.0001799856,0.0001667487,0.00003562266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002398752,"about_ca_system_score_gemma":0.00004797607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005601576,"about_ca_topic_score_gemma":0.0001445523,"domain_scores_codex":[0.9964766,0.0004371759,0.0007026116,0.001154393,0.0006053668,0.0006238372],"domain_scores_gemma":[0.9977056,0.0001935715,0.0006637858,0.0007676881,0.0003545794,0.0003147583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005414161,0.01182908,0.0616479,0.005330591,0.008902498,0.0002026795,0.06935686,0.240994,0.03157808,0.2129226,0.04053932,0.3112823],"study_design_scores_gemma":[0.003438699,0.0006223289,0.03719857,0.0002728656,0.00006992859,0.0000196614,0.0005828123,0.9423602,0.0001280236,0.00002291541,0.01474712,0.00053685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04585321,0.000271672,0.9495759,0.000140209,0.0006371316,0.003036507,0.000151512,0.0002131675,0.0001206629],"genre_scores_gemma":[0.9828615,0.00003679658,0.01496086,0.000131377,0.0001295352,0.0005948376,0.0002776383,0.00005309463,0.0009543819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9370083,"threshold_uncertainty_score":0.9998314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3022125085","doi":"10.5555/2615731.2615757","title":"Progression and verification of situation calculus agents with bounded beliefs","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Situation calculus; Decidability; Bounded function; Action (physics); Computer science; Domain (mathematical analysis); Object (grammar); Temporal logic; Belief revision; Calculus (dental); Order (exchange); Mathematics; Theoretical computer science; Discrete mathematics; Artificial intelligence","authors":[{"name":"Giuseppe De Giacomo","is_ca":false},{"name":"Yves Lespérance","is_ca":true},{"name":"Fabio Patrizi","is_ca":false},{"name":"Stavros Vassos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03857713149392297,"gpt":0.2800804080179356,"spread":0.2415032765240126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004533756,0.0002263414,0.0002993328,0.0001004185,0.0002505544,0.0001504921,0.0002696196,0.0001011853,0.000003756439],"category_scores_gemma":[0.00004767858,0.000164208,0.00003500604,0.0001899371,0.0001102457,0.0003984198,0.0001577549,0.00008361433,0.00001390415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004460428,"about_ca_system_score_gemma":0.00003442798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002265982,"about_ca_topic_score_gemma":0.00003290328,"domain_scores_codex":[0.9982525,0.0002150023,0.0003308108,0.0005484571,0.0003812154,0.0002719769],"domain_scores_gemma":[0.9988298,0.00004948665,0.0003531992,0.000379319,0.0002186584,0.0001695536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006178922,0.004603171,0.2080965,0.002037425,0.001458269,0.0001003271,0.08109641,0.0007092004,0.01494788,0.2482328,0.004609274,0.4334908],"study_design_scores_gemma":[0.003114433,0.0007811298,0.2833094,0.0004298146,0.00005661149,0.00002877957,0.0003806209,0.7053881,0.0008885398,0.0001096808,0.00507032,0.0004425548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4300418,0.0008761049,0.5648608,0.00005149825,0.0005786489,0.001205269,0.000009025382,0.0001046298,0.002272253],"genre_scores_gemma":[0.9942533,0.00009449042,0.004965886,0.00003938199,0.00005767642,0.00005596008,0.00001409473,0.00001507086,0.0005041866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.704679,"threshold_uncertainty_score":0.6696209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058345792","doi":"10.1109/aamas.2004.192","title":"Negotiating Gestalt: Artistic Expression and Coalition Formation in Multiagent Systems","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Slime Mold and Myxomycetes Research","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Negotiation; Gestalt psychology; Expression (computer science); Painting; Representation (politics); Computer science; Control (management); Space (punctuation); Human–computer interaction; Autonomous agent; Artificial intelligence; Art; Visual arts; Sociology; Epistemology; Political science; Politics; Programming language","authors":[{"name":"Kaye Mason","is_ca":true},{"name":"Jörg Denzinger","is_ca":true},{"name":"Sheelagh Carpendale","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05349610606819741,"gpt":0.2763378046049061,"spread":0.2228416985367087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002804241,0.0002609949,0.0003070823,0.0002078579,0.0001581685,0.0001966812,0.00009180565,0.0001326817,0.00000531253],"category_scores_gemma":[0.00004288054,0.0002396063,0.00003054856,0.0001391441,0.00003993656,0.0004542508,0.00007791572,0.0001961197,0.00002471282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002359085,"about_ca_system_score_gemma":0.00001182801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001331751,"about_ca_topic_score_gemma":0.0000393099,"domain_scores_codex":[0.9982734,0.0001203742,0.0004963417,0.0003202298,0.0003298318,0.0004598645],"domain_scores_gemma":[0.9993919,0.00006341085,0.00009262138,0.0001806732,0.0000680841,0.0002033086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001131609,0.0004912483,0.02942448,0.003352044,0.0002403017,0.0004538973,0.01254676,0.8630063,0.08250289,0.001739321,0.001007639,0.005121969],"study_design_scores_gemma":[0.003273812,0.00009651033,0.04873573,0.001151702,0.00002158685,0.00006588682,0.004056801,0.9403732,0.0009163332,0.000008198643,0.0009197807,0.0003804756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9767935,0.004563914,0.01588796,0.000009564122,0.0007676737,0.001462229,0.00007545803,0.0001382417,0.0003014613],"genre_scores_gemma":[0.9983994,0.0007287853,0.0003524926,0.00001064573,0.00008756414,0.0001894904,0.00005196673,0.00004179226,0.0001378907],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08158655,"threshold_uncertainty_score":0.9770861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2288689989","doi":"10.5555/2615731.2616084","title":"Correlated multi-dimensional qos metrics for trust evaluation within web services","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Quality of service; Computer science; Reputation; Mobile QoS; Web service; Service (business); Latent Dirichlet allocation; Selection (genetic algorithm); Service provider; Dirichlet distribution; Task (project management); Computer network; Data mining; World Wide Web; Information retrieval; Topic model; Mathematics; Machine learning","authors":[{"name":"Mohamad Mehdi","is_ca":true},{"name":"Nizar Bouguila","is_ca":true},{"name":"Jamal Bentahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09265999085829293,"gpt":0.3506057261559008,"spread":0.2579457352976079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002529974,0.0002688474,0.000395723,0.0001915644,0.001021119,0.000220186,0.0002868526,0.000240463,0.00007436358],"category_scores_gemma":[0.0003658493,0.0002262325,0.0001039061,0.0003484559,0.0001360257,0.0004379286,0.00007755905,0.0001371793,0.00006447821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001398002,"about_ca_system_score_gemma":0.0001336311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005617313,"about_ca_topic_score_gemma":0.001645822,"domain_scores_codex":[0.9970036,0.0006216964,0.0005103886,0.0005472258,0.0008578405,0.0004592655],"domain_scores_gemma":[0.9980682,0.0002831234,0.0004479878,0.0002045577,0.0007209521,0.0002751529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002349995,0.006609926,0.5971323,0.001657357,0.006110269,0.00006162249,0.1223648,0.0463039,0.003195461,0.0759849,0.01560569,0.1226239],"study_design_scores_gemma":[0.004977126,0.00009960943,0.01871354,0.00009740044,0.0002139795,0.000001180953,0.004053582,0.9527754,0.000008866142,0.00003630115,0.01871735,0.000305712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9591774,0.002625778,0.01735034,0.0002499706,0.009017084,0.007138222,0.0002640922,0.0002566715,0.00392043],"genre_scores_gemma":[0.9947014,0.00005430279,0.001131202,0.000244526,0.0003896484,0.0002579555,0.00007281867,0.00003104686,0.003117064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9064714,"threshold_uncertainty_score":0.9225495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963606302","doi":"10.5555/2936924.2936943","title":"Budgetary Effects on Pricing Equilibrium in Online Markets","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Submodular set function; Budget constraint; Market clearing; Valuation (finance); Nash equilibrium; Microeconomics; Clearing; Economics; Mathematical economics; Uniqueness; Monotone polygon; Mathematical optimization; Mathematics","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Omer Lev","is_ca":true},{"name":"Tyrone Strangway","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1186784481878477,"gpt":0.3701668057351036,"spread":0.251488357547256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001425,0.0002331071,0.0003650427,0.0002907136,0.0001471273,0.00008706992,0.0003871729,0.0001001547,0.00009598412],"category_scores_gemma":[0.0005853157,0.0001369345,0.00007924107,0.0004024576,0.0000946385,0.0003265221,0.0001629881,0.0001135706,0.0004454003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007249576,"about_ca_system_score_gemma":0.00002314742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007753031,"about_ca_topic_score_gemma":0.00001947606,"domain_scores_codex":[0.9970942,0.0005778797,0.000644279,0.0007185144,0.0006220882,0.0003430003],"domain_scores_gemma":[0.9975103,0.001373602,0.0002870857,0.0005200929,0.000117938,0.0001910515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.001401373,0.003393308,0.2340787,0.0001727323,0.0004547153,0.0003291919,0.004099648,0.001127464,0.04469059,0.01900561,0.02633267,0.664914],"study_design_scores_gemma":[0.005346712,0.0003673423,0.915326,0.0008740133,0.00003852335,0.00003208108,0.002220732,0.02508329,0.001751207,0.002421549,0.04578923,0.0007493405],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9851564,0.0002439143,0.0109917,0.0004431116,0.0008550954,0.0009229877,0.00008751141,0.00004938567,0.001249914],"genre_scores_gemma":[0.99016,0.00004734593,0.0002252414,0.0003030025,0.0001486822,0.00007435762,0.000005079903,0.00001985811,0.009016408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6812473,"threshold_uncertainty_score":0.5724869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406539874","doi":"10.5555/2034396.2034454","title":"Smart walkers!: enhancing the mobility of the elderly","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Classifier (UML); Activity recognition; Discriminant; Sigmoid function; Intelligent sensor; Linear discriminant analysis; Artificial intelligence; Machine learning; Human–computer interaction; Random forest; Data mining; Wireless sensor network; Artificial neural network; Computer network","authors":[{"name":"Mathieu Sinn","is_ca":true},{"name":"Pascal Poupart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1021268820539132,"gpt":0.2676736844623603,"spread":0.1655468024084472,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100604,0.000252117,0.0003586443,0.00006281816,0.0003325331,0.0001008373,0.001016506,0.00009289398,0.00002224249],"category_scores_gemma":[0.00007959804,0.0001463268,0.0001611333,0.0003103716,0.0001768399,0.0004471965,0.0005088921,0.0001913296,0.00004137057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005790948,"about_ca_system_score_gemma":0.00006796909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004404151,"about_ca_topic_score_gemma":0.0003466515,"domain_scores_codex":[0.9974694,0.0006017905,0.0006016844,0.0005370192,0.0004497299,0.0003403804],"domain_scores_gemma":[0.9979431,0.000202289,0.0004625594,0.001014804,0.0002627945,0.0001144639],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0004134399,0.007693349,0.3046192,0.001760746,0.004803236,0.0001587741,0.2218477,0.000174134,0.03114328,0.02651284,0.01044965,0.3904237],"study_design_scores_gemma":[0.005031208,0.001176517,0.8070526,0.001408328,0.0002506669,0.0002459489,0.01466706,0.1275705,0.01858737,0.0004062777,0.02193561,0.001667909],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.770035,0.0006887199,0.2191021,0.0001400948,0.003542847,0.002710672,0.00004631692,0.0001278483,0.003606314],"genre_scores_gemma":[0.9982302,0.00001974832,0.000403037,0.00009918848,0.00004694924,0.0000984774,8.424716e-7,0.00001537874,0.001086177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5024334,"threshold_uncertainty_score":0.6657789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2620615090","doi":"10.5555/3091125.3091250","title":"Distant Truth: Bias Under Vote Distortion Costs","year":2017,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Voting; Computer science; Distortion (music); Outcome (game theory); Surprise; Set (abstract data type); Social choice theory; Econometrics; Mathematical economics; Mathematics; Social psychology; Bandwidth (computing); Psychology","authors":[{"name":"Svetlana Obraztsova","is_ca":false},{"name":"Omer Lev","is_ca":true},{"name":"Evangelos Markakis","is_ca":false},{"name":"Zinovi Rabinovich","is_ca":false},{"name":"Jeffrey S. Rosenschein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2011580398146823,"gpt":0.2977002488611463,"spread":0.09654220904646393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001113554,0.0003220468,0.0006259148,0.0001328922,0.0008588457,0.0004751385,0.0004158488,0.0001645373,0.00003991154],"category_scores_gemma":[0.000230842,0.0003152665,0.0001433592,0.00005818284,0.0001712829,0.0004430297,0.0001554332,0.0001641286,0.0004098916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002196455,"about_ca_system_score_gemma":0.00001232647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003698049,"about_ca_topic_score_gemma":0.0001311297,"domain_scores_codex":[0.9978011,0.0001022656,0.0008237092,0.0007205379,0.00009712136,0.0004552886],"domain_scores_gemma":[0.9976549,0.00007727305,0.001173064,0.0008098609,0.00005893334,0.0002259418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0001810282,0.0006177056,0.3878356,0.0002632208,0.0007880718,0.00007370565,0.002110547,0.0002744341,0.00009931234,0.6029382,0.002066298,0.002751922],"study_design_scores_gemma":[0.004729497,0.00028475,0.8801044,0.0005606143,0.00007006936,0.00003593859,0.001659356,0.04396747,0.00005752911,0.003246831,0.06392293,0.001360631],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9466056,0.002810593,0.02537896,0.0001318307,0.00784083,0.001124676,0.0006069264,0.0001069098,0.01539363],"genre_scores_gemma":[0.9907749,0.0001281577,0.00006813651,0.00006008065,0.0002356183,0.0000554714,0.00002785452,0.00004953613,0.0086002],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5996913,"threshold_uncertainty_score":0.99993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2273410534","doi":"10.5555/2615731.2617504","title":"Modeling agent trustworthiness with credibility for message recommendation in social networks","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Credibility; Computer science; Trustworthiness; Recommender system; Similarity (geometry); Source credibility; Multi-agent system; World Wide Web; Internet privacy; Artificial intelligence","authors":[{"name":"Noel Sardana","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09187409978039231,"gpt":0.3414822652082259,"spread":0.2496081654278336,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001687983,0.0002155087,0.0003854545,0.00008112032,0.0008904341,0.0001677715,0.0001835661,0.0001648902,0.00002307158],"category_scores_gemma":[0.00008905531,0.0001777187,0.00006656124,0.0001925538,0.0001048123,0.0003933033,0.00005413363,0.0001479108,0.000002334097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001312626,"about_ca_system_score_gemma":0.00004644402,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007671809,"about_ca_topic_score_gemma":0.005119307,"domain_scores_codex":[0.9978827,0.0004682997,0.0004107554,0.0004882497,0.000268602,0.0004814425],"domain_scores_gemma":[0.999228,0.0001236,0.0001880433,0.0001255753,0.0001907652,0.0001440201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002155486,0.001867543,0.2656843,0.0004170085,0.0008353165,0.00001953626,0.04761667,0.3515956,0.00001107196,0.0767497,0.001870414,0.2511773],"study_design_scores_gemma":[0.002567861,0.00006368012,0.01801403,0.00006299582,0.00004351215,3.852536e-7,0.003782027,0.9691888,2.913402e-7,0.00007376714,0.005955501,0.0002471345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3599719,0.000328812,0.6302819,0.0005400899,0.001278222,0.003143894,0.00006227739,0.0001132572,0.004279653],"genre_scores_gemma":[0.9982437,0.00008234686,0.000330489,0.0001352782,0.0005544193,0.0002578725,0.00004359204,0.0000213755,0.0003309165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6382718,"threshold_uncertainty_score":0.9989362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W136985510","doi":"10.5555/2034396.2034517","title":"Escaping local optima in POMDP planning as inference","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Inference; Partially observable Markov decision process; Local optimum; Reinforcement learning; Computer science; Mathematical optimization; Observable; Greedy algorithm; Artificial intelligence; Machine learning; Mathematics; Markov chain; Markov model","authors":[{"name":"Pascal Poupart","is_ca":true},{"name":"Tobias Lang","is_ca":false},{"name":"Marc Toussaint","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1458052012319216,"gpt":0.3207535313869368,"spread":0.1749483301550152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004280967,0.0002922819,0.000330724,0.000230624,0.000163234,0.0001825527,0.000709742,0.0001231148,0.00001990259],"category_scores_gemma":[0.00006657723,0.0002723748,0.00004996403,0.0002773002,0.00008966195,0.0006984895,0.0005076737,0.0002657892,0.0001401132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001034499,"about_ca_system_score_gemma":0.00005725723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00145943,"about_ca_topic_score_gemma":0.000008596812,"domain_scores_codex":[0.9977815,0.0001756274,0.0005130767,0.0005940566,0.0003895269,0.0005462286],"domain_scores_gemma":[0.9989308,0.00008626519,0.0002449965,0.0004497585,0.00009072117,0.0001974884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006434666,0.0003519422,0.1371648,0.000172008,0.0002686074,0.0008595563,0.04207514,0.7818159,0.0001561736,0.02546311,0.000440442,0.01116796],"study_design_scores_gemma":[0.0009258892,0.0001893018,0.04901441,0.0003496743,0.000008620755,0.00002189576,0.001382086,0.9471146,0.00006440315,0.0000286407,0.0005655186,0.000334947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03692525,0.0003475878,0.9556413,0.000009500646,0.0006961336,0.0004958632,0.000001530719,0.0001075585,0.005775293],"genre_scores_gemma":[0.9844389,0.00005264179,0.01444962,0.0001413584,0.00003129439,0.00003574352,0.000003146525,0.00002094336,0.0008263548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9475136,"threshold_uncertainty_score":0.9999728,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1900134344","doi":"10.5555/1838206.1838478","title":"Symbolic model checking for agent interactions","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Model checking; Computer science; Symbolic trajectory evaluation; Semantics (computer science); Computation tree logic; Protocol (science); Programming language; Theoretical computer science; Formal verification; Temporal logic; Modalities; Cryptographic protocol; Symbolic execution; Computer security; Software; Cryptography","authors":[{"name":"Mohamed El-Menshawy","is_ca":true},{"name":"Wei Wan","is_ca":true},{"name":"Jamal Bentahar","is_ca":true},{"name":"Rachida Dssouli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1435389464135784,"gpt":0.3691226349973471,"spread":0.2255836885837687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005853276,0.0002219401,0.0002397846,0.0001412495,0.000344479,0.0002354048,0.00055684,0.00009677074,0.000005010445],"category_scores_gemma":[0.0001068392,0.0002018848,0.00009025479,0.0001540432,0.00005343045,0.000722051,0.0002130936,0.0002243629,0.00002881381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005614302,"about_ca_system_score_gemma":0.00004002815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001262478,"about_ca_topic_score_gemma":0.00002314514,"domain_scores_codex":[0.9983861,0.00008310314,0.0003933463,0.0005426608,0.0002341059,0.0003606343],"domain_scores_gemma":[0.9987394,0.00006698974,0.0002411002,0.000574305,0.0001978175,0.0001803412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001216042,0.001751803,0.004577898,0.0004949637,0.0007514494,0.00002340788,0.02277964,0.0171125,0.0673995,0.7602586,0.00643498,0.1182937],"study_design_scores_gemma":[0.0005494265,0.00005138876,0.003162407,0.00004115466,0.00001868888,0.00001831616,0.0001690499,0.9849027,0.0006442966,0.0001755304,0.01003736,0.0002296242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06582937,0.00007114671,0.9291603,0.00005009939,0.003045302,0.0009644065,0.00002712022,0.0001207399,0.0007315142],"genre_scores_gemma":[0.6896264,0.00002024338,0.3085379,0.0001063008,0.0001014839,0.0002497817,0.000005998887,0.00001899,0.001332871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9677902,"threshold_uncertainty_score":0.8232622,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2257265444","doi":"10.5555/2034396.2034511","title":"SR-APL: a model for a programming language for rational BDI agents with prioritized goals","year":2011,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Deliberation; Computer science; Rationality; Declarative programming; Plan (archaeology); Programming language; Artificial intelligence; Knowledge management; Programming paradigm; Inductive programming; Epistemology","authors":[{"name":"Shakil M. Khan","is_ca":true},{"name":"Yves Lespérance","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1285531246108941,"gpt":0.310251174366983,"spread":0.1816980497560889,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006969917,0.0004544036,0.0005564601,0.0001878529,0.0004667052,0.0002799226,0.000537306,0.000166327,0.000009074235],"category_scores_gemma":[0.00005766905,0.0003675701,0.0001752819,0.0001994997,0.00005922715,0.0007872132,0.0001461803,0.0001033605,0.00001288573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001103826,"about_ca_system_score_gemma":0.0001191894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004122145,"about_ca_topic_score_gemma":0.0001274054,"domain_scores_codex":[0.996991,0.0001348143,0.0007046687,0.0009760159,0.0005014875,0.0006920138],"domain_scores_gemma":[0.9981552,0.00009588844,0.0005331693,0.0005203441,0.0004019229,0.0002934942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.006230535,0.01340606,0.05620624,0.008954667,0.009333673,0.0004650542,0.443296,0.01034797,0.01010382,0.2251776,0.03722167,0.1792566],"study_design_scores_gemma":[0.00589041,0.0003550752,0.004693174,0.0002453516,0.00008046829,0.00001990687,0.0009625597,0.9837708,0.0001233587,0.000049256,0.003275579,0.0005340631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03895651,0.000398918,0.953419,0.00004011502,0.0006227487,0.006057269,0.0001780734,0.0001820626,0.0001453569],"genre_scores_gemma":[0.8309045,0.00002315797,0.1639119,0.0001412763,0.0001411543,0.001926938,0.00007400636,0.00005728454,0.002819855],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9734228,"threshold_uncertainty_score":0.9998776,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2479077205","doi":"10.5555/2936924.2937144","title":"Convergence and Quality of Iterative Voting under Non-Scoring Rules: (Extended Abstract)","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Voting; Convergence (economics); Computer science; Quality (philosophy); Iterative method; Social choice theory; Anti-plurality voting; Cardinal voting systems; Mathematical optimization; Algorithm; Mathematical economics; Mathematics; Economics; Political science","authors":[{"name":"Aaron Koolyk","is_ca":false},{"name":"Omer Lev","is_ca":true},{"name":"Jeffrey S. Rosenschein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1481050922965997,"gpt":0.3044544472939487,"spread":0.1563493549973489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001465854,0.0002743673,0.000711976,0.0001436102,0.0001690375,0.00006775562,0.0001705846,0.0001262263,0.00006641935],"category_scores_gemma":[0.0001257244,0.0002249663,0.00009040811,0.00009103087,0.0001706583,0.0003665551,0.0001104029,0.0001024781,0.0001067616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006609747,"about_ca_system_score_gemma":0.00001258084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014411,"about_ca_topic_score_gemma":0.00002489602,"domain_scores_codex":[0.997694,0.0001021135,0.001139302,0.0006176564,0.00008629479,0.0003606738],"domain_scores_gemma":[0.998255,0.0002298912,0.0009989254,0.0002674978,0.00009221973,0.0001565319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001646856,0.0003812424,0.5187299,0.0008298827,0.0007809198,0.00001259493,0.00746577,0.0001061887,0.006329121,0.463316,0.0001114088,0.001772298],"study_design_scores_gemma":[0.003476592,0.0001759139,0.9817296,0.001023683,0.00002287359,0.00001024428,0.002996762,0.007148131,0.0005509977,0.001081962,0.001069151,0.0007141409],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9728614,0.001260374,0.02215601,0.00002362666,0.00082725,0.0005294886,0.0003278833,0.00002887776,0.001985101],"genre_scores_gemma":[0.9969792,0.0001845739,0.0002321813,0.00003635205,0.00008309442,0.00003118373,0.000004515056,0.00002909921,0.002419796],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4629997,"threshold_uncertainty_score":0.9173857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1584723732","doi":"10.5555/1838206.1838443","title":"Parameterizing the winner determination problem for combinatorial auctions","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorial auction; Parameterized complexity; Common value auction; Computer science; Bidding; Mathematical optimization; Leverage (statistics); Computational complexity theory; Theoretical computer science; Mathematics; Artificial intelligence; Algorithm; Economics","authors":[{"name":"David Loker","is_ca":true},{"name":"Kate Larson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.172506683914167,"gpt":0.4008345885727295,"spread":0.2283279046585625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018388,0.0001689637,0.0002163089,0.00008730882,0.001084827,0.0003724339,0.0004155589,0.0001120321,0.00004433092],"category_scores_gemma":[0.000442339,0.0001053398,0.0001048456,0.0002831829,0.000200769,0.0003434443,0.00009305704,0.0001838872,0.00008321545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002200325,"about_ca_system_score_gemma":0.00002469995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006925833,"about_ca_topic_score_gemma":0.00002380715,"domain_scores_codex":[0.998076,0.0002127548,0.0005487258,0.000479387,0.0004424459,0.0002407277],"domain_scores_gemma":[0.9979243,0.0007262316,0.0003790354,0.0004645345,0.0003866923,0.0001192052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000298242,0.001514685,0.009850868,0.00006645482,0.0004061435,0.00000671805,0.01081992,0.0009072021,0.02861755,0.7612389,0.03749717,0.1487762],"study_design_scores_gemma":[0.003659471,0.0002967622,0.02102437,0.00005084578,0.0001537758,0.00007443545,0.008312573,0.2041814,0.001103184,0.05374205,0.7066852,0.0007159094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6560442,0.0001107595,0.3238932,0.001028159,0.01119133,0.005313095,0.000279478,0.0001459607,0.001993806],"genre_scores_gemma":[0.9924403,0.000007334947,0.002686784,0.00009253387,0.0003520444,0.0006494501,0.000010492,0.00001715141,0.003743903],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7074968,"threshold_uncertainty_score":0.834372,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160070657","doi":"10.5555/2772879.2773478","title":"Exploiting Objects as Artifacts in Multi-Agent Based Social Simulations: Extended Abstract","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Language and cultural evolution","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Artifact (error); Social learning; Computer science; Margin (machine learning); Population; Artificial intelligence; Social network (sociolinguistics); Machine learning; Knowledge management; World Wide Web; Sociology; Social media","authors":[{"name":"Felicitas Mokom","is_ca":true},{"name":"Ziad Kobti","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2173949215221218,"gpt":0.3883054402522677,"spread":0.1709105187301459,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008147025,0.0002698633,0.0003332904,0.000141539,0.0006562339,0.000202243,0.0001908752,0.0002132998,0.00009902474],"category_scores_gemma":[0.0004481892,0.0002396621,0.0000898113,0.0003207818,0.0001375133,0.0006308224,0.00006133399,0.0001947145,0.0001537735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004317839,"about_ca_system_score_gemma":0.0002263762,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02018531,"about_ca_topic_score_gemma":0.005609993,"domain_scores_codex":[0.9972841,0.0004365084,0.0005028162,0.0004891845,0.0006792783,0.0006081464],"domain_scores_gemma":[0.9988482,0.00008925872,0.000279888,0.0001500829,0.0002708475,0.0003617493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"qualitative","study_design_scores_codex":[0.0007608627,0.005848298,0.08076295,0.0003859048,0.0006876191,0.001277792,0.8295406,0.02655448,0.005945575,0.006077741,0.005899837,0.0362584],"study_design_scores_gemma":[0.01425768,0.0003099181,0.3482413,0.0006884409,0.0001525581,0.000009411483,0.4077354,0.204739,0.0002910332,0.000200549,0.02148461,0.001889973],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9920022,0.0007726973,0.0009062109,0.0001610561,0.0008781544,0.00148446,0.00004387786,0.0001410261,0.003610346],"genre_scores_gemma":[0.9971093,0.00003379023,0.0003612224,0.000235483,0.0002596075,0.0000747154,0.00004621748,0.0000260085,0.001853675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4218051,"threshold_uncertainty_score":0.9863394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2143499977","doi":"10.1109/aamas.2004.171","title":"Model Sharing in Multiagent Systems","year":2004,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Multi-agent system; Agent-based model; Agent-based social simulation; Distributed computing; Artificial intelligence","authors":[{"name":"Olayide Olorunleke","is_ca":true},{"name":"Gordon McCalla","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1133346570670415,"gpt":0.2978018557228957,"spread":0.1844671986558542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008625562,0.000531534,0.0006597813,0.0004259295,0.0003051436,0.0005113197,0.00094441,0.0002341726,0.00000403888],"category_scores_gemma":[0.00003894211,0.0004837514,0.0001267848,0.0004442229,0.00005159935,0.001122777,0.0005208336,0.0002729954,0.0001158625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004480383,"about_ca_system_score_gemma":0.00009044474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006038861,"about_ca_topic_score_gemma":0.0002241473,"domain_scores_codex":[0.9959056,0.0001738552,0.001071304,0.001319226,0.0007108722,0.0008191474],"domain_scores_gemma":[0.9980768,0.00004461811,0.0004436043,0.0009013516,0.0001637133,0.0003698988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004824901,0.001303708,0.02928597,0.0005494583,0.0003107151,0.0003556848,0.01349203,0.8740717,0.002615697,0.07542408,0.0005215027,0.002021268],"study_design_scores_gemma":[0.003469193,0.00007394753,0.01701814,0.0005122285,0.00001675403,0.00003805246,0.0005886056,0.9769346,0.00005994065,0.00007041584,0.000670116,0.0005480198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3092993,0.002099033,0.6827202,0.00008626519,0.002396526,0.002441362,0.00003597577,0.0002600132,0.0006613242],"genre_scores_gemma":[0.9924932,0.0002207716,0.005366095,0.0001195888,0.0001178206,0.0002684365,0.00001407377,0.00005032337,0.001349765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6831938,"threshold_uncertainty_score":0.9997614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3140464205","doi":"","title":"Investigating the characteristics of one-sided matching mechanisms","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Matching (statistics); Mathematics; Statistics","authors":[{"name":"Hadi Hosseini","is_ca":true},{"name":"Kate Larson","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1092659491931415,"gpt":0.2541527099557087,"spread":0.1448867607625672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00147705,0.0002241982,0.0005711057,0.0001051415,0.0002247112,0.0000722484,0.0002870093,0.000106602,0.00005124188],"category_scores_gemma":[0.0002554304,0.0001534818,0.00009446022,0.0001121409,0.0001292619,0.0001907092,0.0001275177,0.0001080523,0.0001471724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005064976,"about_ca_system_score_gemma":0.00001201531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007529811,"about_ca_topic_score_gemma":0.000008852188,"domain_scores_codex":[0.9980531,0.0001416478,0.0009745806,0.0004109503,0.00008945834,0.0003302268],"domain_scores_gemma":[0.9981791,0.0002346313,0.001032863,0.0003734209,0.00006317602,0.0001167761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002671132,0.0001876579,0.04949922,0.0002448343,0.0004862732,0.000006022313,0.005706892,0.00002636484,0.006874439,0.9345158,0.0001787069,0.002247079],"study_design_scores_gemma":[0.01145249,0.0009879706,0.7851835,0.007694835,0.0002584202,0.00009854651,0.01234464,0.0354766,0.003321418,0.1251157,0.0146992,0.003366686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9276592,0.0005293878,0.06752864,0.0001615532,0.001293575,0.0007542121,0.0003777164,0.00004951013,0.001646213],"genre_scores_gemma":[0.99664,0.00007849398,0.0006263236,0.0001136623,0.0001123222,0.00004347465,0.000005192,0.00003683872,0.002343723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8094001,"threshold_uncertainty_score":0.6258805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W79747542","doi":"10.5555/1838206.1838398","title":"Quasi deterministic POMDPs and DecPOMDPs","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Observability; Observable; Computer science; Extension (predicate logic); Markov decision process; Mathematical optimization; Hierarchy; Class (philosophy); Polynomial hierarchy; Theoretical computer science; Mathematics; Time complexity; Markov process; Applied mathematics; Algorithm; Artificial intelligence","authors":[{"name":"Camille Besse","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06089110723984551,"gpt":0.2944538873330655,"spread":0.23356278009322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034848,0.0002784755,0.0002983526,0.0000996164,0.000287333,0.0003880399,0.0004693137,0.0001466966,0.00000626138],"category_scores_gemma":[0.00004530537,0.0002383586,0.00004499809,0.0001264127,0.00009516467,0.0003659651,0.0003019295,0.0002683108,0.00005097365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001662461,"about_ca_system_score_gemma":0.00005065727,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003347735,"about_ca_topic_score_gemma":0.00004643788,"domain_scores_codex":[0.9982076,0.0001043839,0.0003455744,0.0006671663,0.0002665242,0.0004088011],"domain_scores_gemma":[0.9988149,0.0000864259,0.000146456,0.0004877208,0.0001184152,0.0003461017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001399736,0.005027362,0.07085575,0.000928858,0.001250269,0.001322681,0.02972404,0.0002662271,0.01978417,0.4813318,0.005745337,0.3836235],"study_design_scores_gemma":[0.001013412,0.0002952911,0.02066029,0.00009280324,0.00003424883,0.0001748352,0.0001905744,0.9709721,0.00007948837,0.0003857544,0.005585974,0.0005152061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4127341,0.0005313704,0.5831632,0.00009877449,0.001818179,0.0005198792,0.00001852249,0.0002371655,0.0008787758],"genre_scores_gemma":[0.9815481,0.0001115468,0.01742518,0.0002017693,0.00008969058,0.00003811142,0.000002365654,0.00001889181,0.0005643372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9707059,"threshold_uncertainty_score":0.971998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2467276603","doi":"10.5555/2936924.2937201","title":"Investigating the Characteristics of One-Sided Matching Mechanisms: (Extended Abstract)","year":2016,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Comparability; Matching (statistics); Probabilistic logic; Computer science; Dictatorship; Space (punctuation); Mechanism (biology); Task (project management); Theoretical computer science; Artificial intelligence; Mathematics; Statistics; Economics; Epistemology; Political science","authors":[{"name":"Hadi Hosseini","is_ca":true},{"name":"Kate Larson","is_ca":true},{"name":"Robin Cohen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1017189391407418,"gpt":0.2588623865931234,"spread":0.1571434474523816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625599,0.0002603111,0.0006307005,0.000119712,0.0002425541,0.00008709798,0.0003191794,0.0001278128,0.00007546003],"category_scores_gemma":[0.0002938421,0.0001818259,0.0001103537,0.0001118515,0.000143705,0.0002363717,0.0001221965,0.0001382455,0.0001671598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006096806,"about_ca_system_score_gemma":0.0000161829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00088576,"about_ca_topic_score_gemma":0.00001195537,"domain_scores_codex":[0.9977903,0.0001094111,0.001152613,0.0004662212,0.0001068328,0.0003746321],"domain_scores_gemma":[0.9978251,0.0002752822,0.001273048,0.0004144707,0.00007640802,0.0001356751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0000564612,0.0004198345,0.03448032,0.0004787495,0.0008771533,0.00001451255,0.008496135,0.00004074028,0.01315146,0.936724,0.0002764217,0.004984179],"study_design_scores_gemma":[0.005918835,0.0004433904,0.9004378,0.004067403,0.000135097,0.00005178016,0.006829965,0.0105199,0.001700884,0.0626836,0.005452423,0.00175887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9657096,0.0005526264,0.02888914,0.0001549934,0.001281376,0.0008426672,0.0004596577,0.00005858409,0.002051389],"genre_scores_gemma":[0.9971684,0.00009406549,0.0005479779,0.000108236,0.0001222582,0.00004821074,0.000007160229,0.00004217166,0.001861552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8740404,"threshold_uncertainty_score":0.7414647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164846267","doi":"10.5555/1838206.1838479","title":"An agent communication protocol for resolving conflicts","year":2010,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Protocol (science); Argumentation theory; Computer science; Persuasion; Set (abstract data type); Communications protocol; Theoretical computer science; Artificial intelligence; Epistemology; Programming language; Computer network; Social psychology","authors":[{"name":"Jamal Bentahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1142804543862047,"gpt":0.3702068403268843,"spread":0.2559263859406796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001131331,0.0003555763,0.0003811093,0.000167265,0.0006601014,0.0005586711,0.001008934,0.0002118557,0.00002015543],"category_scores_gemma":[0.00007149742,0.0003102037,0.0001003787,0.0001747698,0.00007286555,0.001078975,0.0002382366,0.0002467494,0.00003449428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006039477,"about_ca_system_score_gemma":0.00005244612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009261873,"about_ca_topic_score_gemma":0.0001875818,"domain_scores_codex":[0.99726,0.0003230838,0.0007060366,0.0007933742,0.000426095,0.0004914551],"domain_scores_gemma":[0.9973077,0.000128041,0.0005466868,0.001302361,0.0003676254,0.0003476214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001081898,0.01154351,0.08961641,0.004334798,0.002025706,0.0001417279,0.08842598,0.003803776,0.2238477,0.3876557,0.05451028,0.1330125],"study_design_scores_gemma":[0.003961466,0.0002831433,0.02904718,0.0001922234,0.00001958757,0.00002097329,0.0003167557,0.796537,0.0006299801,0.00004825016,0.1684211,0.0005223051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04449081,0.0001060114,0.7347949,0.000227911,0.002341463,0.2164413,0.00007870739,0.0005110223,0.001007878],"genre_scores_gemma":[0.860287,0.00001019166,0.0285302,0.0002015131,0.0002124275,0.1097227,0.00003637753,0.00004859273,0.0009510804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8157961,"threshold_uncertainty_score":0.999935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293507961","doi":"10.5555/2772879.2773548","title":"One-Sided Matching with Dynamic Preferences","year":2015,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matching (statistics); Computer science; Set (abstract data type); Function (biology); Resource allocation; Scheduling (production processes); Sequential game; Mechanism design; Optimal matching; Contrast (vision); Game theory; Mathematical optimization; Mathematical economics; Artificial intelligence; Economics; Mathematics","authors":[{"name":"Hadi Hosseini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1636327509114454,"gpt":0.2740471760258787,"spread":0.1104144251144333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009922164,0.0002796387,0.0006087131,0.0001692728,0.0001709869,0.0001895046,0.0002496894,0.0001198554,0.00003019225],"category_scores_gemma":[0.00006067974,0.0002601006,0.00005776249,0.0001556981,0.00008585756,0.0003375829,0.00008856243,0.0001634676,0.0003929615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001066955,"about_ca_system_score_gemma":0.00002562958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002347075,"about_ca_topic_score_gemma":0.0001276203,"domain_scores_codex":[0.9981028,0.0001132647,0.0006496048,0.0006090512,0.0001118833,0.0004133281],"domain_scores_gemma":[0.9987224,0.00006100225,0.0005331268,0.0003358002,0.00007854497,0.000269076],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.001024808,0.002345457,0.4737932,0.001127842,0.003773753,0.0001749266,0.06104506,0.009063665,0.0002335713,0.4397167,0.002324186,0.005376769],"study_design_scores_gemma":[0.02773411,0.003789859,0.4879356,0.004426131,0.0003383977,0.0002822982,0.05672893,0.3242237,0.00009923174,0.03891382,0.04912778,0.006400097],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9669397,0.00242172,0.01607095,0.00004501442,0.001045989,0.0008574039,0.0001539209,0.0001043251,0.01236091],"genre_scores_gemma":[0.9935623,0.00006380086,0.0007463915,0.00006744562,0.00008012578,0.00006956376,0.00002108415,0.00004386572,0.005345411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4008029,"threshold_uncertainty_score":0.9999851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2290471876","doi":"10.5555/2615731.2615789","title":"A logical theory of robot localization","year":2014,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Probabilistic logic; Computer science; Robot; Logical framework; Artificial intelligence; Categorical variable; Representation (politics); Robotics; Task (project management); Domain (mathematical analysis); Extension (predicate logic); Action (physics); Logical conjunction; Theoretical computer science; Mathematics; Programming language; Engineering; Machine learning; Systems engineering","authors":[{"name":"Vaishak Belle","is_ca":true},{"name":"Hector J. Levesque","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06061705081815062,"gpt":0.2701336165493615,"spread":0.2095165657312109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006730104,0.0001980805,0.0003253499,0.00008286768,0.000150386,0.00008520986,0.0004359908,0.000109604,0.00001526936],"category_scores_gemma":[0.0001112234,0.000145305,0.00007300517,0.0001847742,0.0001004822,0.0002274866,0.0002463077,0.00008095968,0.00004925017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002822198,"about_ca_system_score_gemma":0.00002100235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000222,"about_ca_topic_score_gemma":0.000007624856,"domain_scores_codex":[0.9982403,0.000426234,0.0003442107,0.000450673,0.0002581776,0.0002804091],"domain_scores_gemma":[0.9989684,0.0001233983,0.0002217399,0.0003693136,0.0001646842,0.0001524181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006221764,0.0008888561,0.02439567,0.0002129647,0.0002626473,0.00002784396,0.006906018,0.003256179,0.0006128513,0.917892,0.001778615,0.04370407],"study_design_scores_gemma":[0.001503118,0.0003542011,0.03723232,0.0001409545,0.00003255609,0.00002017873,0.0003369958,0.9485692,0.0001948822,0.001394702,0.009869374,0.0003514632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00977846,0.0005986213,0.9837585,0.0000135085,0.000650891,0.0003499826,0.000003980318,0.00007369015,0.004772376],"genre_scores_gemma":[0.9957339,0.00005886996,0.002593723,0.0001232163,0.00008068187,0.00002182699,0.000004591007,0.00001160367,0.001371553],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9859555,"threshold_uncertainty_score":0.5925366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}