{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001045075,0.0001744439,0.0002635465,0.0003475375,0.000108622,0.0009395748,0.002073451,0.00008017077,0.00006235111],"category_scores_gemma":[0.0007150588,0.0001457355,0.0002165996,0.0003912793,0.00006116352,0.0005469344,0.0001573711,0.0002802944,0.0002361458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001888372,"about_ca_system_score_gemma":0.0001892328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002616537,"about_ca_topic_score_gemma":0.00000659041,"domain_scores_codex":[0.9975277,0.0001014495,0.000890752,0.0002535987,0.0009100749,0.0003164783],"domain_scores_gemma":[0.9973928,0.0002430402,0.0005873851,0.0002657195,0.001331938,0.0001790581],"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.00009791301,0.0003242306,0.0004605559,0.000003369314,0.00009355223,0.0005648108,0.001027496,0.06227547,0.001348418,0.5991895,0.0003911726,0.3342235],"study_design_scores_gemma":[0.0002492578,0.0007747686,0.001611205,0.0005510321,0.00004023022,0.004365072,0.001190718,0.903924,0.01579116,0.05099833,0.01976084,0.0007433296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07306461,0.000687519,0.9108782,0.000852841,0.004700581,0.0001089506,0.000001753086,0.00006094747,0.009644533],"genre_scores_gemma":[0.9897953,0.0001016932,0.008661092,0.0001438382,0.001082286,0.000002689384,9.785592e-7,0.000008771995,0.0002033093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9167307,"threshold_uncertainty_score":0.9060342,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000513339,0.0001327516,0.0001776471,0.0003233637,0.000125094,0.0003490662,0.0006045225,0.00005108109,0.00001235204],"category_scores_gemma":[0.0001650532,0.0001286467,0.00007135094,0.000350992,0.00007942957,0.001406466,0.0001874014,0.0002067798,0.00001078969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001632175,"about_ca_system_score_gemma":0.000132603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004002503,"about_ca_topic_score_gemma":0.0002145218,"domain_scores_codex":[0.9980414,0.00008842477,0.0009347881,0.0002541205,0.0005150461,0.0001662243],"domain_scores_gemma":[0.998424,0.0003473888,0.0003879959,0.0001386093,0.0006404829,0.00006154866],"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.00005571161,0.002246934,0.02048886,0.0000069225,0.00008220722,0.003976652,0.00142755,0.1860197,0.0005686473,0.1031255,0.0002919552,0.6817094],"study_design_scores_gemma":[0.0004075681,0.0006209554,0.1406657,0.0001069973,0.00002922599,0.01362937,0.003786036,0.6795356,0.001457392,0.1576147,0.001505966,0.000640453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4216699,0.0001343304,0.5770057,0.0006385241,0.0003215933,0.0001356945,0.000007719918,0.00002137848,0.00006513854],"genre_scores_gemma":[0.8988336,0.00001993854,0.1007153,0.00005320159,0.0003384093,0.00001164708,0.000005247567,0.00000598178,0.00001666696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.681069,"threshold_uncertainty_score":0.5246061,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004757637,0.000171392,0.0002224934,0.0004027339,0.0002288869,0.0003598559,0.0006982529,0.00009022366,0.00004327224],"category_scores_gemma":[0.0008925609,0.0001710555,0.0001922281,0.0002970202,0.0001762194,0.001575927,0.00007064255,0.0002391328,0.00001033506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001791284,"about_ca_system_score_gemma":0.0004069254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001175666,"about_ca_topic_score_gemma":0.00000803412,"domain_scores_codex":[0.9978829,0.0000441685,0.0009774795,0.000258863,0.0005915426,0.0002450547],"domain_scores_gemma":[0.9970784,0.0002522557,0.00070664,0.0001309895,0.001709521,0.0001222148],"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.0001239909,0.000111074,0.000532501,0.000009011669,0.00008953213,0.00004716405,0.001130033,0.403867,0.003863132,0.005401807,0.00000974351,0.584815],"study_design_scores_gemma":[0.0003145295,0.0002132228,0.0001692082,0.0001375197,0.00002103975,0.002460943,0.0009942205,0.9294207,0.06341325,0.001270628,0.001290062,0.0002946834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2428929,0.00002380241,0.7543805,0.0006299106,0.001779822,0.0002166821,0.000005324442,0.00004112303,0.00002996171],"genre_scores_gemma":[0.6319713,0.00002274019,0.3674454,0.00006380275,0.0004726339,0.00000546246,0.000002449418,0.000008483615,0.00000775969],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5845203,"threshold_uncertainty_score":0.6975442,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543962,0.0001512861,0.0002011014,0.0002682441,0.0001484346,0.0003962283,0.002017144,0.00006463878,0.0002330402],"category_scores_gemma":[0.0006267024,0.000106389,0.0002619936,0.0001866928,0.00005940019,0.0008370716,0.00009116138,0.0001683606,0.0001221067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009324035,"about_ca_system_score_gemma":0.0002144875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000406057,"about_ca_topic_score_gemma":0.0000252608,"domain_scores_codex":[0.997682,0.0001226855,0.0009970128,0.000200208,0.000775029,0.0002230986],"domain_scores_gemma":[0.9971318,0.0007555397,0.000772718,0.0003109298,0.0009400777,0.00008895034],"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.0009783279,0.00106626,0.001085272,0.00005826349,0.0007106656,0.0001775225,0.007883687,0.008195634,0.01942967,0.2671668,0.004055822,0.6891921],"study_design_scores_gemma":[0.0004257005,0.0004054393,0.003828651,0.0003242276,0.00007304138,0.0001360851,0.0007272904,0.808554,0.1205563,0.05366074,0.01088468,0.0004238103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03089471,0.00008571563,0.9619158,0.002588776,0.003840736,0.0003130533,0.00001478076,0.00002726664,0.0003191711],"genre_scores_gemma":[0.9741133,0.00002888253,0.02462917,0.000532428,0.0005138769,0.00001857721,0.000002821172,0.00001271225,0.0001482734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9432185,"threshold_uncertainty_score":0.4338419,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004427085,0.0001132089,0.0001837722,0.00004819852,0.0002675814,0.000200061,0.0006143672,0.00003787955,0.0001969908],"category_scores_gemma":[0.0000319278,0.00008472697,0.0002570788,0.0001801736,0.0002354239,0.0003458573,0.00006742354,0.0002164784,0.00000712337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003476063,"about_ca_system_score_gemma":0.0001125145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000291498,"about_ca_topic_score_gemma":0.00001318352,"domain_scores_codex":[0.9982129,0.00006058334,0.0009116255,0.00009876263,0.000503287,0.0002127831],"domain_scores_gemma":[0.9979184,0.0001558037,0.0007410349,0.00007127382,0.001076007,0.00003743863],"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.00009879903,0.0001446264,0.004932818,0.000001999754,0.0002157384,0.000006517969,0.0006492764,0.04584836,0.003191998,0.785334,0.0009500983,0.1586258],"study_design_scores_gemma":[0.0001874553,0.0001785678,0.008126752,0.0001427646,0.00008091559,0.00002208357,0.007696362,0.07810552,0.01572794,0.8783983,0.01075756,0.0005757648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7630327,0.0002014601,0.2264719,0.001594365,0.005245082,0.0001626204,0.00008261725,0.000009909103,0.003199346],"genre_scores_gemma":[0.9941072,0.00001756876,0.00200024,0.0000227722,0.003768682,0.000001513511,0.000006829753,0.000008320556,0.0000668108],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2310746,"threshold_uncertainty_score":0.3455065,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003895281,0.0001366603,0.0002194137,0.0004400241,0.00003590233,0.00007602723,0.0008052152,0.00008316962,0.0005664955],"category_scores_gemma":[0.002324794,0.0001274991,0.0001062959,0.0002387373,0.0002534372,0.0003482575,0.00008543982,0.0004849408,0.00007145134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009900583,"about_ca_system_score_gemma":0.00007640949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000032492,"about_ca_topic_score_gemma":0.000005782161,"domain_scores_codex":[0.9981397,0.00003625906,0.0008179115,0.0001107579,0.00067042,0.0002249431],"domain_scores_gemma":[0.9980457,0.0004036792,0.0002457263,0.0001422177,0.001081677,0.0000810432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002697859,0.000144948,0.003126444,0.00003109051,0.0002223196,0.0001012867,0.0001961308,0.2001391,0.07078636,0.001319878,0.0004413598,0.7232213],"study_design_scores_gemma":[0.00009708551,0.0005715627,0.0005308423,0.0002143325,0.0000166671,0.00004034064,0.0003590866,0.325117,0.6637883,0.004608433,0.004424349,0.000232027],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1666917,0.0001613937,0.8300894,0.0007799866,0.001269537,0.0001033346,0.00001796833,0.0001006947,0.0007859464],"genre_scores_gemma":[0.9878408,0.00007497564,0.01148757,0.00006724753,0.0004785253,0.000002831372,0.000004071049,0.00002515051,0.00001878396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8211491,"threshold_uncertainty_score":0.6202729,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007552704,0.00009263371,0.0001098344,0.0001000242,0.0005717055,0.001134735,0.001000381,0.00002724004,0.00003124411],"category_scores_gemma":[0.0006577141,0.00006801778,0.0001030432,0.00003204575,0.00016081,0.001193918,0.0001804132,0.0001397116,0.000007432344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008691169,"about_ca_system_score_gemma":0.0001256815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002950183,"about_ca_topic_score_gemma":0.00004680333,"domain_scores_codex":[0.9988959,0.00003408168,0.0004315484,0.0001549392,0.0003265885,0.0001569267],"domain_scores_gemma":[0.9980524,0.0003700682,0.0005718604,0.0002236648,0.0007165697,0.00006543797],"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.00004716346,0.00006654391,0.0001667653,0.000001681324,0.0001009986,0.000009736465,0.0004303258,0.004723724,0.0005930392,0.09647484,0.0001619091,0.8972233],"study_design_scores_gemma":[0.0004143201,0.0003464091,0.01383713,0.0001579325,0.00006096561,0.0005456413,0.0009084663,0.863197,0.02254906,0.09177373,0.005836682,0.0003726462],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001123951,0.00006213642,0.9865174,0.01045681,0.001375213,0.0002280153,0.00001404847,0.0000126264,0.0002097671],"genre_scores_gemma":[0.9343732,0.0001648308,0.06495406,0.0001485189,0.000270551,0.00001450337,0.000001023456,0.000005173377,0.00006814918],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9332492,"threshold_uncertainty_score":0.9999022,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001960389,0.0001475751,0.000314094,0.0004435548,0.0002914992,0.001597614,0.00185737,0.00007262535,0.00002859788],"category_scores_gemma":[0.0009811614,0.0001309578,0.0001957863,0.000131085,0.0001093343,0.001598612,0.000165068,0.0002282019,0.00000298456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000560325,"about_ca_system_score_gemma":0.0001486122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001936374,"about_ca_topic_score_gemma":0.000006204681,"domain_scores_codex":[0.9982886,0.000118903,0.0007213041,0.0002760949,0.0003693908,0.0002256853],"domain_scores_gemma":[0.9972199,0.0007297472,0.0008638148,0.0003534179,0.0006578281,0.0001752968],"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.0002022739,0.0001234147,0.003901884,0.00000682379,0.0007756993,0.0001292408,0.002533162,0.0629588,0.0008422555,0.008198528,0.0001493054,0.9201786],"study_design_scores_gemma":[0.0000702537,0.0003740941,0.004041809,0.00005101786,0.0001259693,0.00009734807,0.0002368171,0.9624017,0.002870729,0.02857606,0.0009626886,0.0001914648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06315614,0.0000983069,0.9333087,0.002520657,0.0007295724,0.00007609831,0.00001222281,0.00001885818,0.00007941448],"genre_scores_gemma":[0.529996,0.0000121472,0.4696578,0.0001646233,0.0001261878,0.000002856824,0.000005295192,0.000005948291,0.00002913144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9199871,"threshold_uncertainty_score":0.9994388,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00199734,0.0001986417,0.0003262039,0.000612016,0.0000925534,0.0004391765,0.002212394,0.0001083327,0.000009297561],"category_scores_gemma":[0.000941286,0.0001784586,0.0002319902,0.0001977955,0.00007756868,0.000687426,0.0001049204,0.0004357439,0.000009162165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001540021,"about_ca_system_score_gemma":0.0003874529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005520799,"about_ca_topic_score_gemma":0.000008233709,"domain_scores_codex":[0.9967187,0.00009220278,0.001351605,0.0003036643,0.001230959,0.000302841],"domain_scores_gemma":[0.9951596,0.0015482,0.0008253023,0.0003873988,0.001933585,0.0001459331],"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.00008965323,0.0001742249,0.00006498396,0.00002475843,0.00003423414,0.00002650317,0.0001313126,0.8960264,0.0119144,0.006834488,0.00001221194,0.08466688],"study_design_scores_gemma":[0.0001168746,0.0001717239,0.00002278234,0.00027518,0.000006447281,0.00002900175,0.00005491419,0.766527,0.230968,0.00163641,0.0000664641,0.0001252304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09012727,0.00003161659,0.9055964,0.0003175908,0.003478172,0.0002669251,0.00002495803,0.00003214872,0.0001249304],"genre_scores_gemma":[0.8261215,0.00000185789,0.1733559,0.00009358159,0.0003896978,0.00001094474,0.000001709522,0.00001574816,0.000009053531],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7359943,"threshold_uncertainty_score":0.7277333,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002631734,0.0001643914,0.0003038279,0.000553684,0.0005142219,0.001056803,0.001453249,0.0001247977,0.0003418893],"category_scores_gemma":[0.01002707,0.0001445113,0.0001536949,0.0002564289,0.0004222467,0.002002891,0.0002165884,0.0004096012,0.0001173653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001149364,"about_ca_system_score_gemma":0.0001360717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009321886,"about_ca_topic_score_gemma":0.0001799653,"domain_scores_codex":[0.9970667,0.0002177508,0.00134186,0.0003347125,0.0008491412,0.0001897938],"domain_scores_gemma":[0.9951645,0.0007199794,0.001445795,0.0003993938,0.002125085,0.0001452158],"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.00139238,0.004408658,0.04529946,0.000007465893,0.0004350019,0.0002602048,0.007844365,0.4442119,0.009952974,0.1220917,0.0007070775,0.3633889],"study_design_scores_gemma":[0.003342828,0.0004877009,0.1096241,0.0003511421,0.0001176307,0.0005431423,0.02247679,0.6763958,0.03651574,0.1417598,0.007155774,0.001229589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07592902,0.00003296473,0.9173955,0.002571258,0.003666582,0.0002352462,0.00006914944,0.00001383286,0.00008641918],"genre_scores_gemma":[0.95747,0.0000894468,0.04153959,0.00008688796,0.0003961539,0.00001215017,0.000005096895,0.00001175775,0.0003889088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.881541,"threshold_uncertainty_score":0.9999802,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007303922,0.0001324721,0.0001865607,0.0001399964,0.0001453043,0.0001667374,0.0002849327,0.00007328788,0.0001192867],"category_scores_gemma":[0.000122723,0.0001013387,0.0001536257,0.0001961571,0.0001038009,0.0005646342,0.00003089993,0.0002028724,0.0001090171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000154177,"about_ca_system_score_gemma":0.00008977628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002202485,"about_ca_topic_score_gemma":0.00001480609,"domain_scores_codex":[0.9984609,0.0000478242,0.0007908958,0.00009982153,0.0004160946,0.0001844012],"domain_scores_gemma":[0.9990797,0.00008687781,0.000283877,0.0000909988,0.0003876589,0.00007085953],"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.0003697858,0.00007445672,0.000004587228,0.00001109341,0.0002989044,0.00001856157,0.0003547093,0.908976,0.01595839,0.00999721,0.0003127905,0.06362356],"study_design_scores_gemma":[0.0006969787,0.0008646903,0.000248105,0.0004434179,0.0003961048,0.001260776,0.001491627,0.8133115,0.06020628,0.1073502,0.01298176,0.0007486171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.106016,0.00006123984,0.8866608,0.0001729942,0.005774379,0.0001571543,0.000005970725,0.00003691814,0.001114507],"genre_scores_gemma":[0.9937755,0.00004930516,0.004839704,0.00003690883,0.001211799,0.000005816372,0.00001183254,0.00001857074,0.00005049955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8877595,"threshold_uncertainty_score":0.4132472,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008034055,0.0001070545,0.0001540377,0.0002032732,0.00005988707,0.0003748101,0.000834631,0.00006071838,0.00002236729],"category_scores_gemma":[0.002022199,0.00008874584,0.0001407243,0.0001428417,0.0000664994,0.0008882964,0.00007648996,0.0001582432,0.00000429977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006127883,"about_ca_system_score_gemma":0.00008065134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005009346,"about_ca_topic_score_gemma":0.000004263081,"domain_scores_codex":[0.9987285,0.00005077357,0.0005231994,0.0001818869,0.0003590804,0.0001566182],"domain_scores_gemma":[0.9982017,0.0004477804,0.0003222318,0.0001358936,0.000817966,0.00007439141],"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.00002092719,0.00005544606,0.0001627685,0.000004986974,0.00003341932,0.00004061127,0.0001464473,0.0000273183,0.0005467947,0.746877,0.0003044201,0.2517798],"study_design_scores_gemma":[0.00003358118,0.0002011711,0.00001275723,0.00005799883,0.000008513651,0.0001962843,0.00006612152,0.002055675,0.1058356,0.8873132,0.0040973,0.0001217273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002858846,0.001334273,0.9926097,0.001987297,0.0009304192,0.0001236255,0.00000364537,0.00007749558,0.00007469536],"genre_scores_gemma":[0.3204553,0.0001601497,0.6787601,0.0004392388,0.0001431661,0.00001298607,5.657827e-7,0.00000605069,0.00002250883],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3175964,"threshold_uncertainty_score":0.361895,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006809536,0.000113494,0.0001469851,0.0002762858,0.0001104299,0.0003198163,0.0009925101,0.00008863307,0.000006793965],"category_scores_gemma":[0.0002453898,0.0001048006,0.0001930289,0.000201169,0.00004434073,0.0006073545,0.00004492256,0.000172469,0.000006985729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001000674,"about_ca_system_score_gemma":0.000071783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003131335,"about_ca_topic_score_gemma":0.000002218416,"domain_scores_codex":[0.9986359,0.0000416739,0.0005755926,0.0002011474,0.0004095799,0.0001361216],"domain_scores_gemma":[0.9979498,0.0001558019,0.0004517847,0.0002010603,0.001171982,0.00006952597],"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.00006088118,0.0002297045,0.000005629273,0.000004714349,0.00002498654,5.304569e-7,0.0001036473,0.05616777,0.009717348,0.2002229,0.0001185822,0.7333432],"study_design_scores_gemma":[0.00005491007,0.0001768445,0.00001320124,0.000008852054,0.000006887336,0.00001430796,0.00001958459,0.7606593,0.1563855,0.08115213,0.001419315,0.00008909983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001764881,0.000008653069,0.9957086,0.001318793,0.0004569509,0.0002134934,0.000005031243,0.00006690373,0.0004566658],"genre_scores_gemma":[0.7503142,0.00000339248,0.2490762,0.0002909575,0.0002311668,0.00003714759,0.000003887775,0.000007642018,0.00003543245],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7485493,"threshold_uncertainty_score":0.4273645,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005053315,0.00008425799,0.000180843,0.0003544418,0.0004073509,0.0004303711,0.0009615892,0.0002190417,0.000225148],"category_scores_gemma":[0.007576494,0.00006453595,0.000197475,0.0007429525,0.0006611874,0.0006248766,0.0000626061,0.0008403447,0.00005293154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001787263,"about_ca_system_score_gemma":0.0004901672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002854599,"about_ca_topic_score_gemma":0.0004346543,"domain_scores_codex":[0.997244,0.0002739785,0.0006748865,0.00009578373,0.00144433,0.0002670049],"domain_scores_gemma":[0.9956917,0.00196883,0.0004267867,0.00009382302,0.001705559,0.0001133318],"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.00008150673,0.00004625368,0.0001115284,0.000003276069,0.00009761883,0.00004580508,0.02253795,0.001377927,0.0007885027,0.9543881,0.004164426,0.01635709],"study_design_scores_gemma":[0.0000422495,0.0001497738,0.0001697506,0.0001192306,0.00002077069,0.0000069254,0.06473413,0.0005750254,0.004902737,0.917955,0.011206,0.0001184119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.1289232,0.0001450827,0.1236316,0.6857771,0.01022967,0.0004585212,0.00003730295,0.0001021296,0.05069542],"genre_scores_gemma":[0.9964623,0.0007333075,0.0001210428,0.001452249,0.00102647,0.00000144049,0.000001258749,0.000008790936,0.0001931153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8675392,"threshold_uncertainty_score":0.9070319,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003560096,0.00009994011,0.0001420978,0.0002838328,0.0001067403,0.0002240562,0.0007134603,0.00004054477,0.00009117334],"category_scores_gemma":[0.0001926048,0.00008220232,0.0001072271,0.0002078093,0.00008806563,0.001157437,0.00004334463,0.000142336,0.00001838672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006376539,"about_ca_system_score_gemma":0.0002736404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007203743,"about_ca_topic_score_gemma":0.00001263077,"domain_scores_codex":[0.9985369,0.00002743584,0.0005524883,0.0001533911,0.0005722516,0.0001574821],"domain_scores_gemma":[0.9975816,0.0002312652,0.0002842924,0.0001200448,0.001698167,0.00008463612],"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.0002596775,0.0001456996,0.001851596,0.000004623549,0.0001323401,0.0002288949,0.001170636,0.05028005,0.001714225,0.08989841,0.0002655032,0.8540484],"study_design_scores_gemma":[0.0009945764,0.002158219,0.01352055,0.0004593708,0.00006293269,0.01208968,0.001888799,0.6015646,0.3171228,0.03815108,0.01067506,0.001312307],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03783125,0.00002415,0.9587816,0.002098637,0.0008319589,0.000117854,0.000004448741,0.00002479196,0.0002853166],"genre_scores_gemma":[0.8593645,0.00006606372,0.1398981,0.0002123941,0.0003898694,0.000003315246,0.000002556381,0.000007189798,0.00005605679],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8527361,"threshold_uncertainty_score":0.3352113,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001702011,0.0001379893,0.0002292364,0.0003252112,0.00008698573,0.0006186687,0.002059198,0.00009628874,0.00002328923],"category_scores_gemma":[0.001270585,0.0001166324,0.0001512678,0.0002298643,0.00008273403,0.001825571,0.0000988566,0.0002607188,0.000006850095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001234113,"about_ca_system_score_gemma":0.0001145316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001278648,"about_ca_topic_score_gemma":0.00001039099,"domain_scores_codex":[0.9981955,0.0001577329,0.0006962194,0.0002443317,0.0004497489,0.0002564783],"domain_scores_gemma":[0.9970258,0.000643713,0.0005704364,0.0001917935,0.001471655,0.00009657696],"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.0001092875,0.0000999397,0.00003933672,0.000002254422,0.00003495531,0.00009800574,0.0005546983,0.0002079887,0.01152206,0.184591,0.00002461642,0.8027158],"study_design_scores_gemma":[0.00005315051,0.0006677079,0.00002693797,0.00008207297,0.00001513108,0.0007027828,0.0003494014,0.01823728,0.1992632,0.7780498,0.002340283,0.0002123255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005302378,0.00035189,0.9903498,0.002478508,0.001219043,0.0001562399,0.000002455462,0.00009661617,0.00004304931],"genre_scores_gemma":[0.3459834,0.00002365041,0.6532061,0.0003144205,0.0004472477,0.000006760949,0.000001897991,0.000006973295,0.000009579807],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8025035,"threshold_uncertainty_score":0.5965837,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004411757,0.00009900195,0.0001504648,0.0002364938,0.00007737794,0.0001381326,0.0009467818,0.00004554896,0.00004966975],"category_scores_gemma":[0.0001983996,0.00009316202,0.0001414742,0.0002620741,0.00006921451,0.0009092891,0.0001053584,0.0001810873,0.00002947199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009105985,"about_ca_system_score_gemma":0.0001007649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008811663,"about_ca_topic_score_gemma":0.000008284293,"domain_scores_codex":[0.9980469,0.0000394403,0.000948406,0.0001433157,0.0006836814,0.0001382981],"domain_scores_gemma":[0.9977067,0.000230017,0.0007380054,0.000146496,0.001131267,0.00004754671],"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.00002684085,0.0002133566,0.0003956489,0.000003038711,0.00004730869,0.00001725022,0.0002220894,0.2483941,0.007243403,0.2960344,0.000172655,0.4472299],"study_design_scores_gemma":[0.000122377,0.00024437,0.001458454,0.00008868967,0.00001124512,0.0001088136,0.0002062655,0.713887,0.1790493,0.09989379,0.004738632,0.0001910883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01363551,0.00008961613,0.9837059,0.001036873,0.0006533962,0.00008312066,0.000002740369,0.0000213462,0.0007715028],"genre_scores_gemma":[0.930924,0.00004378688,0.0683669,0.00003385989,0.00048074,0.000004604373,0.000008367887,0.000005245323,0.0001324677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9172885,"threshold_uncertainty_score":0.3799037,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022423,0.0001637725,0.0002056764,0.0001902484,0.0001581747,0.000454687,0.001314508,0.00005622653,0.00002842041],"category_scores_gemma":[0.0004073474,0.0001164455,0.0001029743,0.0002221231,0.000221447,0.0008113187,0.0001751325,0.0002351808,0.000007975276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000935197,"about_ca_system_score_gemma":0.0003118209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007615377,"about_ca_topic_score_gemma":0.00001586796,"domain_scores_codex":[0.9981396,0.00009524613,0.0007040223,0.0002356191,0.0006343268,0.0001912152],"domain_scores_gemma":[0.9982052,0.0004782098,0.0005272213,0.0002928914,0.0004188529,0.00007756843],"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.001418318,0.001136622,0.0003243414,0.00002662493,0.000479945,0.0001532695,0.008089473,0.2662719,0.07326298,0.2826014,0.0001726379,0.3660625],"study_design_scores_gemma":[0.000428529,0.000451396,0.0002438331,0.0005806229,0.00004114002,0.00007397459,0.00117783,0.8479075,0.1246313,0.02383959,0.0002942032,0.0003299757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7072183,0.00009220052,0.2875245,0.003844919,0.0008227129,0.0001607565,0.00003923996,0.0000180576,0.0002792862],"genre_scores_gemma":[0.9629719,0.0000179453,0.03659316,0.0001960183,0.0001918692,0.000005212384,0.000005647595,0.00001036641,0.000007903182],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5816357,"threshold_uncertainty_score":0.474851,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247743,0.0001554311,0.0002138251,0.0003930776,0.0001603131,0.0002974698,0.0008270106,0.00008090343,0.000147691],"category_scores_gemma":[0.001009576,0.0001501205,0.0002285153,0.0002926282,0.0001565055,0.001026918,0.00009044963,0.0001980183,0.0000321583],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001870991,"about_ca_system_score_gemma":0.000278164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002808339,"about_ca_topic_score_gemma":0.00003286441,"domain_scores_codex":[0.9976944,0.00006834202,0.0009900521,0.000268323,0.0007703985,0.0002084722],"domain_scores_gemma":[0.9968543,0.0003807181,0.0007237822,0.0002770018,0.001643967,0.0001202068],"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.0001626679,0.0002034116,0.0009988258,0.000008071848,0.0001410908,0.00006509981,0.002053386,0.242807,0.006252302,0.1771949,0.0009745783,0.5691386],"study_design_scores_gemma":[0.0009202564,0.0007441604,0.01289719,0.0002194776,0.00004866336,0.003319089,0.001349293,0.8239981,0.07904508,0.07370215,0.002999374,0.0007571585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03454256,0.00003154494,0.9575817,0.004401871,0.00259186,0.0003369956,0.00001975561,0.00005133603,0.0004423677],"genre_scores_gemma":[0.8948734,0.0001052486,0.1044278,0.0001330608,0.0003851977,0.00001484259,0.000006149958,0.00001020892,0.0000440099],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8603309,"threshold_uncertainty_score":0.6121737,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354939,0.00009517926,0.0001356903,0.0001114846,0.00007365394,0.0004141781,0.0005817706,0.00004424045,0.00004613857],"category_scores_gemma":[0.0009481948,0.00008298918,0.00007922594,0.0001550393,0.00004113406,0.0006240926,0.00005898322,0.0002621104,0.00003024594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003973135,"about_ca_system_score_gemma":0.00008653026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003760106,"about_ca_topic_score_gemma":0.000001139268,"domain_scores_codex":[0.9985204,0.000110272,0.0004612557,0.0001722321,0.0005968906,0.0001388984],"domain_scores_gemma":[0.9987081,0.0003516636,0.0002784957,0.00007225777,0.0004385717,0.0001509638],"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.0003330728,0.000109392,0.0004977259,0.000005854357,0.00005658942,0.000080427,0.001394574,0.008737781,0.01428223,0.01703458,0.0005761221,0.9568917],"study_design_scores_gemma":[0.0002555645,0.0008156424,0.0008545942,0.0003356237,0.00002036192,0.00006260709,0.001134698,0.6436374,0.3211901,0.02823257,0.003102857,0.0003579978],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04443657,0.00002744213,0.9412481,0.01290989,0.000817382,0.00005671009,0.000004130392,0.00003049813,0.0004692578],"genre_scores_gemma":[0.9873937,0.00001777915,0.009806932,0.002545532,0.0002254481,9.626443e-7,0.000001344413,0.000004603694,0.000003711327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9565337,"threshold_uncertainty_score":0.3993929,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005399411,0.0001214165,0.0001762704,0.0002445185,0.00003694514,0.0003749304,0.001377113,0.00005684249,0.001587398],"category_scores_gemma":[0.0001386106,0.0001034304,0.0001605014,0.0001547151,0.0000323164,0.001512853,0.0001847159,0.0002351684,0.001395579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009425191,"about_ca_system_score_gemma":0.0001185001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001731188,"about_ca_topic_score_gemma":0.000006723312,"domain_scores_codex":[0.9980108,0.00005253033,0.0007545917,0.0001844525,0.0008161663,0.0001814626],"domain_scores_gemma":[0.9985771,0.0001420281,0.0004222308,0.0001810365,0.0005759984,0.0001016744],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000288872,0.0004117654,0.00163892,0.000008597907,0.000170695,0.0002438951,0.0008210557,0.0008425196,0.1408567,0.05483053,0.002654371,0.797232],"study_design_scores_gemma":[0.0003256224,0.001090666,0.001855277,0.0002183562,0.00001996288,0.0006482289,0.0005697336,0.03648563,0.9009858,0.03524357,0.0220229,0.0005342751],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4256303,0.00007602336,0.5540204,0.006045388,0.009370008,0.0002246521,0.00002905572,0.00006154153,0.004542608],"genre_scores_gemma":[0.9908497,0.00003956597,0.00798423,0.000611499,0.0003305377,0.000001892635,0.00000716079,0.000007576546,0.0001678619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7966978,"threshold_uncertainty_score":0.999382,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001220583,0.0001671801,0.0001848858,0.0003198959,0.00007386302,0.0004046272,0.0008258861,0.00006923993,0.0000153874],"category_scores_gemma":[0.0005052697,0.0001580124,0.00006236262,0.000179006,0.0000993965,0.001214958,0.0001045114,0.0002688086,0.00002117554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003570625,"about_ca_system_score_gemma":0.00005681536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001270879,"about_ca_topic_score_gemma":0.000001178765,"domain_scores_codex":[0.9977093,0.0001678471,0.0007573171,0.0002247794,0.0008439124,0.0002968058],"domain_scores_gemma":[0.9987251,0.000258652,0.0004746688,0.0002397718,0.0001449372,0.0001568598],"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.00009170237,0.0004124713,0.0001809433,0.000003488767,0.00002841596,0.000008793347,0.0009957398,0.8813365,0.001305289,0.003020694,0.000004803353,0.1126112],"study_design_scores_gemma":[0.000106456,0.0002506158,0.00240654,0.00007362416,0.000009782869,0.00002444256,0.0003573642,0.99482,0.001085649,0.0005928483,0.0001158752,0.0001568034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05462029,0.00001864657,0.9444301,0.0003747581,0.0002699706,0.0001946292,0.000002973031,0.00002258007,0.00006608905],"genre_scores_gemma":[0.9271466,0.00001065879,0.07254519,0.0000945936,0.0001213545,0.000008305212,0.00003738161,0.00001194495,0.00002402728],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8725262,"threshold_uncertainty_score":0.6443558,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004623529,0.0001069139,0.0001618485,0.0003221185,0.0000495649,0.0003222968,0.0006726536,0.00006510515,0.00001154911],"category_scores_gemma":[0.0002144519,0.00009689078,0.00003617,0.0001866176,0.0001870019,0.0009840897,0.0001688927,0.0003156652,0.000004100072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009393186,"about_ca_system_score_gemma":0.00008206022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006168618,"about_ca_topic_score_gemma":0.00005461273,"domain_scores_codex":[0.9988173,0.00004707805,0.0005101708,0.0001853097,0.0003040786,0.0001360876],"domain_scores_gemma":[0.9989655,0.0001797696,0.0002829885,0.0001034237,0.000394755,0.00007354699],"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.00001685407,0.00005008275,0.0002899214,0.00000216282,0.00001580441,0.00002456233,0.00062299,0.00002221947,0.002100694,0.363745,0.0000379294,0.6330718],"study_design_scores_gemma":[0.0001633993,0.0001546904,0.000777673,0.00009230358,0.000009151555,0.0006671163,0.0002974448,0.009006359,0.09861693,0.8881774,0.00178152,0.0002559991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1609457,0.002071577,0.8289381,0.006470852,0.001032103,0.0001889326,0.000007000887,0.00006807766,0.0002776542],"genre_scores_gemma":[0.8911219,0.0001283232,0.1084028,0.0001140345,0.0002148616,0.000004320815,6.703344e-7,0.000004298293,0.00000871619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7301763,"threshold_uncertainty_score":0.3951091,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611815,0.0001010779,0.000132061,0.0003001565,0.00006893597,0.0003597392,0.0008858152,0.00005145758,0.0003233505],"category_scores_gemma":[0.0005854002,0.00009626986,0.0001262252,0.0002241044,0.00007611702,0.001419739,0.000119135,0.0002046032,0.00005042114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001958634,"about_ca_system_score_gemma":0.0001232704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001827372,"about_ca_topic_score_gemma":0.0000565657,"domain_scores_codex":[0.9980223,0.00004435359,0.0008964182,0.0001575058,0.0006994966,0.0001798867],"domain_scores_gemma":[0.9981779,0.0003171595,0.000428873,0.0001527827,0.000813212,0.0001101091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004730525,0.00007439597,0.001705349,0.000001194006,0.00003928412,0.00005843295,0.0004629885,0.001359077,0.005868081,0.08400863,0.00006400834,0.9063113],"study_design_scores_gemma":[0.0004893356,0.0007840145,0.06378627,0.0002617942,0.00004389324,0.001823484,0.003366802,0.1305635,0.6065891,0.1845343,0.006597644,0.001159916],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04481545,0.00002142452,0.9495004,0.001390313,0.002502776,0.00006754977,0.000002272811,0.00003145844,0.001668302],"genre_scores_gemma":[0.9142984,0.00001894003,0.08503629,0.0002794789,0.000346701,4.969557e-7,0.000001327042,0.000004350735,0.00001400194],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9051513,"threshold_uncertainty_score":0.3925771,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005421032,0.0001354315,0.0001868369,0.0002128382,0.0001134468,0.0004605471,0.001042195,0.00006154484,0.0002611045],"category_scores_gemma":[0.0004026986,0.0001227458,0.00009367611,0.0002822862,0.00003510192,0.001276179,0.0001188732,0.0002205376,0.0002169892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002438299,"about_ca_system_score_gemma":0.00007209203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001456989,"about_ca_topic_score_gemma":0.000004188847,"domain_scores_codex":[0.9977853,0.0001116802,0.0009261346,0.0001870628,0.0007928064,0.0001969706],"domain_scores_gemma":[0.9978501,0.0001639205,0.0007741324,0.0001208169,0.001005445,0.00008560647],"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.00007957555,0.0002842322,0.0008395585,0.00001361226,0.0004464581,0.0002061059,0.009674687,0.06650843,0.009019029,0.1696709,0.01714037,0.7261171],"study_design_scores_gemma":[0.0003310103,0.0006683902,0.0004753944,0.000376572,0.00002210243,0.0002036056,0.001623514,0.7263343,0.146867,0.00724208,0.1151413,0.0007147019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01576498,0.0001731009,0.9776722,0.002868129,0.002150243,0.0001232953,0.000002311804,0.00002756039,0.001218197],"genre_scores_gemma":[0.9887494,0.0002681111,0.009720129,0.0003572614,0.0003094771,0.000004569102,0.000003993997,0.00000745773,0.000579577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9729844,"threshold_uncertainty_score":0.5005427,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003953908,0.00009731032,0.0001292522,0.0002012368,0.00004847183,0.0004201159,0.0009144431,0.00006088009,0.00001759842],"category_scores_gemma":[0.0002695605,0.00008090388,0.00004654553,0.0002268172,0.00007638562,0.000921311,0.0001289172,0.0001857012,0.00001599923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007955411,"about_ca_system_score_gemma":0.00007387134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005682154,"about_ca_topic_score_gemma":0.00001087105,"domain_scores_codex":[0.998804,0.00003705937,0.000467508,0.0001584554,0.0004176601,0.000115347],"domain_scores_gemma":[0.9981776,0.00014732,0.0003900024,0.0001073015,0.001138401,0.00003932417],"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.00004197469,0.00005545377,0.0000428805,0.000001798827,0.00001527564,0.00003800417,0.0001237909,0.00006928186,0.01666199,0.7291226,0.0003794785,0.2534475],"study_design_scores_gemma":[0.00003291186,0.0001227616,0.00007148308,0.0000227096,0.000005305621,0.0001434392,0.00003952012,0.004944128,0.1469674,0.8466156,0.0009256252,0.0001090912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008977422,0.000570769,0.9855617,0.003321502,0.001072027,0.00008208203,0.00000194151,0.00005825987,0.0003542471],"genre_scores_gemma":[0.8606183,0.00002237565,0.1385114,0.0001385051,0.000660961,0.000002047006,0.000002410987,0.000004711942,0.0000392795],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8516409,"threshold_uncertainty_score":0.4051187,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006898988,0.00009974762,0.000146697,0.0002288315,0.0001354251,0.0002387647,0.0005854893,0.00005887227,0.00003391991],"category_scores_gemma":[0.0004863575,0.00009125417,0.00007503566,0.0001741051,0.0001011186,0.001202646,0.000144842,0.0001756914,0.00001256501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008583407,"about_ca_system_score_gemma":0.0002047907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001599341,"about_ca_topic_score_gemma":0.000004649262,"domain_scores_codex":[0.9982324,0.00009479265,0.0006541334,0.0001880093,0.0006990248,0.0001316467],"domain_scores_gemma":[0.9986482,0.0002226097,0.0003038087,0.0001499631,0.0005873213,0.00008810077],"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.00004708871,0.0001693748,0.001780384,0.000003872439,0.00007719688,0.0001348781,0.002005158,0.06762986,0.006274432,0.2168577,0.00004958841,0.7049704],"study_design_scores_gemma":[0.00004845163,0.00006118079,0.0009673169,0.00004389813,0.00001033442,0.0008460419,0.0001574275,0.957761,0.01263165,0.02715098,0.0001954971,0.0001261732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.154535,0.00009882932,0.8430564,0.00133924,0.0007281759,0.00006231595,0.000001418492,0.00001490221,0.0001637704],"genre_scores_gemma":[0.8973384,0.00006088935,0.1020379,0.0001156222,0.000418619,0.000001215637,0.000001306136,0.000005287213,0.00002075677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8901312,"threshold_uncertainty_score":0.3721237,"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.001401918,0.00008369779,0.000129497,0.0002084159,0.00002684931,0.0003967902,0.006530441,0.0000235322,0.00003752416],"category_scores_gemma":[0.0004676766,0.00006118698,0.00005245199,0.0002085487,0.00006619039,0.002752357,0.0007853704,0.0001747517,0.00002117174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002995364,"about_ca_system_score_gemma":0.00005475686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008195758,"about_ca_topic_score_gemma":0.0002470337,"domain_scores_codex":[0.9980687,0.00007789901,0.0007434547,0.0001704642,0.0008004713,0.0001390243],"domain_scores_gemma":[0.9984967,0.0003454821,0.0003851299,0.0005085092,0.0002357772,0.00002843247],"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.00002727311,0.0001671246,0.0001285883,0.000002841371,0.00002630565,0.00005136981,0.0008435466,0.004038858,0.0003337098,0.01650951,0.0002756868,0.9775952],"study_design_scores_gemma":[0.0001314726,0.0001485213,0.002226254,0.0001680712,0.00001270204,0.0001003291,0.0009566881,0.9580753,0.01161979,0.01319574,0.01316547,0.0001996032],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01061783,0.00008710657,0.9821203,0.005596201,0.0009963163,0.00008557189,0.00002018008,0.000007014391,0.0004694478],"genre_scores_gemma":[0.9606151,0.00008942401,0.03844947,0.0002153866,0.0006013644,0.000001107576,0.000006871725,0.000003358537,0.00001792692],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9773956,"threshold_uncertainty_score":0.9988447,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004593894,0.0001321407,0.0001769622,0.0001877382,0.00008737051,0.0003768821,0.000814214,0.00007440998,0.00008364872],"category_scores_gemma":[0.0003685624,0.0001255222,0.0001865458,0.0002175551,0.0001047757,0.0008680132,0.00004941977,0.0001887866,0.00001343117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001112873,"about_ca_system_score_gemma":0.0005130438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006300636,"about_ca_topic_score_gemma":0.00004356561,"domain_scores_codex":[0.9983915,0.00002940301,0.0007240283,0.000185287,0.0004574568,0.0002123061],"domain_scores_gemma":[0.9979462,0.0001943194,0.0004200654,0.0001458016,0.001182766,0.0001108562],"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.00008980463,0.0000494009,0.00005796908,0.000001444295,0.00002742925,0.00001804145,0.0001356608,0.7091551,0.0001776654,0.06212882,0.0001028662,0.2280558],"study_design_scores_gemma":[0.0001680237,0.0001557895,0.0000430843,0.00004379885,0.000008548026,0.00007940193,0.00004655875,0.9293423,0.002451298,0.0673572,0.0001716827,0.000132276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003366448,0.00002963216,0.9886613,0.005097057,0.002498626,0.0001570686,0.000008190951,0.00003609956,0.000145575],"genre_scores_gemma":[0.771677,0.00001173863,0.2269817,0.0009489333,0.0003534357,0.000003072838,0.000005104468,0.000006530054,0.00001256243],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7683105,"threshold_uncertainty_score":0.5118647,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001169186,0.0001585607,0.0001942212,0.0004610636,0.00005912212,0.001408303,0.001416876,0.00008695543,0.0001082744],"category_scores_gemma":[0.0007120224,0.0001479134,0.0001773365,0.000403993,0.00003144278,0.001834376,0.000238244,0.0003361506,0.0001818993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003084392,"about_ca_system_score_gemma":0.0002189144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004270593,"about_ca_topic_score_gemma":0.00001486048,"domain_scores_codex":[0.9971609,0.0001062825,0.001177446,0.0003509752,0.0009874793,0.0002169157],"domain_scores_gemma":[0.998152,0.0004795313,0.0002812001,0.000273641,0.0006692625,0.0001444175],"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.00005710365,0.00006433164,0.00005103311,0.00001083413,0.00008282102,0.00007386891,0.001456487,0.005038141,0.009829069,0.27863,0.0003229302,0.7043833],"study_design_scores_gemma":[0.0001125769,0.0005464639,0.0004030633,0.001226602,0.00004134863,0.0001532603,0.0009105039,0.3286007,0.1524534,0.5018863,0.01298724,0.0006785381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01647392,0.0001775415,0.9670502,0.007940815,0.007747482,0.000160653,0.00001392831,0.00007504653,0.0003604286],"genre_scores_gemma":[0.8994869,0.00006949696,0.0978146,0.000999908,0.001386419,0.00001065171,0.000006275145,0.00001571115,0.0002100676],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.883013,"threshold_uncertainty_score":0.9996283,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008438969,0.0001364305,0.0002516178,0.0004253898,0.00009588947,0.0001005883,0.0004539911,0.00004922394,0.0001310364],"category_scores_gemma":[0.0004120274,0.0001422185,0.0001921928,0.0002806558,0.00004734574,0.0003385658,0.00005543504,0.0002369044,0.000005610992],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002819168,"about_ca_system_score_gemma":0.0001045992,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003445704,"about_ca_topic_score_gemma":0.000004533469,"domain_scores_codex":[0.9980273,0.000107744,0.001022172,0.0001208692,0.0005543071,0.0001676199],"domain_scores_gemma":[0.9975681,0.0004271813,0.0005224784,0.0001023746,0.001320836,0.00005897005],"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.0003335888,0.00006824809,0.00002885383,0.00003706978,0.000183406,0.00001515142,0.001038844,0.9189067,0.0010507,0.01386288,0.0005220924,0.06395249],"study_design_scores_gemma":[0.0003873136,0.001028119,0.00005620567,0.0004406748,0.0001139563,0.0003058907,0.01320958,0.7812316,0.181484,0.003924498,0.01729048,0.0005277371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009028829,0.000127395,0.9845853,0.0003458667,0.004819437,0.0003312776,0.0001362413,0.0000711381,0.0005544785],"genre_scores_gemma":[0.9814908,0.00002927125,0.01804156,0.00003206132,0.0002616685,0.00004187095,0.0000371309,0.00003136817,0.0000342951],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9724619,"threshold_uncertainty_score":0.57995,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001804265,0.0001484767,0.0002431033,0.0002907051,0.00006236636,0.0003594125,0.001287582,0.00006264816,0.00001566576],"category_scores_gemma":[0.0002144157,0.0001413657,0.0001775386,0.0002358472,0.00005935482,0.00073189,0.00009177542,0.0003148133,0.00001130687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001404405,"about_ca_system_score_gemma":0.0001041657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001240381,"about_ca_topic_score_gemma":0.00004281387,"domain_scores_codex":[0.9977513,0.00004481563,0.001114848,0.000228645,0.0004898217,0.0003705923],"domain_scores_gemma":[0.9975359,0.0008703131,0.0004682421,0.0001429674,0.000857252,0.0001252845],"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.00008643998,0.0001152089,0.00007403898,7.460415e-7,0.00003976381,0.0001723483,0.0001814989,0.01268639,0.0001283413,0.04166842,0.00003792785,0.9448089],"study_design_scores_gemma":[0.0001753075,0.0001175431,0.0001705258,0.00008937954,0.000006318529,0.0001569269,0.0002007091,0.991841,0.003195664,0.003605449,0.0002902314,0.0001509333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01290863,0.00005193787,0.9829578,0.0009063145,0.002869797,0.0001687253,0.000004428322,0.00002674224,0.000105655],"genre_scores_gemma":[0.9377976,0.00002444042,0.06043535,0.0002978321,0.001402572,0.000005262762,0.000002272105,0.000009956246,0.00002468207],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9791546,"threshold_uncertainty_score":0.5764728,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007116058,0.0001327466,0.0001951368,0.0003972652,0.0001191406,0.000251454,0.002815105,0.00007139539,0.00004023895],"category_scores_gemma":[0.001796203,0.0001145707,0.0001875655,0.0002086166,0.00008250253,0.001187777,0.0001554015,0.0002216695,0.00008363072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001352169,"about_ca_system_score_gemma":0.0001350219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003282988,"about_ca_topic_score_gemma":0.000003325982,"domain_scores_codex":[0.9978685,0.00004426966,0.0008278792,0.0002403151,0.0008319737,0.000187074],"domain_scores_gemma":[0.9970958,0.0007898645,0.0005187477,0.0004232241,0.001095744,0.00007658955],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002286443,0.0001880932,0.00004092964,0.00000123852,0.0000325585,0.00005144253,0.0002756618,0.0009125841,0.004452216,0.1689322,0.003556653,0.8213278],"study_design_scores_gemma":[0.0003137545,0.00123339,0.001231746,0.0002581913,0.00001218946,0.0006173009,0.0001216493,0.05293991,0.5490696,0.3513573,0.04238233,0.0004626136],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01115777,0.00002759031,0.9834958,0.002879557,0.001560415,0.0001445387,0.00001156504,0.00006063507,0.0006621503],"genre_scores_gemma":[0.7433574,0.0001140015,0.2552568,0.0005999953,0.0005533172,0.00001144545,0.000005395786,0.00001193991,0.00008965113],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8208652,"threshold_uncertainty_score":0.5231213,"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006567915,0.000120139,0.0002252364,0.000264516,0.0001117162,0.001482619,0.001510192,0.00006071569,0.000009086661],"category_scores_gemma":[0.0002133803,0.00009994776,0.00008409111,0.00004498544,0.00007804883,0.002781121,0.0002242868,0.0002718181,0.000001577898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007325316,"about_ca_system_score_gemma":0.00006180123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006509866,"about_ca_topic_score_gemma":0.0001142509,"domain_scores_codex":[0.9986996,0.00005440765,0.0006246294,0.0001661711,0.0002983125,0.0001568906],"domain_scores_gemma":[0.9986112,0.0001715634,0.0007055928,0.0002436871,0.0002088757,0.00005906165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000367019,0.00009541203,0.00284625,0.000004226982,0.00004112348,0.00008846865,0.001627374,0.00001246515,0.01609925,0.02224075,0.00001941729,0.9568886],"study_design_scores_gemma":[0.0003692629,0.0006461471,0.1390404,0.001854228,0.00001604431,0.001054461,0.006126264,0.04805611,0.6839141,0.1094397,0.008512943,0.0009703811],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7346833,0.00006839466,0.256537,0.006216802,0.001906349,0.00009213155,0.000008933149,0.00002697662,0.0004601278],"genre_scores_gemma":[0.9932263,0.000171841,0.006047725,0.0001647169,0.0003642382,0.000002260302,8.176441e-7,0.00000669947,0.00001544018],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9559182,"threshold_uncertainty_score":0.9995539,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001027853,0.0001456352,0.0002362904,0.000272947,0.0001344109,0.0004529165,0.0007908187,0.000109263,0.002649436],"category_scores_gemma":[0.001010706,0.0001320935,0.0001614352,0.0001420507,0.0002605532,0.001119627,0.00003793152,0.0002819867,0.0003841835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004570792,"about_ca_system_score_gemma":0.0002732457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002118047,"about_ca_topic_score_gemma":0.0004958098,"domain_scores_codex":[0.9974301,0.0001920969,0.0009411799,0.0001798592,0.0009668179,0.0002899406],"domain_scores_gemma":[0.9985415,0.0002339664,0.0005083549,0.0001118052,0.000454319,0.0001500547],"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.0002943825,0.0008166995,0.006175599,0.000005146208,0.0001031497,0.00009297882,0.003899795,0.2560734,0.0009316307,0.08747508,0.0001288863,0.6440033],"study_design_scores_gemma":[0.0007921397,0.0002692408,0.01588981,0.000214554,0.00004843175,0.00001355383,0.00922976,0.9070112,0.005127718,0.05431219,0.006509108,0.0005822941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4721034,0.0001129315,0.5108805,0.01075656,0.002177989,0.0007160643,0.00001936635,0.0000387279,0.003194454],"genre_scores_gemma":[0.9897644,0.00005629255,0.009340934,0.0003538402,0.0003337254,0.00002498193,0.000005967053,0.00001078009,0.0001090613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6509378,"threshold_uncertainty_score":0.9982623,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003943234,0.0001039354,0.0003889581,0.0003651363,0.0000264224,0.00004436556,0.000191988,0.00006685894,0.0005621926],"category_scores_gemma":[0.001320655,0.00009269513,0.0001881922,0.0003181057,0.0001700658,0.0004506705,0.00002296078,0.0001694807,0.000002478746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001061509,"about_ca_system_score_gemma":0.0002394478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000081226,"about_ca_topic_score_gemma":0.000004413372,"domain_scores_codex":[0.9979811,0.0001073103,0.001122931,0.0001456843,0.0005345774,0.0001083891],"domain_scores_gemma":[0.9966586,0.0008466623,0.0006510883,0.000131862,0.001633855,0.00007789157],"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.006871948,0.001725887,0.007147402,0.000042367,0.001012302,0.0001036748,0.006211339,0.07119603,0.5928655,0.005888134,0.00006722948,0.3068682],"study_design_scores_gemma":[0.0005676895,0.000698779,0.004137055,0.0009255868,0.0001437267,0.0001547538,0.003020441,0.05051336,0.9353001,0.004203295,0.0002165298,0.0001186926],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9583019,0.00003149904,0.03853118,0.0003430451,0.0005099277,0.0002030564,0.00001630517,0.000009758808,0.002053317],"genre_scores_gemma":[0.9944217,0.000009684933,0.005194051,0.00010668,0.0001967389,0.000001270553,0.00001320983,0.00000818541,0.00004851878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3424346,"threshold_uncertainty_score":0.6155615,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003782705,0.00009466123,0.0001575379,0.0003054774,0.00008319726,0.0002564517,0.0004321774,0.00003678158,0.00003942488],"category_scores_gemma":[0.0008141241,0.0000862302,0.00007524496,0.0001688779,0.00006645908,0.004568632,0.00007918732,0.0001820294,0.000003501899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000598107,"about_ca_system_score_gemma":0.0001300367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000118897,"about_ca_topic_score_gemma":0.000002375132,"domain_scores_codex":[0.9984981,0.0000613174,0.000744789,0.00009682243,0.0004746429,0.000124286],"domain_scores_gemma":[0.9981486,0.0001540767,0.0007216796,0.00009235519,0.0008130829,0.00007016674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000687407,0.00005333542,0.0005153193,0.000003844106,0.00003228124,0.0000125812,0.002985807,0.006526591,0.01626132,0.04075545,0.000007698642,0.932777],"study_design_scores_gemma":[0.0002173703,0.0001851037,0.0009982785,0.0004318763,0.00001593689,0.0003368036,0.003401213,0.1967727,0.7393718,0.0542504,0.003703444,0.0003150865],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1388487,0.000031468,0.8598974,0.0001664864,0.0007756175,0.00005155592,0.000004456058,0.000008319136,0.0002159822],"genre_scores_gemma":[0.8770849,0.00002185186,0.1227386,0.00007910509,0.00006821478,4.984702e-7,0.000001241923,0.000003233446,0.000002375656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9324619,"threshold_uncertainty_score":0.3516366,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537432,0.00009899898,0.0001655768,0.00009785115,0.00003766693,0.00004000949,0.0004165745,0.00005348649,0.00001480605],"category_scores_gemma":[0.0004409079,0.00007517503,0.0001771404,0.00006796872,0.00007716168,0.000002471663,0.00007280343,0.00006712024,0.000001216174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003012369,"about_ca_system_score_gemma":0.00009755781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001082324,"about_ca_topic_score_gemma":0.0000754021,"domain_scores_codex":[0.9988938,0.00004532754,0.0006055407,0.0001303671,0.000190384,0.0001345695],"domain_scores_gemma":[0.9987975,0.0002913888,0.0003163326,0.0001012841,0.0004663037,0.00002720648],"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.0003848787,0.00008523957,0.0001351965,0.000002077793,0.0001278115,0.000001259709,0.0002047046,0.3505616,0.3789654,0.0002623423,0.00005798034,0.2692115],"study_design_scores_gemma":[0.0001395685,0.0004871732,0.001412126,0.00003607533,0.00003327463,0.00004294666,0.0006882049,0.01697975,0.9741445,0.0007239798,0.005197139,0.0001152733],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7423229,0.001866214,0.2538303,0.001037976,0.0006574114,0.0001688128,0.00003320327,5.687584e-7,0.00008258926],"genre_scores_gemma":[0.9673029,0.0003552405,0.03149721,0.00008883629,0.0006981468,0.000008754841,0.000001770034,0.000009082773,0.00003802751],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5951791,"threshold_uncertainty_score":0.3065549,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001081239,0.00008507172,0.0001259788,0.0002266517,0.0002470518,0.0006645151,0.0003952595,0.00007713152,0.0002634405],"category_scores_gemma":[0.001257894,0.00008480939,0.00007310299,0.0002873516,0.0001160959,0.0007735146,0.00005843971,0.0002213963,0.0001387634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005625591,"about_ca_system_score_gemma":0.001310745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005237288,"about_ca_topic_score_gemma":0.0006246542,"domain_scores_codex":[0.9983628,0.0001096099,0.0004081053,0.0001599127,0.0007754472,0.0001840567],"domain_scores_gemma":[0.9978558,0.0003633966,0.0001539914,0.00005762167,0.00137932,0.0001898117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003019871,0.0001893192,0.000800455,0.00001239125,0.0002831109,0.0001158407,0.03541635,0.0001783307,0.001256886,0.3862266,0.2754019,0.2998168],"study_design_scores_gemma":[0.0000334535,0.00004710301,0.0009208168,0.000225672,0.00001975398,0.00000857614,0.006476596,0.00003347688,0.002108818,0.01931113,0.9706871,0.000127515],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"editorial","genre_gemma":"empirical","genre_scores_codex":[0.1750161,0.001378936,0.1571918,0.2122209,0.4436387,0.00118274,0.0002810185,0.0002011897,0.008888516],"genre_scores_gemma":[0.9596137,0.0004788525,0.001615911,0.0002035164,0.0353194,0.00000385823,0.000003717928,0.000009910115,0.00275115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7845976,"threshold_uncertainty_score":0.6407934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}