{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":39,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":39,"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":"eaefe8f63bc2","filters":{"venue":"International Journal of Artificial Intelligence Tools"}},"results":[{"id":"W2118078906","doi":"10.1142/s0218213001000623","title":"EFFICIENT DEFEASIBLE REASONING SYSTEMS","year":2001,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":120,"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":"Australian Research Council; Griffith University","keywords":"Defeasible estate; Forward chaining; Computer science; Non-monotonic logic; Defeasible reasoning; Backward chaining; Chaining; Logic programming; Simplicity; Description logic; Monotonic function; Theoretical computer science; Artificial intelligence; Programming language; Inference engine; Expert system; Mathematics","authors":[{"name":"Michael J. Maher","is_ca":false},{"name":"Andrew Rock","is_ca":false},{"name":"Grigoris Antoniou","is_ca":false},{"name":"David P. Billington","is_ca":false},{"name":"Tristan Miller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06739144958469796,"gpt":0.3207842718029209,"spread":0.2533928222182229,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00291019,0.0008781127,0.001135269,0.00137643,0.001469885,0.004006876,0.002140418,0.002078911,0.01338529],"category_scores_gemma":[0.01076216,0.000817623,0.0008590835,0.0015871,0.001136232,0.004478501,0.003047195,0.001511803,0.004019896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001147247,"about_ca_system_score_gemma":0.001452805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001400917,"about_ca_topic_score_gemma":0.001654634,"domain_scores_codex":[0.9967996,0.0008452779,0.0003171628,0.000483449,0.00135602,0.0001984722],"domain_scores_gemma":[0.9961216,0.001953145,0.0002179239,0.001000499,0.0006141736,0.00009269169],"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.0005279946,0.0003813287,0.001268337,0.0009426072,0.0002028513,0.0005734186,0.0007266694,0.1358282,0.0139614,0.4842045,0.02111797,0.3402648],"study_design_scores_gemma":[0.0002719504,0.00008285108,0.0003300333,0.0001001253,0.00009737519,0.0003425045,0.000185919,0.5491797,0.01099335,0.3590887,0.0792885,0.00003895032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02165374,0.001244849,0.9498628,0.001052165,0.0001318635,0.0004952455,0.0006905249,0.003318986,0.02154978],"genre_scores_gemma":[0.2468927,0.001449595,0.7337188,0.0004465225,0.0001157028,0.000525384,0.00234122,0.0003421567,0.01416783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01338529,"threshold_uncertainty_score":0.04477829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161122238","doi":"10.1142/s021821300600262x","title":"GENERICITY IN EVOLUTIONARY COMPUTATION SOFTWARE TOOLS: PRINCIPLES AND CASE-STUDY","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Evolutionary computation; Software engineering; Software; Genetic programming; Evolutionary algorithm; Software development; Evolutionary programming; Computation; Genetic representation; Theoretical computer science; Artificial intelligence; Programming language","authors":[{"name":"Christian Gagné","is_ca":true},{"name":"Marc Parizeau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08307800819345276,"gpt":0.3298441421145045,"spread":0.2467661339210517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009502843,0.0007539888,0.0009021544,0.002381221,0.002032957,0.004960138,0.002195446,0.003628742,0.001279841],"category_scores_gemma":[0.01912647,0.0007847078,0.001358321,0.003887653,0.006815864,0.007471251,0.004553701,0.00347204,0.0003299907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001000491,"about_ca_system_score_gemma":0.001080377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001116191,"about_ca_topic_score_gemma":0.001373911,"domain_scores_codex":[0.9930801,0.003811552,0.0005680234,0.0004925786,0.001629614,0.0004182023],"domain_scores_gemma":[0.9892088,0.007613836,0.0004939102,0.001757589,0.0006945805,0.0002313735],"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.00006756382,0.000142787,0.003416525,0.0004310442,0.0000451356,0.001128987,0.0031871,0.02903269,0.002395815,0.8546883,0.00160847,0.1038556],"study_design_scores_gemma":[0.0001120896,0.0005138136,0.002237473,0.0009733698,0.000126805,0.005915145,0.002086109,0.204804,0.01273512,0.5982469,0.1721049,0.0001442154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04901284,0.002923209,0.9243235,0.001461032,0.00006700468,0.0002503878,0.00004360872,0.0005937444,0.02132467],"genre_scores_gemma":[0.346092,0.002750099,0.6467078,0.0002945087,0.00006455825,0.0003810381,0.0001182128,0.0004014753,0.003190166],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009502843,"threshold_uncertainty_score":0.05025643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100720213","doi":"10.1142/s0218213008003765","title":"OPTIMAL BASIC BLOCK INSTRUCTION SCHEDULING FOR MULTIPLE-ISSUE PROCESSORS USING CONSTRAINT PROGRAMMING","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada); University of Waterloo","funders":"International Business Machines Corporation; Intel Corporation","keywords":"Computer science; Instruction scheduling; Compiler; Scheduling (production processes); Suite; Parallel computing; Optimizing compiler; Constraint programming; Schedule; Algorithm; Mathematical optimization; Dynamic priority scheduling; Programming language; Two-level scheduling; Mathematics","authors":[{"name":"Abid M. Malik","is_ca":true},{"name":"Jim McInnes","is_ca":true},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09098479028904376,"gpt":0.3335965103387119,"spread":0.2426117200496681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079514,0.0006862094,0.0007693538,0.0006670404,0.0007149312,0.001019834,0.001016837,0.0004939554,0.003562458],"category_scores_gemma":[0.003795894,0.000531124,0.0006943416,0.001605575,0.0006243069,0.001433206,0.0005756598,0.0009668947,0.0004043872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302194,"about_ca_system_score_gemma":0.004624689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01471692,"about_ca_topic_score_gemma":0.02487906,"domain_scores_codex":[0.9991259,0.0002631894,0.00004137505,0.0001064032,0.0003445786,0.0001186048],"domain_scores_gemma":[0.9982703,0.001137355,0.0001280757,0.00013879,0.0002773507,0.00004811085],"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.00008876125,0.00006746504,0.000530763,0.0001658193,0.00002367193,0.00005734143,0.00005524641,0.9016946,0.003356355,0.02308514,0.004010123,0.06686472],"study_design_scores_gemma":[0.00002842455,0.00002885871,0.00009688103,0.000007319818,0.000006821559,0.00001031691,0.00001527194,0.9866954,0.00164196,0.009378706,0.00208282,0.00000727872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05656121,0.0006796023,0.9303511,0.0004985207,0.00005980326,0.000213196,0.0004666021,0.001573686,0.009596385],"genre_scores_gemma":[0.2569325,0.0006253073,0.7388151,0.0001176893,0.00004008265,0.000315497,0.0007440966,0.0004105869,0.001999132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01471692,"threshold_uncertainty_score":0.02926254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978229367","doi":"10.1142/s0218213011000528","title":"RULE RESPONDER: RULE-BASED AGENTS FOR THE SEMANTIC-PRAGMATIC WEB","year":2011,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Multi-Agent Systems and Negotiation","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":"National Research Council Canada","funders":"","keywords":"Computer science; Semantic Web; Semantic Web Rule Language; Social Semantic Web; Context (archaeology); Complex event processing; Rule-based system; Multi-agent system; Event (particle physics); Semantic analytics; Knowledge management; Artificial intelligence; Programming language","authors":[{"name":"Adrian Paschke","is_ca":false},{"name":"Harold Boley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1490259697662824,"gpt":0.3452876092041416,"spread":0.1962616394378592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004993485,0.000917838,0.001063222,0.00130372,0.001270232,0.005083287,0.003240408,0.003409718,0.01845674],"category_scores_gemma":[0.01105195,0.000787908,0.001061427,0.0009209057,0.002061344,0.006391672,0.003252998,0.003486892,0.01262989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000700974,"about_ca_system_score_gemma":0.001806078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00161884,"about_ca_topic_score_gemma":0.001748767,"domain_scores_codex":[0.9969137,0.001050455,0.0003451272,0.0003659331,0.001168464,0.0001564186],"domain_scores_gemma":[0.9969187,0.001116042,0.000187671,0.0008704077,0.0005847342,0.000322514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007061261,0.0006088775,0.0011067,0.0008291679,0.0001609868,0.002141264,0.002008203,0.0189299,0.03018211,0.5925811,0.101395,0.2493506],"study_design_scores_gemma":[0.0002697432,0.0001148471,0.0003659792,0.0001932312,0.0001017992,0.0008336334,0.0002836774,0.2406518,0.02261852,0.2892475,0.4451521,0.0001671757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003091234,0.0002499723,0.9432927,0.001223078,0.000355642,0.0006088804,0.0004840237,0.02353906,0.02715536],"genre_scores_gemma":[0.09152811,0.0006025654,0.8628681,0.001611557,0.0002114753,0.0008972968,0.001915248,0.003013252,0.03735234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01845674,"threshold_uncertainty_score":0.06174397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089189083","doi":"10.1142/s0218213006003065","title":"THE EMERGENCE OF SOCIAL NETWORK HIERARCHY USING CULTURAL ALGORITHMS","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","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 Windsor","funders":"","keywords":"Computer science; Hierarchy; Reciprocal; Social network (sociolinguistics); Kinship; Population; Swarm behaviour; Social network analysis; Resilience (materials science); Artificial intelligence; Sociology; World Wide Web; Economics","authors":[{"name":"Ziad Kobti","is_ca":true},{"name":"Robert G. Reynolds","is_ca":false},{"name":"TIM A. KOHLER","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05071852007949442,"gpt":0.3598987767395383,"spread":0.3091802566600439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770335,0.0005081008,0.0007583559,0.001503013,0.001198041,0.002174759,0.001157774,0.001014295,0.001758942],"category_scores_gemma":[0.01250784,0.0004319867,0.0008274462,0.0008047164,0.002442882,0.003060794,0.002326873,0.001083756,0.0001903079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001819524,"about_ca_system_score_gemma":0.001067389,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004371859,"about_ca_topic_score_gemma":0.003745492,"domain_scores_codex":[0.9990335,0.0005452797,0.00003499166,0.000131019,0.0001780755,0.00007723642],"domain_scores_gemma":[0.9956809,0.002879777,0.0004775427,0.0003719869,0.000307874,0.0002819144],"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.00003991051,0.00004357945,0.00365191,0.0001301886,0.0001003119,0.0001933176,0.0008343651,0.6055823,0.001293765,0.3545542,0.00127973,0.03229644],"study_design_scores_gemma":[0.00001632202,0.00001270884,0.0002687844,0.00001341252,0.000009961308,0.00002933135,0.0001046558,0.8785332,0.0001744957,0.1197078,0.001120146,0.000009128761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1531169,0.0005807723,0.8301803,0.001327147,0.00005518407,0.0001583568,0.00008808808,0.0002597964,0.0142334],"genre_scores_gemma":[0.8305599,0.0004920179,0.1652677,0.0001417107,0.00005902584,0.0002300561,0.0001232233,0.00006428899,0.00306206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004371859,"threshold_uncertainty_score":0.01320159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899855224","doi":"10.1142/s0218213018500367","title":"Extreme Learning Machine Based Prognostics of Battery Life","year":2018,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Advanced Battery Technologies Research","field":"Engineering","cited_by":24,"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":"Prognostics; Computer science; Scheme (mathematics); Battery (electricity); Battery capacity; Reliability engineering; Machine learning; Artificial intelligence; Data mining; Power (physics); Engineering","authors":[{"name":"Roozbeh Razavi‐Far","is_ca":true},{"name":"Shiladitya Chakrabarti","is_ca":true},{"name":"Mehrdad Saif","is_ca":true},{"name":"Enrico Zio","is_ca":false},{"name":"Vasile Palade","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09764378198985696,"gpt":0.3357326117525108,"spread":0.2380888297626538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986728,0.0005414797,0.0006243123,0.0005088533,0.0002769307,0.0004494731,0.000660168,0.0005157292,0.0007849094],"category_scores_gemma":[0.002802161,0.0001503268,0.0003132384,0.0003988146,0.0003114654,0.0009375146,0.000614553,0.0007530829,0.0002302855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003149594,"about_ca_system_score_gemma":0.0002738477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009408211,"about_ca_topic_score_gemma":0.0007455156,"domain_scores_codex":[0.9997066,0.00006663254,0.000023553,0.00005564777,0.0001155365,0.00003200365],"domain_scores_gemma":[0.9993293,0.0003351401,0.00009120976,0.0000627898,0.0001588648,0.00002258855],"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.0001533673,0.00003687476,0.002460764,0.00008492733,0.00002876247,0.0001019968,0.00005538229,0.8605851,0.004914647,0.003546959,0.0007044628,0.1273268],"study_design_scores_gemma":[0.000002746299,0.00002850719,0.0003644599,0.000004282728,0.000003868673,0.00001958921,0.000003198866,0.9962968,0.001173315,0.001903051,0.0001950102,0.000005192659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04941349,0.0004746639,0.947575,0.0001237127,0.00005912819,0.00002647308,0.00008852033,0.0007904357,0.001448448],"genre_scores_gemma":[0.9596858,0.0002532571,0.03887831,0.00004573741,0.00004203758,0.00004067558,0.0001534006,0.00002019532,0.0008805407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009408211,"threshold_uncertainty_score":0.00316608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2593220893","doi":"10.1142/s0218213017600041","title":"Exact and Hybrid Solutions for the Multi-Objective VM Reassignment Problem","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"IBM (Canada)","funders":"Science Foundation Ireland","keywords":"Computer science; Mathematical optimization; Metaheuristic; Solver; Integer programming; Context (archaeology); Linear programming; Heuristic; Constraint programming; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","authors":[{"name":"Takfarinas Saber","is_ca":false},{"name":"Joao Marques-Silva","is_ca":false},{"name":"James Thorburn","is_ca":true},{"name":"Anthony Ventresque","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1038246961650876,"gpt":0.3466148174243771,"spread":0.2427901212592894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001535737,0.001055079,0.0007319011,0.0009506127,0.0004503892,0.0014843,0.001269727,0.001754341,0.006137426],"category_scores_gemma":[0.002794102,0.000531362,0.0008925527,0.001001482,0.0007819817,0.001437324,0.001319535,0.001314551,0.0006116151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009329408,"about_ca_system_score_gemma":0.0009889242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002548443,"about_ca_topic_score_gemma":0.00347511,"domain_scores_codex":[0.999207,0.0002639351,0.00003224422,0.0001377286,0.0002445759,0.0001145428],"domain_scores_gemma":[0.9990131,0.0006277601,0.0001241921,0.00009060351,0.00009383211,0.00005051437],"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.00005365885,0.00004752778,0.0002302498,0.00009989672,0.00002563941,0.00004759804,0.00003483759,0.9531451,0.0008521773,0.01357048,0.0008551146,0.03103762],"study_design_scores_gemma":[0.00001483426,0.00004020298,0.00008454247,0.00001579778,0.000006992917,0.00002601114,0.00002197702,0.9918172,0.0004393248,0.006208539,0.00131854,0.000006026857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03146699,0.00081639,0.9537266,0.0003518826,0.00009478751,0.0000952314,0.0001215299,0.0004801873,0.01284638],"genre_scores_gemma":[0.4503775,0.0005082337,0.5417327,0.0001948946,0.00005851524,0.0003206834,0.000242835,0.0001999843,0.006364624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006137426,"threshold_uncertainty_score":0.02053177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2575973620","doi":"10.1142/s0218213017600065","title":"Static and Dynamic Portfolio Methods for Optimal Planning: An Empirical Analysis","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Planner; Satisficing; Portfolio; Schedule; Range (aeronautics); Mathematical optimization; Operations research; Artificial intelligence","authors":[{"name":"Mattia Rizzini","is_ca":false},{"name":"Chris Fawcett","is_ca":true},{"name":"Mauro Vallati","is_ca":false},{"name":"Alfonso Gerevini","is_ca":false},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1589848966465197,"gpt":0.501950625082249,"spread":0.3429657284357293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02860756,0.0009040052,0.0009550842,0.003209946,0.0007791507,0.002021153,0.0019278,0.001232655,0.004869885],"category_scores_gemma":[0.1399114,0.0006382722,0.001012079,0.005161116,0.001644992,0.005703008,0.002148036,0.002765007,0.0005973587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002039329,"about_ca_system_score_gemma":0.001772298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003056568,"about_ca_topic_score_gemma":0.002792399,"domain_scores_codex":[0.9878573,0.007056511,0.0005256744,0.001101081,0.003156752,0.0003026131],"domain_scores_gemma":[0.8095861,0.1698278,0.003769344,0.01122141,0.004743899,0.0008515439],"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.001013532,0.001209575,0.0593555,0.0006968116,0.0005058523,0.0001267087,0.0005349555,0.3596217,0.0004992599,0.0621468,0.007688996,0.5066003],"study_design_scores_gemma":[0.000166531,0.0008479432,0.01872027,0.0001982293,0.0001665118,0.0002605576,0.0003563638,0.9318197,0.0007471538,0.03977259,0.006889168,0.00005488855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4806025,0.01271714,0.4709465,0.00215669,0.0001222703,0.0007748057,0.001196496,0.0009472029,0.03053645],"genre_scores_gemma":[0.877645,0.002280035,0.1163244,0.0001520531,0.00008955097,0.0004865834,0.001168559,0.00020344,0.001650479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02860756,"threshold_uncertainty_score":0.151293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163572991","doi":"10.1142/s0218213010000261","title":"SEARCH-BASED TESTING OF MULTI-AGENT MANUFACTURING SYSTEMS FOR DEADLOCKS BASED ON MODELS","year":2010,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Deadlock; Deadlock prevention algorithms; Distributed computing; Automation; Embedded system","authors":[{"name":"Nariman Mani","is_ca":true},{"name":"Vahid Garousi","is_ca":true},{"name":"Behrouz H. Far","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2024473661816171,"gpt":0.3599902386338751,"spread":0.157542872452258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002122651,0.0006383896,0.0006841466,0.0009386601,0.0005106241,0.0008584167,0.001134791,0.0009495115,0.00104017],"category_scores_gemma":[0.01006245,0.0004105587,0.00128122,0.0004478301,0.001098844,0.00132205,0.0009490946,0.0005242355,0.0001282665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008666174,"about_ca_system_score_gemma":0.001482297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002861322,"about_ca_topic_score_gemma":0.003040064,"domain_scores_codex":[0.9975452,0.001181026,0.000143604,0.0002415216,0.0007218767,0.0001667956],"domain_scores_gemma":[0.9911724,0.007022199,0.0005700705,0.000624174,0.0004860595,0.0001250066],"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.0005433419,0.0002897063,0.007928198,0.0002879108,0.0001548698,0.0008257767,0.0005949691,0.8435448,0.04553355,0.03843965,0.000764948,0.06109221],"study_design_scores_gemma":[0.00002692707,0.00009386165,0.0003350053,0.00001405516,0.00002235205,0.00008902735,0.0000348068,0.9804776,0.01234302,0.006185578,0.0003675754,0.00001020202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2070228,0.0001861177,0.7883962,0.0002343274,0.00002058337,0.0001328394,0.0000670736,0.001683669,0.002256374],"genre_scores_gemma":[0.85132,0.00007974052,0.1474937,0.00005294208,0.000005149782,0.0001370481,0.0001330916,0.00007994489,0.0006982862],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002861322,"threshold_uncertainty_score":0.01122582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2765288170","doi":"10.1142/s0218213017600168","title":"Multi-Objective Optimization in Multi-Attribute and Multi-Unit Combinatorial Reverse Auctions","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Regina","funders":"","keywords":"Computer science; Mathematical optimization; Elitism; Heuristic; Combinatorial auction; Quality (philosophy); Scalability; Convergence (economics); Genetic algorithm; Common value auction; Diversity (politics); Machine learning; Artificial intelligence; Mathematics","authors":[{"name":"Shubhashis Kumar Shil","is_ca":true},{"name":"Samira Sadaoui","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3136507355222871,"gpt":0.4696876422128266,"spread":0.1560369066905395,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005872475,0.001395106,0.002645866,0.001526769,0.0005656368,0.002292686,0.002532287,0.001941276,0.001858448],"category_scores_gemma":[0.007437977,0.0009747499,0.001731413,0.002340905,0.001381303,0.001965419,0.0014103,0.002071268,0.0003065428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001375848,"about_ca_system_score_gemma":0.001219859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002117858,"about_ca_topic_score_gemma":0.001572788,"domain_scores_codex":[0.9954632,0.003041047,0.0001582879,0.0004066031,0.000671184,0.0002596507],"domain_scores_gemma":[0.9958832,0.003047902,0.0004243138,0.0002171869,0.0002791335,0.0001482752],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000412312,0.00007902846,0.0003082756,0.0001219545,0.00008948917,0.0001209663,0.00003660184,0.9714025,0.0004401541,0.01424634,0.0002572663,0.01285622],"study_design_scores_gemma":[0.00001898082,0.00004946382,0.00008183057,0.00001248732,0.00001713212,0.00005441981,0.00001781037,0.9892564,0.0002155969,0.009910637,0.0003562297,0.000009062489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02877315,0.0007176064,0.9674407,0.0001649367,0.00005209681,0.000118475,0.00004966028,0.00008019315,0.002603121],"genre_scores_gemma":[0.5575814,0.000590298,0.4375713,0.0001895939,0.00007504528,0.0003383161,0.0001082159,0.00008869125,0.003457098],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005872475,"threshold_uncertainty_score":0.031057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2042255956","doi":"10.1142/s0218213004001727","title":"THE COMPUTATION OF INVERSE TIME VARIANT FUNCTIONS VIA PROPER PSEUDOINVERSE BOUNDING: A RADIAL BASIS FUNCTION NETWORK APPROACH","year":2004,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Metallurgy and Material Forming","field":"Engineering","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 Regina","funders":"","keywords":"Moore–Penrose pseudoinverse; Computer science; Radial basis function network; Radial basis function; Bounding overwatch; Computation; Inverse; Inverse function; Algorithm; Gravitational singularity; Generalized inverse; Applied mathematics; Mathematical optimization; Artificial neural network; Mathematics; Artificial intelligence; Mathematical analysis","authors":[{"name":"René V. Mayorga","is_ca":true},{"name":"JONATHAN CARRERA","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03440814532528789,"gpt":0.2477483353997552,"spread":0.2133401900744673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006977487,0.000574488,0.0005674384,0.000341922,0.0002015367,0.0007630286,0.0006506612,0.0007481107,0.001371532],"category_scores_gemma":[0.001964783,0.0002585642,0.0003934613,0.0002962711,0.0005245516,0.00134329,0.0005178417,0.0009349345,0.0007245758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002679936,"about_ca_system_score_gemma":0.0004279995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001253822,"about_ca_topic_score_gemma":0.001047565,"domain_scores_codex":[0.9997172,0.00007027331,0.00001570149,0.00004682551,0.0001302891,0.000019727],"domain_scores_gemma":[0.9995822,0.0001867123,0.00003610564,0.00005941476,0.000122476,0.00001306339],"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.0001439362,0.00004041456,0.0004375922,0.0001952751,0.00003852429,0.0001437881,0.0001346041,0.5755848,0.04300482,0.07272833,0.001698079,0.3058499],"study_design_scores_gemma":[0.000003135742,0.00001515774,0.00006537957,0.000005956572,0.000003777867,0.00004721895,0.000004986152,0.9880303,0.004706667,0.005409499,0.001701386,0.000006512862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001221256,0.00004602615,0.9982893,0.0000201236,0.000007550001,0.00000345569,0.000003453377,0.00006607764,0.0003427696],"genre_scores_gemma":[0.1825819,0.0004973619,0.8129462,0.00006550721,0.00005673958,0.00005780991,0.00007650786,0.0001833538,0.003534655],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001371532,"threshold_uncertainty_score":0.004588246,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998787753","doi":"10.1142/s0218213003001216","title":"Logic Grammars for Diagnosis and Repair","year":2003,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parsing; Rule-based machine translation; String (physics); Transformation (genetics); Natural language processing; Constraint (computer-aided design); Artificial intelligence; Grammar; Programming language; Parsing expression grammar; Feature (linguistics); Context-free grammar; L-attributed grammar; Definite clause grammar; Grammar induction; Theoretical computer science; Mathematics; Linguistics","authors":[{"name":"Henning Christiansen","is_ca":false},{"name":"Verónica Dahl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07888665829628552,"gpt":0.3605100441032646,"spread":0.2816233858069791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003003864,0.001093201,0.0008303077,0.001977988,0.0009457794,0.002779105,0.003682593,0.002489036,0.006138124],"category_scores_gemma":[0.01032532,0.0007798073,0.002143887,0.001229387,0.004037044,0.004254829,0.003117476,0.003352956,0.002124764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001473128,"about_ca_system_score_gemma":0.002875932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003143695,"about_ca_topic_score_gemma":0.002753321,"domain_scores_codex":[0.996439,0.001034095,0.0003819329,0.0007211815,0.001212087,0.0002116736],"domain_scores_gemma":[0.9952147,0.002638554,0.000344976,0.001129735,0.0005501988,0.0001218106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006343215,0.00007578625,0.0005936661,0.0003244192,0.00005838468,0.0005701138,0.0005465422,0.08553819,0.004455068,0.797923,0.004524351,0.105327],"study_design_scores_gemma":[0.00004284826,0.00004224922,0.0001136344,0.00009574924,0.00005663689,0.000358241,0.0001136684,0.2074149,0.006148777,0.7579405,0.02763334,0.00003942348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001040981,0.0001471967,0.9948297,0.0004989479,0.00003896124,0.00009082471,0.0001054999,0.001089369,0.002158472],"genre_scores_gemma":[0.04651557,0.0003495097,0.9489635,0.0004037,0.00007035289,0.0002811736,0.0003701775,0.0002502447,0.002795719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006138124,"threshold_uncertainty_score":0.02053404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128602454","doi":"10.1142/s0218213014600215","title":"A Mixture Model-Based Combination Approach for Outlier Detection","year":2014,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outlier; Computer science; Anomaly detection; Pattern recognition (psychology); Artificial intelligence; Data mining; Identification (biology); Local outlier factor","authors":[{"name":"Mohamed Bouguessa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04797987691904263,"gpt":0.3131231068887541,"spread":0.2651432299697114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004621981,0.002883478,0.00419774,0.007316179,0.001130167,0.002788376,0.004001614,0.002240299,0.001975437],"category_scores_gemma":[0.008756068,0.001386263,0.00402045,0.006881385,0.000954557,0.004023258,0.00347221,0.003196923,0.002232854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008715355,"about_ca_system_score_gemma":0.001127852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002915284,"about_ca_topic_score_gemma":0.00328835,"domain_scores_codex":[0.9924609,0.001585681,0.0004527535,0.001619472,0.003428152,0.0004529915],"domain_scores_gemma":[0.9949587,0.001520505,0.0005680324,0.0009131293,0.001825749,0.0002139872],"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.0006479314,0.000412277,0.01236495,0.0004485422,0.001780109,0.0005767285,0.0003417551,0.1525607,0.02325945,0.01046388,0.005440988,0.7917026],"study_design_scores_gemma":[0.00002201582,0.0002042041,0.002315211,0.0000288699,0.0002881366,0.0006635424,0.00006816019,0.976267,0.006989892,0.007981416,0.005066764,0.0001048817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003368808,0.0004086666,0.9945124,0.00006697419,0.00005047971,0.00005063767,0.0000409968,0.0009596373,0.0005413222],"genre_scores_gemma":[0.2262581,0.001028121,0.7669253,0.0002303475,0.0003208668,0.0002573675,0.0008074021,0.0005765501,0.003596068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007316179,"threshold_uncertainty_score":0.02444369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389210220","doi":"10.1142/s0218213024600017","title":"Understanding the Limits of Explainable Ethical AI","year":2023,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Social Sciences and Humanities Research Council; Fonds de recherche du Québec","keywords":"Consequentialism; Utilitarianism; Normative; Perspective (graphical); Computer science; Deontological ethics; Value (mathematics); Artificial intelligence; Management science; Engineering ethics; Risk analysis (engineering); Epistemology; Business; Economics; Engineering; Machine learning; Philosophy","authors":[{"name":"Clayton Peterson","is_ca":true},{"name":"Jan Broersen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4814453569321981,"gpt":0.4893671905881783,"spread":0.007921833655980148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0185842,0.0007076676,0.001006003,0.001961104,0.004015574,0.01054315,0.003161352,0.007182656,0.007433996],"category_scores_gemma":[0.06758598,0.0007953831,0.00102205,0.0008628223,0.04057277,0.02227564,0.009282898,0.009698364,0.0008755965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004810896,"about_ca_system_score_gemma":0.003380741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00201519,"about_ca_topic_score_gemma":0.001104703,"domain_scores_codex":[0.9808015,0.01348542,0.000528207,0.00159601,0.002593569,0.000995278],"domain_scores_gemma":[0.8939335,0.08940178,0.003174746,0.008487863,0.003493519,0.001508633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004260143,0.000007309019,0.0001233882,0.00002641463,0.000004046653,0.00002235704,0.00066651,0.00139571,0.00004399373,0.9960969,0.0002894584,0.001319665],"study_design_scores_gemma":[0.00000444237,0.000003111017,0.00007402949,0.00004310498,0.000002328467,0.00001869486,0.0002045517,0.002976183,0.00004277292,0.992773,0.003852873,0.000004945648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08464658,0.01149557,0.2393052,0.1322538,0.0006011158,0.0001178327,0.0001644792,0.000297511,0.5311179],"genre_scores_gemma":[0.9615472,0.003012082,0.02624295,0.003653018,0.00046265,0.0004050048,0.00007988902,0.0001498634,0.004447325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0185842,"threshold_uncertainty_score":0.09828383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020066471","doi":"10.1142/s0218213008004187","title":"PORTFOLIOS WITH DEADLINES FOR BACKTRACKING SEARCH","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","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":"Backtracking; Computer science; Constraint learning; Constraint satisfaction problem; Scheduling (production processes); Constraint satisfaction; Schedule; Mathematical optimization; Portfolio; Look-ahead; Limit (mathematics); Theoretical computer science; Algorithm; Local consistency; Artificial intelligence; Mathematics","authors":[{"name":"Huayue Wu","is_ca":true},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.114734689977368,"gpt":0.3389392715923146,"spread":0.2242045816149466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009013747,0.001405313,0.002356839,0.001646032,0.001073567,0.002168567,0.003192073,0.002126285,0.005840064],"category_scores_gemma":[0.04487096,0.001039537,0.001007023,0.001857901,0.00159623,0.004988798,0.003238568,0.003266482,0.001453733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001628205,"about_ca_system_score_gemma":0.00275894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001159898,"about_ca_topic_score_gemma":0.00169605,"domain_scores_codex":[0.9949644,0.002337311,0.000428768,0.0008430911,0.001067149,0.0003593399],"domain_scores_gemma":[0.9828415,0.01090012,0.00143143,0.00285829,0.001150131,0.000818681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006776383,0.0005098285,0.002840385,0.0003797539,0.0001130212,0.0001388248,0.0002600687,0.5824155,0.002192076,0.1000341,0.006825164,0.3036136],"study_design_scores_gemma":[0.0001581627,0.0002615504,0.0002240514,0.00005790221,0.00003259712,0.00006428976,0.00004791197,0.9148614,0.001163478,0.07869475,0.004413302,0.00002047938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0226034,0.0009663071,0.9688869,0.0006049824,0.0001652378,0.0003430238,0.0001137473,0.001281937,0.005034535],"genre_scores_gemma":[0.3756763,0.0006953474,0.6168706,0.0004738806,0.0001993947,0.0007687683,0.0003607993,0.0003624094,0.004592494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009013747,"threshold_uncertainty_score":0.04766977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994173598","doi":"10.1142/s0218213001000660","title":"AN ASSUMPTIVE LOGIC PROGRAMMING METHODOLOGY FOR PARSING","year":2001,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Datalog; Parsing; Parsing expression grammar; Programming language; L-attributed grammar; Rule-based machine translation; Phrase structure grammar; Logic programming; Artificial intelligence; Natural language processing; S-attributed grammar; Parser combinator; Continuation; Context-free grammar","authors":[{"name":"Kimberly Voll","is_ca":true},{"name":"TOM P. YEH","is_ca":true},{"name":"Verónica Dahl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2408640637981287,"gpt":0.457343043631687,"spread":0.2164789798335583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00415472,0.001028854,0.0005294802,0.001238451,0.001392008,0.003552146,0.00358017,0.00154408,0.008812308],"category_scores_gemma":[0.00911253,0.0008365449,0.001924438,0.00123103,0.003818927,0.005951735,0.003022399,0.004402708,0.002368859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001487754,"about_ca_system_score_gemma":0.002373003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001214088,"about_ca_topic_score_gemma":0.001677858,"domain_scores_codex":[0.997286,0.0009095045,0.0001977443,0.0006083361,0.0008493404,0.0001491895],"domain_scores_gemma":[0.9956101,0.002481455,0.0002514655,0.001113239,0.0004401324,0.0001036812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002589971,0.00003631352,0.0001824135,0.0001584634,0.0000188688,0.0001856001,0.0005085963,0.008957563,0.00256613,0.9286578,0.002994025,0.05570824],"study_design_scores_gemma":[0.0000262293,0.00005053815,0.00009584732,0.00008704589,0.0000617073,0.0003928615,0.0001317359,0.1213361,0.01451094,0.8117332,0.0515244,0.00004944372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003643314,0.00002003336,0.9973653,0.0001561665,0.00001589194,0.00003457488,0.000043499,0.000659854,0.001340259],"genre_scores_gemma":[0.03369078,0.000164117,0.9623782,0.0002788884,0.00005926336,0.0001911097,0.0001707566,0.0003243953,0.002742525],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008812308,"threshold_uncertainty_score":0.0294801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072164538","doi":"10.1142/s0218213006002990","title":"AGGREGATION OF MULTIPLE REINFORCEMENT LEARNING ALGORITHMS","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":6,"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; Reinforcement learning; Learning classifier system; Robustness (evolution); Artificial intelligence; Instance-based learning; Machine learning; Algorithm; Unsupervised learning; Robot learning; Fault tolerance; Architecture; Distributed computing; Robot","authors":[{"name":"Ju Jiang","is_ca":true},{"name":"Mohamed S. Kamel","is_ca":true},{"name":"Liang-Bi Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04119386503159132,"gpt":0.3033805911273944,"spread":0.262186726095803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031568,0.0008557938,0.001310193,0.0005627734,0.000426317,0.0008234073,0.001233941,0.0006744874,0.00186145],"category_scores_gemma":[0.003942616,0.0003648858,0.0005583841,0.0004252748,0.0005728651,0.001070162,0.001600196,0.001001912,0.0003674874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006442693,"about_ca_system_score_gemma":0.0007053306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001893208,"about_ca_topic_score_gemma":0.001609518,"domain_scores_codex":[0.9986857,0.0003797216,0.00009749055,0.0002804828,0.0003972691,0.0001593699],"domain_scores_gemma":[0.9980432,0.0007099272,0.0002442713,0.0003521309,0.0005009227,0.0001495642],"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.0002449896,0.0001756443,0.002000713,0.0001150881,0.0001647232,0.0001862321,0.0001376211,0.7530064,0.007997213,0.007503864,0.001190509,0.227277],"study_design_scores_gemma":[0.0000224265,0.0001082837,0.0002402558,0.000006829203,0.00001995208,0.00003576862,0.00001053075,0.9937056,0.001567499,0.003408482,0.0008653913,0.000008908991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07982716,0.0004664074,0.9134955,0.0002233598,0.0001426256,0.0001481787,0.00002546103,0.001427833,0.004243445],"genre_scores_gemma":[0.9054611,0.0001295676,0.0919989,0.00007319022,0.00005516295,0.0001211483,0.00004003687,0.00003744892,0.002083424],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002031568,"threshold_uncertainty_score":0.01074409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014517001","doi":"10.1142/s0218213004001697","title":"TEMPORAL VERSUS LATEST SNAPSHOT WEB USAGE MINING USING KOHONEN SOM AND MODIFIED KOHONEN SOM BASED ON THE PROPERTIES OF ROUGH SETS THEORY","year":2004,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Self-organizing map; Computer science; Cluster analysis; Web mining; Data mining; Snapshot (computer storage); The Internet; Hierarchical clustering; Rough set; Artificial intelligence; Web page; Database; World Wide Web","authors":[{"name":"Mofreh A. Hogo","is_ca":false},{"name":"Miroslav Šnorek","is_ca":false},{"name":"Pawan Lingras","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1691226850754209,"gpt":0.3320782916227807,"spread":0.1629556065473598,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008983124,0.0002549284,0.0004952566,0.001305683,0.0002888925,0.001173673,0.0006614443,0.0004374301,0.0006483371],"category_scores_gemma":[0.003012637,0.0002125211,0.0008185008,0.001252051,0.000312812,0.001578471,0.000447202,0.0003805592,0.0001336997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003514399,"about_ca_system_score_gemma":0.0003278927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002104472,"about_ca_topic_score_gemma":0.00304998,"domain_scores_codex":[0.9995906,0.00007940032,0.00004644388,0.00005920807,0.0001845939,0.00003979586],"domain_scores_gemma":[0.9991131,0.0003598664,0.00007129648,0.0001048572,0.000308316,0.00004242802],"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.0008465285,0.0001996909,0.02342216,0.0004948732,0.0004433507,0.0005049043,0.0007030891,0.1680563,0.03762516,0.02021511,0.001626786,0.7458619],"study_design_scores_gemma":[0.00002314201,0.0001474282,0.01573558,0.00004826891,0.0001076329,0.0004268087,0.0003786341,0.9510831,0.01431997,0.01539328,0.002266767,0.00006944496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2319909,0.0007559318,0.7610939,0.0001773539,0.0001118182,0.00008774927,0.0002400812,0.0005286934,0.005013568],"genre_scores_gemma":[0.7774797,0.0003522057,0.2206119,0.00003370774,0.00002938875,0.00005627772,0.0001979863,0.00004003901,0.001198837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002104472,"threshold_uncertainty_score":0.004750788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151273784","doi":"10.1142/s0218213008004114","title":"A SPACE-EFFICIENT BACKTRACK-FREE REPRESENTATION FOR CONSTRAINT SATISFACTION PROBLEMS","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","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 Toronto","funders":"","keywords":"Computer science; Pruning; Heuristics; Constraint satisfaction problem; Backtracking; Constraint satisfaction; Representation (politics); Local consistency; Constraint (computer-aided design); Space (punctuation); Search tree; Tuple; Mathematical optimization; Consistency (knowledge bases); Algorithm; Variety (cybernetics); Search algorithm; Artificial intelligence; Mathematics","authors":[{"name":"J. Christopher Beck","is_ca":true},{"name":"Tom Carchrae","is_ca":false},{"name":"Eugene C. Freuder","is_ca":false},{"name":"Georg Ringwelski","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09226414483271571,"gpt":0.3272275692207837,"spread":0.2349634243880679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00237429,0.001205765,0.001183934,0.001736061,0.001195319,0.003359235,0.003707006,0.002357241,0.004662628],"category_scores_gemma":[0.01086854,0.0007562826,0.001722305,0.002794834,0.001488492,0.004786589,0.003112377,0.003384253,0.001441762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00134478,"about_ca_system_score_gemma":0.002892609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002977883,"about_ca_topic_score_gemma":0.004345463,"domain_scores_codex":[0.9968625,0.001035706,0.0002545206,0.0004084115,0.00117699,0.0002619254],"domain_scores_gemma":[0.9953825,0.002271963,0.00038659,0.001172599,0.0006625767,0.0001237103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004531705,0.0003631821,0.0006603099,0.0005930456,0.0000891353,0.0002590698,0.0009677918,0.3521853,0.0103487,0.145425,0.009881447,0.4787738],"study_design_scores_gemma":[0.0001512878,0.0002052022,0.0001353746,0.00009101094,0.00005497806,0.0001356983,0.0001513583,0.8585337,0.009776033,0.1197891,0.01091905,0.00005711327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005806259,0.0001281433,0.9908222,0.0002392929,0.00003320389,0.0001254659,0.0001825948,0.00128609,0.001376801],"genre_scores_gemma":[0.08441039,0.0002027298,0.9115469,0.0001926811,0.00003541487,0.0004033713,0.0008372241,0.0004015506,0.001969747],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004662628,"threshold_uncertainty_score":0.01559806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3036447434","doi":"10.1142/s0218213020600040","title":"Selecting and Combining Classifiers Based on Centrality Measures","year":2020,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Face and Expression Recognition","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":"École de Technologie Supérieure","funders":"","keywords":"Centrality; Computer science; Classifier (UML); Artificial intelligence; Machine learning; Random subspace method; Cascading classifiers; Feature selection; Pattern recognition (psychology); Data mining; Mathematics; Statistics","authors":[{"name":"Ronan Assumpção Silva","is_ca":false},{"name":"Alceu S. Britto","is_ca":false},{"name":"Fabrício Enembreck","is_ca":false},{"name":"Robert Sabourin","is_ca":true},{"name":"Luiz S. Oliveira","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1424332155885543,"gpt":0.3272338505991412,"spread":0.1848006350105869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003137795,0.001619078,0.001880155,0.006577248,0.001275333,0.002079327,0.001014663,0.0009567172,0.001799853],"category_scores_gemma":[0.01170502,0.0003434005,0.001133338,0.002645589,0.0004815843,0.00213023,0.001162482,0.0008642677,0.001114095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008933605,"about_ca_system_score_gemma":0.001296688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003573143,"about_ca_topic_score_gemma":0.004209335,"domain_scores_codex":[0.9961644,0.0006711204,0.0002830742,0.0005950283,0.001898696,0.0003875684],"domain_scores_gemma":[0.9948171,0.001960769,0.0003379844,0.0003036865,0.002367473,0.0002130017],"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.000600621,0.0003079294,0.02935731,0.000326074,0.0005091109,0.0004370528,0.0004338051,0.06110443,0.04018976,0.00534323,0.006538694,0.854852],"study_design_scores_gemma":[0.00006437351,0.0006429672,0.02000879,0.0001624894,0.001054072,0.0008227528,0.0007016609,0.9047033,0.04042045,0.01721314,0.01408559,0.0001204723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2087798,0.002532765,0.7756982,0.0005822431,0.0004271478,0.0005489924,0.0003895149,0.001202302,0.009839053],"genre_scores_gemma":[0.7764579,0.0008939664,0.2175129,0.0001315684,0.0004028926,0.0002645133,0.0007327005,0.0001502021,0.003453355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006577248,"threshold_uncertainty_score":0.01659447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2983445208","doi":"10.1142/s0218213019500209","title":"Incremental Subclass Support Vector Machine","year":2019,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Face and Expression Recognition","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 Windsor","funders":"","keywords":"Support vector machine; Computer science; Decision boundary; Classifier (UML); Discriminative model; Artificial intelligence; Convex optimization; Linear classifier; Machine learning; Synthetic data; Regular polygon; Pattern recognition (psychology); Kernel method; Kernel (algebra); Data mining; Mathematics","authors":[{"name":"Amine Besrour","is_ca":false},{"name":"Riadh Ksantini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04618922746386503,"gpt":0.3136424866477004,"spread":0.2674532591838354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008616,0.0007162191,0.001418033,0.001231653,0.0003785534,0.001153137,0.002191306,0.0006608227,0.002049484],"category_scores_gemma":[0.004618397,0.0003178965,0.0008574863,0.001118797,0.0004407182,0.002053159,0.001222686,0.001191985,0.001046682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006359936,"about_ca_system_score_gemma":0.0010282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002587199,"about_ca_topic_score_gemma":0.001961294,"domain_scores_codex":[0.9990981,0.0001437818,0.0000728481,0.0002007303,0.0003837946,0.000100865],"domain_scores_gemma":[0.9977304,0.0005821749,0.0001774079,0.0005001258,0.000903484,0.0001063605],"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.0003024754,0.0001897576,0.005059911,0.000203539,0.0001045524,0.0001670853,0.0001552995,0.1206313,0.009750923,0.009633061,0.007792518,0.8460096],"study_design_scores_gemma":[0.00001073413,0.00006896502,0.00104089,0.00001265604,0.00002499478,0.0001077723,0.0000335488,0.9864456,0.003942329,0.005267594,0.003029863,0.00001508366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05972768,0.0008724722,0.9318672,0.0001761242,0.0001509039,0.0001418289,0.0003745872,0.003218082,0.003471079],"genre_scores_gemma":[0.6833689,0.0007414609,0.3070434,0.0002160569,0.0002103989,0.0002156479,0.002482181,0.0003582439,0.005363575],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002587199,"threshold_uncertainty_score":0.006856203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067564749","doi":"10.1142/s0218213012500030","title":"STOCHASTIC RESOURCE ALLOCATION IN MULTIAGENT ENVIRONMENTS: AN APPROACH BASED ON DISTRIBUTED Q-VALUES AND BOUNDED REAL-TIME DYNAMIC PROGRAMMING","year":2012,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Bounded function; A priori and a posteriori; Mathematical optimization; Heuristic; Convergence (economics); Set (abstract data type); Multi-agent system; Distributed computing; Resource allocation; Dynamic programming; Distributed algorithm; Resource (disambiguation); Reduction (mathematics); Algorithm; Artificial intelligence; Mathematics","authors":[{"name":"Pierrick Plamondon","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03907911182316321,"gpt":0.3112756167984046,"spread":0.2721965049752414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003010325,0.001180822,0.00184924,0.0007727923,0.0006367284,0.001635842,0.002467385,0.001375916,0.001934755],"category_scores_gemma":[0.005009709,0.0007871126,0.001189964,0.0009228187,0.001790194,0.001979548,0.002340951,0.002028353,0.0002823187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001368394,"about_ca_system_score_gemma":0.002010024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002272166,"about_ca_topic_score_gemma":0.001973744,"domain_scores_codex":[0.9978741,0.001114017,0.0000809323,0.0002951518,0.0004605541,0.0001752162],"domain_scores_gemma":[0.9971265,0.002019733,0.0002642294,0.0001652368,0.0002498079,0.0001743874],"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.00003495374,0.0000504555,0.000174011,0.00007048296,0.00004053367,0.00007299742,0.00007808481,0.9180762,0.0006568148,0.06084831,0.000442956,0.01945417],"study_design_scores_gemma":[0.00001061516,0.00002143211,0.00002433336,0.000005858901,0.000005801011,0.00001296562,0.000007855568,0.9744492,0.0001441555,0.02482385,0.0004879532,0.000005940051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001719438,0.00009291098,0.9973344,0.00009323016,0.0000180941,0.00002158784,0.000004897523,0.00003476541,0.0006807503],"genre_scores_gemma":[0.4651992,0.000545579,0.5307378,0.0002415434,0.0001428052,0.0004398961,0.00004952306,0.0001303144,0.002513438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003010325,"threshold_uncertainty_score":0.01592028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056258147","doi":"10.1142/s0218213005002028","title":"APPLICATIVE AND COMBINATORY CATEGORIAL GRAMMAR AND SUBORDINATE CONSTRUCTIONS IN FRENCH","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Natural Language Processing Techniques","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Combinatory categorial grammar; Categorial grammar; Combinatory logic; Computer science; Cognitive grammar; Interrogative; Linguistics; Link grammar; Generalization; Grammar; Mildly context-sensitive grammar formalism; Emergent grammar; Head-driven phrase structure grammar; Generative grammar; Natural language processing; Artificial intelligence; Cognition; Programming language; Mathematics; Psychology","authors":[{"name":"Ismaïl Biskri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02482966883140848,"gpt":0.3139610256161994,"spread":0.2891313567847909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001198139,0.0005102385,0.0003551057,0.002136652,0.001007145,0.00305053,0.0003629892,0.0006068829,0.001585565],"category_scores_gemma":[0.001235827,0.0002358003,0.0009443491,0.00147168,0.005195691,0.001839197,0.0008164599,0.0005834208,0.0002018186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002997367,"about_ca_system_score_gemma":0.001212896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02346492,"about_ca_topic_score_gemma":0.01429953,"domain_scores_codex":[0.9988561,0.0005403673,0.00005249995,0.0001924113,0.0001917188,0.0001669346],"domain_scores_gemma":[0.9991671,0.0003774362,0.0001257048,0.0001068157,0.0001713778,0.00005163489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002349976,0.00000946311,0.004421185,0.00003929824,0.00001479362,0.0004174799,0.003272197,0.00263454,0.001974402,0.9709505,0.0003826696,0.01585977],"study_design_scores_gemma":[0.00001737584,0.00005949861,0.02487675,0.00005914379,0.00007403104,0.001723295,0.003069386,0.02203016,0.00276481,0.8915614,0.05367824,0.0000858536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6199811,0.004247868,0.2829101,0.001649641,0.00008680257,0.00009650946,0.0003661184,0.0007617059,0.08990016],"genre_scores_gemma":[0.9787208,0.0004024846,0.01713314,0.00009060028,0.00002844211,0.0000282067,0.0001092283,0.00004313878,0.003443891],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02346492,"threshold_uncertainty_score":0.04665667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005254071","doi":"10.1142/s0218213007003254","title":"SOLVING INCREMENTAL SATISFIABILITY","year":2007,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","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 Regina","funders":"","keywords":"Satisfiability; Computer science; Completeness (order theory); Boolean satisfiability problem; Propositional calculus; Conjunctive normal form; Approximation algorithm; True quantified Boolean formula; Propositional formula; Mathematical optimization; Upper and lower bounds; Mathematics; Theoretical computer science; Algorithm; Propositional variable","authors":[{"name":"Malek Mouhoub","is_ca":true},{"name":"Samira Sadaoui","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05154072613426004,"gpt":0.3305258114139577,"spread":0.2789850852796977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001592589,0.0006130134,0.0007590812,0.0007795276,0.0006173913,0.000956257,0.001805352,0.0009167158,0.002802696],"category_scores_gemma":[0.008824099,0.000528356,0.00144151,0.001095167,0.0008300873,0.001715877,0.001472267,0.001159787,0.0003150252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000739753,"about_ca_system_score_gemma":0.001980173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002361387,"about_ca_topic_score_gemma":0.004542158,"domain_scores_codex":[0.9986749,0.0005227952,0.00007787766,0.0001665202,0.0004057802,0.000152129],"domain_scores_gemma":[0.9945471,0.004025076,0.0003108136,0.0005959422,0.0004512114,0.00006980402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000227083,0.0003406789,0.004885864,0.001055099,0.0002754741,0.0006207703,0.0005794709,0.4259429,0.01782079,0.1274205,0.007389546,0.4134419],"study_design_scores_gemma":[0.00007835742,0.000142157,0.0006468323,0.00004986347,0.0001150162,0.0002957361,0.0001449806,0.9015918,0.012032,0.07870886,0.006171055,0.00002317158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06003673,0.0003536908,0.9335511,0.0003633449,0.00004540808,0.0002538429,0.0001463051,0.001006032,0.004243468],"genre_scores_gemma":[0.3162474,0.000539333,0.6799832,0.0001503051,0.00005206729,0.000323086,0.0006656356,0.0001146071,0.001924427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002802696,"threshold_uncertainty_score":0.009375989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2109875442","doi":"10.1142/s0218213002000873","title":"DEVELOPING COLLABORATIVE GOLOG AGENTS BY REINFORCEMENT LEARNING","year":2002,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","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":"McGill University","funders":"","keywords":"Computer science; Reinforcement learning; Scalability; Human–computer interaction; Artificial intelligence; Database","authors":[{"name":"IOAN ALFRED LEITA","is_ca":false},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1117068500660333,"gpt":0.3394125118227033,"spread":0.22770566175667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529325,0.000808693,0.0006911219,0.0004440621,0.0006392045,0.001065404,0.001667875,0.001197267,0.00258943],"category_scores_gemma":[0.005784076,0.0005148936,0.0004182712,0.0003119924,0.001264077,0.001598745,0.002086581,0.0009886492,0.0006417769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006354674,"about_ca_system_score_gemma":0.001142138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002296751,"about_ca_topic_score_gemma":0.00242666,"domain_scores_codex":[0.9993216,0.0002677809,0.00003566957,0.0001251115,0.0001501267,0.00009980489],"domain_scores_gemma":[0.9982954,0.0008347442,0.0002551323,0.0002412289,0.0002034422,0.0001699778],"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.0001684968,0.0003658322,0.003330965,0.0001702394,0.0001107708,0.0004052634,0.0008386573,0.8200328,0.008946673,0.04576047,0.001960587,0.1179093],"study_design_scores_gemma":[0.00004166873,0.00008295238,0.0001322513,0.00001576981,0.00001348266,0.00005087741,0.00006608269,0.9783525,0.002273314,0.01544514,0.003513556,0.00001247237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04874993,0.0001429493,0.9458017,0.0002104043,0.00002980977,0.0001983216,0.00001950466,0.0008193642,0.004028026],"genre_scores_gemma":[0.4708869,0.0002066148,0.5245312,0.0001165256,0.00002726744,0.0003753547,0.00008049736,0.0001116388,0.003663928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00258943,"threshold_uncertainty_score":0.008662522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996845866","doi":"10.1142/s0218213006003089","title":"COORDINATION AND APPLICATIVE CATEGORIAL TYPE LOGIC","year":2006,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Categorial grammar; Combinatory categorial grammar; Conjunction (astronomy); Programming language; Type (biology); Process (computing); Artificial intelligence; Generative grammar; Theoretical computer science; Natural language processing; Link grammar; Mildly context-sensitive grammar formalism; Head-driven phrase structure grammar; Emergent grammar","authors":[{"name":"Ismaïl Biskri","is_ca":true},{"name":"Jean-Pierre Desclés","is_ca":false},{"name":"Boucif Amar Bensaber","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04109751950976159,"gpt":0.3361296487219334,"spread":0.2950321292121718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002412315,0.0004813046,0.0005824565,0.001907857,0.001582145,0.004197181,0.001058499,0.001323726,0.0045007],"category_scores_gemma":[0.002718453,0.0004074115,0.001228439,0.001795352,0.005731436,0.004644973,0.002222964,0.001550759,0.0007116355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003027759,"about_ca_system_score_gemma":0.001568651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005026704,"about_ca_topic_score_gemma":0.002376051,"domain_scores_codex":[0.9981179,0.0007124846,0.000134146,0.0003640376,0.0003909737,0.0002804755],"domain_scores_gemma":[0.9982161,0.0008988482,0.0002087717,0.0002942578,0.0002704859,0.0001115308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006851054,0.000002643635,0.0001605547,0.00001638503,0.000004400538,0.00008246742,0.0001908249,0.0007392413,0.0002134054,0.9956412,0.0003857025,0.0025563],"study_design_scores_gemma":[0.00000873805,0.000007482809,0.0001749451,0.00001400003,0.000008963782,0.0001321932,0.00009711742,0.003458832,0.0002850343,0.986504,0.00929955,0.000009198502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.121685,0.007292578,0.6597494,0.007278872,0.0008927489,0.0001142488,0.0004859623,0.00199052,0.2005107],"genre_scores_gemma":[0.9136348,0.001807234,0.0641093,0.0008076064,0.0004698467,0.00008427519,0.0002411578,0.0001931904,0.01865257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005026704,"threshold_uncertainty_score":0.02196801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1976320987","doi":"10.1142/s0218213008003881","title":"TEXT SUMMARIZATION USING LEXICAL COHESION: APPROACHES AND EVALUATIONS","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Topic Modeling","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":"University of Lethbridge","funders":"","keywords":"Computer science; Automatic summarization; Cohesion (chemistry); Popularity; Multi-document summarization; Information retrieval; Context (archaeology); Identification (biology); The Internet; World Wide Web; Natural language processing","authors":[{"name":"Yllias Chali","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3494098354123179,"gpt":0.3781528857572114,"spread":0.02874305034489349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007890316,0.001327245,0.001579926,0.004940256,0.001077234,0.002126431,0.001497676,0.001351528,0.001753422],"category_scores_gemma":[0.02345077,0.0003503506,0.0007332217,0.004406206,0.0007008998,0.003502969,0.001401327,0.0007918322,0.0006320541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125092,"about_ca_system_score_gemma":0.000953374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008003002,"about_ca_topic_score_gemma":0.008066168,"domain_scores_codex":[0.9907938,0.005179578,0.0009154787,0.0007078378,0.002148499,0.0002548173],"domain_scores_gemma":[0.9759098,0.0187174,0.0008845854,0.001073281,0.002896041,0.0005189669],"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.003132878,0.002813724,0.009672636,0.00534467,0.0008167991,0.0003976629,0.003790224,0.0256853,0.03262478,0.001963554,0.01074075,0.903017],"study_design_scores_gemma":[0.002724094,0.01649787,0.0784461,0.0006395018,0.003731417,0.001352092,0.01070341,0.7128103,0.1230464,0.006382276,0.04318734,0.0004791644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.832915,0.01792683,0.1147409,0.0007424783,0.000263906,0.003545745,0.002738366,0.01047614,0.01665058],"genre_scores_gemma":[0.791146,0.005095046,0.1890672,0.0001319953,0.0002343281,0.001187858,0.00861583,0.0004717932,0.004049982],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008003002,"threshold_uncertainty_score":0.0417285,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W125162825","doi":"10.1142/s0218213005002053","title":"CLUSTERING SPATIAL DATA IN THE PRESENCE OF OBSTACLES","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Data Management and Algorithms","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":"University of Regina","funders":"","keywords":"Cluster analysis; Computer science; Preprocessor; Constraint (computer-aided design); Data mining; Clustering high-dimensional data; Computation; Artificial intelligence; Machine learning; Algorithm; Mathematics","authors":[{"name":"Xin Wang","is_ca":true},{"name":"Howard J. Hamilton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1338871831955201,"gpt":0.3589904498955765,"spread":0.2251032667000564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001838535,0.001013173,0.001640563,0.003206386,0.001590956,0.002196279,0.002360574,0.001392603,0.0009067566],"category_scores_gemma":[0.01019428,0.0008333852,0.001252697,0.004941827,0.001179512,0.002378142,0.003107497,0.00110737,0.0004878283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009459452,"about_ca_system_score_gemma":0.002370837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01116093,"about_ca_topic_score_gemma":0.01443866,"domain_scores_codex":[0.9967023,0.0006727919,0.0002748638,0.0006979738,0.001421131,0.0002309561],"domain_scores_gemma":[0.993814,0.002693821,0.0006967721,0.00109879,0.001475355,0.0002213158],"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.0005433247,0.0001326079,0.01366762,0.0006767865,0.0003850799,0.0009363413,0.0008950075,0.7069403,0.01895468,0.01854572,0.00615125,0.2321713],"study_design_scores_gemma":[0.00002261951,0.00004584307,0.002185334,0.00003606578,0.00004000247,0.0002173854,0.0003956769,0.9675279,0.01009553,0.01220016,0.007181476,0.00005202365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05717957,0.0003344456,0.9395683,0.0002637362,0.00005125447,0.0001456917,0.0005554653,0.0007565452,0.001145006],"genre_scores_gemma":[0.3318751,0.0004141589,0.6626278,0.0001203213,0.00005449051,0.0002428069,0.002900306,0.0002251852,0.001539892],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01116093,"threshold_uncertainty_score":0.02219188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075882455","doi":"10.1142/s0218213004001673","title":"A HOPFIELD-TYPE NEURAL NETWORK BASED MODEL FOR TEMPORAL CONSTRAINTS","year":2004,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Constraint Satisfaction and Optimization","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":"University of Regina","funders":"","keywords":"Computer science; Mathematical optimization; Artificial neural network; Constraint (computer-aided design); Hopfield network; Scheduling (production processes); Type (biology); Constraint satisfaction problem; Process (computing); Property (philosophy); Artificial intelligence; Mathematics","authors":[{"name":"Malek Mouhoub","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08868863193232461,"gpt":0.3315453067197102,"spread":0.2428566747873856,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000371737,0.0004566521,0.0004625681,0.000293086,0.000344675,0.0007152525,0.001445094,0.00109941,0.002535044],"category_scores_gemma":[0.0009259777,0.0002340457,0.0004309236,0.0005377229,0.000573475,0.001039525,0.0004149511,0.0008530534,0.0003514046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008534994,"about_ca_system_score_gemma":0.0009516829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01298441,"about_ca_topic_score_gemma":0.0118684,"domain_scores_codex":[0.9998318,0.00003849797,0.000009739114,0.00003998561,0.00005760982,0.00002239497],"domain_scores_gemma":[0.9998049,0.00009954492,0.00002056301,0.00001667557,0.0000462464,0.00001201939],"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.00004195727,0.00002375341,0.0002649446,0.00006837599,0.00002264962,0.00007710415,0.00004108544,0.9467058,0.003476066,0.01728174,0.000579795,0.03141694],"study_design_scores_gemma":[0.000002950699,0.000007049519,0.00002541709,0.000002697101,0.000003435259,0.000009892531,0.000002244031,0.997197,0.0002889031,0.002116536,0.0003411138,0.000002731482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01053821,0.0003689514,0.9845734,0.0001406476,0.00004544836,0.00003160208,0.00007747825,0.0001929395,0.004031341],"genre_scores_gemma":[0.6811782,0.00104657,0.3049968,0.0001617467,0.00008655075,0.0002811402,0.0002670577,0.00005343559,0.0119285],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01298441,"threshold_uncertainty_score":0.02581763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391968356","doi":"10.1142/s0218213024500052","title":"Summary Augmenter: A Text Augmentation Framework to Improve Summarization Quality","year":2024,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Topic Modeling","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":"University of Windsor","funders":"","keywords":"Automatic summarization; Computer science; Quality (philosophy); Information retrieval; Philosophy; Epistemology","authors":[{"name":"Ala Alam Falaki","is_ca":true},{"name":"Robin Gras","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07811631283339375,"gpt":0.3859162627930595,"spread":0.3077999499596657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001253211,0.001532357,0.0008034824,0.001786977,0.0004400803,0.0009899338,0.001016335,0.0009086485,0.005077329],"category_scores_gemma":[0.004993861,0.0002993357,0.0008853143,0.0009870436,0.0003315232,0.002682524,0.000968122,0.001107579,0.002924669],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003949328,"about_ca_system_score_gemma":0.000821636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001955003,"about_ca_topic_score_gemma":0.004142668,"domain_scores_codex":[0.9994986,0.0001428976,0.000053448,0.0001567056,0.0001116384,0.00003666934],"domain_scores_gemma":[0.998349,0.0006075653,0.00019817,0.0003119743,0.0004637361,0.00006954659],"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.0007097663,0.0002805787,0.002378335,0.0006351155,0.0001628844,0.0003255877,0.0005298569,0.04047579,0.06892286,0.003707905,0.02655908,0.8553122],"study_design_scores_gemma":[0.0001827813,0.001221577,0.003803499,0.0001106249,0.0003989602,0.0004726179,0.0003605223,0.8480121,0.09188236,0.01170832,0.04174747,0.00009912714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08483502,0.003550905,0.8590682,0.001110404,0.000550736,0.000427666,0.005267986,0.04021068,0.00497839],"genre_scores_gemma":[0.4266279,0.001302568,0.5399891,0.000493061,0.0006956485,0.0004984554,0.01536746,0.001304938,0.01372092],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005077329,"threshold_uncertainty_score":0.01698536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4214769751","doi":"10.1142/s0218213022500233","title":"Responsive Mixed-initiative System for Reoptimization of Mixed-integer Programming","year":2022,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Optimization and Packing Problems","field":"Engineering","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":"Computer science; Integer programming; Mathematical optimization; Constraint (computer-aided design); Operations research; Linear programming; Kernel (algebra); Integer (computer science); Software; Decision support system; Order (exchange); Optimization problem; Industrial engineering; Artificial intelligence; Algorithm; Operating system","authors":[{"name":"Marc-André Ménard","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":true},{"name":"Jonathan Gaudreault","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06057148518930872,"gpt":0.2972237258359625,"spread":0.2366522406466537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002070633,0.001313758,0.0005807802,0.0006589438,0.0005046317,0.001371907,0.002372237,0.0008845672,0.02349215],"category_scores_gemma":[0.005260344,0.0006455988,0.0007481146,0.0003997122,0.0004740057,0.001214864,0.002531214,0.001482784,0.004643152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004797372,"about_ca_system_score_gemma":0.0009349554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008943399,"about_ca_topic_score_gemma":0.001258657,"domain_scores_codex":[0.9987136,0.0004805959,0.0001043404,0.0002163693,0.0003707964,0.000114355],"domain_scores_gemma":[0.9981306,0.001012731,0.0001232792,0.0003171498,0.0002958214,0.000120448],"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.002875718,0.001114842,0.002265827,0.001206364,0.0002771624,0.000909836,0.001839506,0.1230583,0.08807877,0.07357731,0.05257991,0.6522164],"study_design_scores_gemma":[0.0002035257,0.0002347269,0.0003008061,0.00005618481,0.00003631247,0.0002084823,0.000064914,0.9149002,0.03342066,0.0094236,0.04107938,0.00007105949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00357382,0.00005078865,0.9607958,0.0000372664,0.00002586923,0.0001735602,0.0001255752,0.03167224,0.003545176],"genre_scores_gemma":[0.145133,0.0001152393,0.8370808,0.000231443,0.00004216523,0.001674981,0.001057039,0.005361865,0.009303389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02349215,"threshold_uncertainty_score":0.07858908,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991826621","doi":"10.1142/s0218213007003199","title":"A FAST HYBRID ALGORITHM FOR MULTICAST ROUTING IN WIRELESS NETWORKS","year":2007,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Network Traffic and Congestion Control","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 Ottawa","funders":"","keywords":"Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Computer network; Xcast; Pragmatic General Multicast; Source-specific multicast; Algorithm","authors":[{"name":"Salah Al-Sharhan","is_ca":false},{"name":"Wail Gueaieb","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03618702182338484,"gpt":0.3124522119035435,"spread":0.2762651900801587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001053755,0.0006158647,0.000789454,0.0009215029,0.0006197327,0.0007373199,0.001775479,0.001330613,0.001855843],"category_scores_gemma":[0.001918777,0.0002954057,0.00052632,0.0008847442,0.0006513477,0.001158414,0.001099302,0.0008729006,0.0003560253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006673952,"about_ca_system_score_gemma":0.0006160456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00163795,"about_ca_topic_score_gemma":0.001597124,"domain_scores_codex":[0.9995264,0.0001469057,0.00001855977,0.00005929139,0.0001870457,0.0000617859],"domain_scores_gemma":[0.9993249,0.0004441598,0.00004293863,0.00004489326,0.0001128733,0.00003032905],"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.0001502052,0.0001075967,0.0005720193,0.00009996998,0.00008464776,0.00009207024,0.0001155368,0.6769543,0.00460975,0.03349701,0.002462839,0.2812541],"study_design_scores_gemma":[0.0000226377,0.00005657302,0.00005177421,0.000005308184,0.000008560274,0.00003536655,0.00001000923,0.9931595,0.0005209155,0.004964085,0.001159279,0.000005913559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01027712,0.0002827189,0.9870418,0.0001151397,0.00006425406,0.00004664349,0.00001431145,0.0002928284,0.001865178],"genre_scores_gemma":[0.3455763,0.0003451354,0.648976,0.0002221184,0.00009345751,0.0004205574,0.0001277739,0.00009965849,0.004139054],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001855843,"threshold_uncertainty_score":0.00620842,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171171642","doi":"10.1142/s0218213008003819","title":"LAZY LEARNER ON DECISION TREE FOR RANKING","year":2008,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Imbalanced Data Classification Techniques","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 New Brunswick","funders":"","keywords":"Computer science; Ranking (information retrieval); Tree (set theory); sort; Machine learning; Decision tree; Class (philosophy); Metric (unit); Artificial intelligence; Sample (material); Set (abstract data type); Path (computing); Data mining; Information retrieval; Mathematics","authors":[{"name":"Yuhong Yan","is_ca":false},{"name":"Liang Han","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1407546766654362,"gpt":0.3696724673995253,"spread":0.2289177907340891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006807993,0.001188739,0.002166516,0.002771945,0.0007240653,0.001599997,0.002418138,0.00165461,0.002287717],"category_scores_gemma":[0.01591775,0.0004018252,0.00102601,0.003172512,0.0007994305,0.004164379,0.001223921,0.002788741,0.001657685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327168,"about_ca_system_score_gemma":0.001847734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003404385,"about_ca_topic_score_gemma":0.003927326,"domain_scores_codex":[0.9961146,0.001825028,0.0002149339,0.0005281009,0.001106142,0.0002112035],"domain_scores_gemma":[0.9903165,0.00646178,0.0004069515,0.0009753753,0.001565102,0.0002744309],"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.0003636335,0.0002787618,0.003915123,0.0002484031,0.0001613096,0.000114688,0.0001519457,0.4716972,0.001919744,0.03544491,0.01089284,0.4748114],"study_design_scores_gemma":[0.00002013523,0.00006188363,0.0001384157,0.00001387625,0.00001522453,0.0000338744,0.000009073963,0.9756204,0.0006922487,0.02207516,0.001309655,0.000009975241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01077587,0.0008779604,0.9854006,0.0002707127,0.00007626764,0.00006856261,0.0001593216,0.001407058,0.000963708],"genre_scores_gemma":[0.3210798,0.0008830309,0.6719294,0.0004512335,0.0002954451,0.0003400666,0.0009504243,0.0003344057,0.003736212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006807993,"threshold_uncertainty_score":0.03600454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2606751029","doi":"10.1142/s0218213017600107","title":"Characterizing Users and Tracking Their Activities in Online Classified Ads","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Recommender Systems and Techniques","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 Alberta","funders":"","keywords":"Computer science; Profiling (computer programming); Probabilistic logic; User modeling; Set (abstract data type); Class (philosophy); Generative model; Generative grammar; Data mining; Machine learning; User interface; Human–computer interaction; Information retrieval; Artificial intelligence","authors":[{"name":"Muhammad Waqar","is_ca":true},{"name":"Davood Rafiei","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1620729212358601,"gpt":0.3655221996245478,"spread":0.2034492783886877,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371536,0.0005374652,0.0006497682,0.002071881,0.0004904664,0.001297732,0.0007411636,0.000806152,0.0007996781],"category_scores_gemma":[0.006983208,0.000388996,0.0004556428,0.001960353,0.0003757519,0.001968482,0.0005118191,0.0009632279,0.0006376462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005760685,"about_ca_system_score_gemma":0.0003579521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0109838,"about_ca_topic_score_gemma":0.02115428,"domain_scores_codex":[0.9988752,0.0003920534,0.00007190045,0.0003200118,0.0002350509,0.0001057781],"domain_scores_gemma":[0.9930808,0.003692856,0.001299973,0.00082526,0.0008041334,0.0002969839],"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.0005027294,0.0006257106,0.8154641,0.0001931016,0.0002380399,0.0002567512,0.001441601,0.04973854,0.01166507,0.003493593,0.002453778,0.113927],"study_design_scores_gemma":[0.00001617096,0.0002397158,0.3571438,0.00003537391,0.0001043365,0.0006224692,0.001000069,0.6252254,0.007136131,0.00530113,0.003098052,0.00007735381],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9377967,0.000310865,0.05666012,0.0002620856,0.00002299677,0.0001005863,0.001844058,0.0003288022,0.002673818],"genre_scores_gemma":[0.9784645,0.0001419733,0.0195534,0.00003687465,0.00002395827,0.00002901955,0.0009562112,0.00001685941,0.0007772111],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0109838,"threshold_uncertainty_score":0.02183974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117338530","doi":"10.1142/s0218213013600038","title":"UNCERTAINTY-BASED TRUST ESTIMATION IN A MULTI-VALUED TRUST ENVIRONMENT","year":2013,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Access Control and Trust","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Metric (unit); Reliability (semiconductor); Trustworthiness; Set (abstract data type); Service provider; Service (business); Measure (data warehouse); Domain (mathematical analysis); Order (exchange); Certainty; Trust management (information system); Data mining; Knowledge management; Computer security","authors":[{"name":"Sina Honari","is_ca":true},{"name":"Brigitte Jaumard","is_ca":true},{"name":"Jamal Bentahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07972065461694751,"gpt":0.3620901054463218,"spread":0.2823694508293743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005914062,0.0008962888,0.001404998,0.001533284,0.0006242882,0.003011364,0.001489488,0.001371297,0.0007654724],"category_scores_gemma":[0.02787574,0.0005417559,0.0009807191,0.001329506,0.001625137,0.003786355,0.002198326,0.00169721,0.0001278037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002435086,"about_ca_system_score_gemma":0.00094669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005416745,"about_ca_topic_score_gemma":0.002360253,"domain_scores_codex":[0.9931526,0.003536176,0.0005119907,0.001013722,0.001418315,0.0003671274],"domain_scores_gemma":[0.9799687,0.01498453,0.002284033,0.0006771017,0.001616098,0.0004693538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001835893,0.00003840465,0.003306997,0.0001477988,0.0001032849,0.0002832856,0.0004000707,0.9394408,0.001386118,0.02827044,0.0002956612,0.02614339],"study_design_scores_gemma":[0.000003445325,0.00002451028,0.0003176513,0.00001133649,0.000008621551,0.00003130834,0.00003201621,0.9919018,0.0002661655,0.007294911,0.00009848492,0.000009701516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04584504,0.0003238089,0.9526007,0.0002165,0.00001767728,0.00004024734,0.00005399224,0.00008977865,0.00081233],"genre_scores_gemma":[0.9033179,0.0002208872,0.09584264,0.00003347383,0.00002629075,0.00006108086,0.00009122414,0.00001797126,0.000388609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005914062,"threshold_uncertainty_score":0.03127694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406808063","doi":"10.1142/s0218213025500046","title":"An Interactive Real-Time 3D Representation of a Heart Using a 2D Ultrasound Vest: Proof of Concept","year":2025,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Surgical Simulation and Training","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"VEST; Proof of concept; Representation (politics); Computer science; Computer graphics (images); Computer vision; Computer security","authors":[{"name":"Gail S. Goodman","is_ca":false},{"name":"N. Bourbakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09905747431214974,"gpt":0.4350842914214856,"spread":0.3360268171093359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944651,0.000627163,0.0004110485,0.0002528247,0.0001717113,0.0007366672,0.001399384,0.001083817,0.004617795],"category_scores_gemma":[0.0007893994,0.0003321423,0.0008021696,0.0001270879,0.0003875587,0.0007489292,0.001031914,0.0005251497,0.0007193887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001879656,"about_ca_system_score_gemma":0.0003504961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005030315,"about_ca_topic_score_gemma":0.0004242006,"domain_scores_codex":[0.9996525,0.00004733349,0.00001536324,0.00004939915,0.0002041894,0.00003123035],"domain_scores_gemma":[0.99979,0.0000742574,0.00003074213,0.00002192896,0.00004200512,0.00004116023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003458148,0.0004258087,0.00148601,0.001816706,0.0001424303,0.005067341,0.0006633175,0.1165389,0.6853014,0.02016314,0.01375582,0.1542934],"study_design_scores_gemma":[0.0003236368,0.003061652,0.001996539,0.0002310058,0.0001232333,0.007323923,0.0002955579,0.6069922,0.2644696,0.006032394,0.1087851,0.0003651266],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06579815,0.001897064,0.9114078,0.001369166,0.001207824,0.0005903272,0.0008435314,0.002479491,0.01440664],"genre_scores_gemma":[0.4742837,0.002232903,0.5103164,0.0006410144,0.0001533096,0.0009325184,0.0006065022,0.0002343213,0.01059921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004617795,"threshold_uncertainty_score":0.01544803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015512848","doi":"10.1142/s0218213003001241","title":"Active Tracking and Cloning of Facial Expressions Using Spatio-Temporal Information","year":2003,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":0,"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":"Computer science; Facial expression; Computer vision; Artificial intelligence; Optical flow; Motion estimation; Animation; Facial motion capture; Computer facial animation; Coding (social sciences); Feature (linguistics); Face (sociological concept); Pattern recognition (psychology); Computer animation; Facial recognition system; Face detection; Computer graphics (images); Image (mathematics); Mathematics","authors":[{"name":"Lijun Yin","is_ca":false},{"name":"Anup Basu","is_ca":true},{"name":"Matt T. Yourst","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08602277891225298,"gpt":0.3664848112884902,"spread":0.2804620323762372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004845661,0.0004254204,0.0003550045,0.0004314727,0.0001943056,0.0004146421,0.0005840367,0.0003360192,0.0007288793],"category_scores_gemma":[0.001368092,0.0002599318,0.000417671,0.0002645144,0.0004374215,0.0007936592,0.0003916174,0.000420651,0.0002762335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003204134,"about_ca_system_score_gemma":0.000319797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009872514,"about_ca_topic_score_gemma":0.001244689,"domain_scores_codex":[0.9997076,0.00005785752,0.00001219675,0.00008282556,0.0001186247,0.00002091735],"domain_scores_gemma":[0.9995143,0.0001867101,0.00008831052,0.00009106314,0.00009433331,0.00002523124],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002524649,0.00007885238,0.001059202,0.0001075805,0.00003768287,0.0001568363,0.0004033133,0.02225158,0.5610225,0.009333936,0.0007140096,0.4045821],"study_design_scores_gemma":[0.00003238233,0.0003000401,0.004383248,0.00003431573,0.0001032754,0.0005147466,0.0001262842,0.6592566,0.3199707,0.004650368,0.01056981,0.00005820799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03686836,0.0002034652,0.9614649,0.00005971088,0.00003865068,0.00003136871,0.00002296917,0.0002239866,0.001086645],"genre_scores_gemma":[0.3940945,0.0005761602,0.5998546,0.00008237945,0.00005984534,0.0001196695,0.0001104885,0.0001128535,0.004989467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0009872514,"threshold_uncertainty_score":0.002562702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092368578","doi":"10.1142/s0218213005002351","title":"A COLLAPSING METHOD FOR THE EFFICIENT RECOVERY OF OPTIMAL EDGES IN PHYLOGENETIC TREES","year":2005,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Caprion (Canada)","funders":"","keywords":"Phylogenetic tree; Computer science; Context (archaeology); Inference; Set (abstract data type); Tree (set theory); Mathematical proof; Binary number; Algorithm; Enhanced Data Rates for GSM Evolution; Binary tree; Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence; Biology; Paleontology","authors":[{"name":"Michael H. Hu","is_ca":false},{"name":"Paul Kearney","is_ca":true},{"name":"Jonathan H. Badger","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04881618195269857,"gpt":0.3405609273709421,"spread":0.2917447454182435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002375645,0.0007088921,0.0009384473,0.001569768,0.001239439,0.001120432,0.001888837,0.001051586,0.003131117],"category_scores_gemma":[0.01117943,0.0007407403,0.001021484,0.001955978,0.001223355,0.001678366,0.002450479,0.002528081,0.001215711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004891008,"about_ca_system_score_gemma":0.001152416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001495344,"about_ca_topic_score_gemma":0.001828617,"domain_scores_codex":[0.9986801,0.0004128591,0.0001011732,0.0003133127,0.000393827,0.00009870956],"domain_scores_gemma":[0.9951751,0.002366208,0.0003589017,0.001359047,0.000539727,0.0002008871],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002724559,0.0001118227,0.002689512,0.0003059232,0.0001101302,0.0002953538,0.0006417689,0.1046614,0.03705386,0.07245714,0.005098783,0.7763018],"study_design_scores_gemma":[0.00005627502,0.0001123425,0.001256654,0.00003687344,0.0000405854,0.0003273535,0.00009713367,0.9057319,0.01503549,0.06786695,0.009378876,0.0000595292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004286319,0.00006777182,0.995006,0.00003694482,0.00001395418,0.00002494682,0.00004236723,0.0003249946,0.0001967098],"genre_scores_gemma":[0.03293293,0.00008385965,0.9659795,0.00004986116,0.00002770112,0.00007043396,0.0002460338,0.0001596837,0.0004499662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003131117,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407150651","doi":"10.1142/s0218213025010018","title":"Editorial: Recognizing Professor and Asia University President Jeffrey P. Tsai’s Contributions to IJAIT","year":2024,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"Higher Education Governance and Development","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Library science; Political science; Classics; Art; Computer science","authors":[{"name":"Nikolaos Bourbakis","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04699501268581594,"gpt":0.3913760331776523,"spread":0.3443810204918363,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006043891,0.002807318,0.002913615,0.003111686,0.003657151,0.009547942,0.003032158,0.01781973,0.0157663],"category_scores_gemma":[0.04140905,0.001130988,0.003182293,0.001553716,0.002607231,0.004181668,0.00173447,0.0281587,0.01447115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003244777,"about_ca_system_score_gemma":0.004268697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002293929,"about_ca_topic_score_gemma":0.005759971,"domain_scores_codex":[0.9954967,0.0005346661,0.0006033056,0.0007036584,0.002270232,0.0003914504],"domain_scores_gemma":[0.9713212,0.009217188,0.00192915,0.0006701904,0.0127138,0.004148424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002085272,0.000008767377,0.00002963466,0.00006081919,0.00001044061,0.00008993244,0.000008527769,0.00001721589,0.00003513763,0.0001567977,0.9979548,0.001607007],"study_design_scores_gemma":[0.00004029486,0.00002387082,0.0004053817,0.0002850022,0.00004408927,0.0002805133,0.00006127029,0.0001722594,0.0001552459,0.0008755735,0.997631,0.00002550684],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.00003823085,0.001414482,0.0000778683,0.07198212,0.9253603,0.00001602808,0.0000437331,0.00003221332,0.001035099],"genre_scores_gemma":[0.000610661,0.001896496,0.00009965691,0.04205597,0.945318,0.00002669666,0.00002895649,0.0000336053,0.009930011],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.01781973,"threshold_uncertainty_score":0.05274349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}