{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"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"},"query_hash":"c111c5a0ccbc","filters":{"venue":"Evolutionary Intelligence"}},"results":[{"id":"W2990041205","doi":"10.1007/s12065-019-00327-1","title":"RETRACTED ARTICLE: Hybrid genetic algorithm and a fuzzy logic classifier for heart disease diagnosis","year":2019,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Artificial Intelligence in Healthcare","field":"Health Professions","cited_by":407,"is_retracted":true,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Classifier (UML); Heart disease; Fuzzy logic; Artificial intelligence; Machine learning; Genetic algorithm; Feature selection; Disease; Rough set; Data mining; Pattern recognition (psychology); Medicine; Pathology","retraction":null,"screen_n_in":null,"score":{"opus":0.0866876389067494,"gpt":0.4130774936949667,"spread":0.3263898547882173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005596708,0.0003026261,0.0003746857,0.0001614058,0.0008914593,0.00002100063,0.0003035726,0.0002882931,0.001763621],"category_scores_gemma":[0.001161032,0.0002934234,0.0001220254,0.0003615788,0.0002526402,0.0002936341,0.0001765266,0.0008931608,0.002699162],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003473252,"about_ca_system_score_gemma":0.0005309804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003577171,"about_ca_topic_score_gemma":0.00003589518,"domain_scores_codex":[0.9963657,0.0004165451,0.0009899457,0.0008165349,0.0004309381,0.000980333],"domain_scores_gemma":[0.9958082,0.002128503,0.0002302164,0.0006389058,0.0006286087,0.0005655764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0004001035,0.0003138009,0.9003991,0.0006896504,0.00003825689,0.00003224466,0.001071564,0.0006147099,0.0001896427,0.01410117,0.02572052,0.05642919],"study_design_scores_gemma":[0.00026008,0.0006616286,0.5155719,0.0007221326,0.00008236661,0.00003044409,0.003695832,0.2054294,0.0006034019,0.2185747,0.05341857,0.0009495481],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8833377,0.008234401,0.07460044,0.01814298,0.004631652,0.008442828,0.0008200796,0.0005427195,0.001247155],"genre_scores_gemma":[0.9687937,0.0005863825,0.02201904,0.003987315,0.0007996407,0.001741627,0.00006876789,0.00006387249,0.001939691],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3848272,"threshold_uncertainty_score":0.9999518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950684230","doi":"10.1007/s12065-019-00255-0","title":"A hybridization of cuckoo search and particle swarm optimization for solving nonlinear systems","year":2019,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cuckoo search; Computer science; Benchmark (surveying); Particle swarm optimization; Mathematical optimization; Nonlinear system; Algorithm; Jacobian matrix and determinant; Maxima and minima; Mathematics; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02703070889208963,"gpt":0.289297558974044,"spread":0.2622668500819543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491617,0.0001073765,0.0001736845,0.00009958602,0.0001045673,0.00007674817,0.0004349578,0.00004314924,0.00004648047],"category_scores_gemma":[0.000345314,0.0001092151,0.00003066549,0.0005315119,0.00004968868,0.0004621031,0.0001958339,0.00008354083,0.00001834759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008946116,"about_ca_system_score_gemma":0.0003868342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116182,"about_ca_topic_score_gemma":0.00002962319,"domain_scores_codex":[0.9983628,0.00008118449,0.0004029949,0.0003757789,0.000513919,0.0002633454],"domain_scores_gemma":[0.9983027,0.0003968764,0.00009576507,0.0003755557,0.0007349548,0.0000941379],"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.00001314679,0.00004655302,0.0008864892,0.0001147295,0.00001181669,8.021362e-7,0.0001378507,0.9753473,0.0002001251,0.02113225,0.0001074218,0.002001466],"study_design_scores_gemma":[0.0001181443,0.00009919338,0.0001918948,0.00004170807,0.000003379867,0.000009411799,0.0001096998,0.9944838,0.004495446,0.000126939,0.0002080606,0.0001123527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0108043,0.0005605943,0.9871351,0.0002480867,0.0003985445,0.0007007516,0.00001877344,0.0000460234,0.00008788458],"genre_scores_gemma":[0.5608473,0.0001821511,0.4382855,0.00002857405,0.00005702999,0.00003944504,0.0000242875,0.00001349275,0.0005221972],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.550043,"threshold_uncertainty_score":0.4453663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989073584","doi":"10.1007/s12065-013-0101-3","title":"A fast anomaly detection system using probabilistic artificial immune algorithm capable of learning new attacks","year":2013,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Intrusion detection system; Anomaly detection; Constant false alarm rate; Probabilistic logic; Key (lock); False positive rate; Artificial intelligence; False alarm; Anomaly-based intrusion detection system; Machine learning; Algorithm; System call; Data mining; Pattern recognition (psychology); Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.01883076815357753,"gpt":0.2312367443454816,"spread":0.212405976191904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002905438,0.0001868079,0.0002449971,0.0001999149,0.0003900585,0.0001007896,0.0005029905,0.0001316992,0.0001268068],"category_scores_gemma":[0.00008470902,0.000194734,0.0001132414,0.0009209198,0.0001041061,0.0009892966,0.0002020383,0.0003183674,0.0002407705],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002965078,"about_ca_system_score_gemma":0.0001604352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002960069,"about_ca_topic_score_gemma":0.00003783332,"domain_scores_codex":[0.9980217,0.0001660543,0.0006375063,0.0004447073,0.0003764083,0.0003536574],"domain_scores_gemma":[0.9987547,0.00009788846,0.0003028194,0.0003902738,0.0003345346,0.0001197361],"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.00003179092,0.0001791354,0.0002209408,0.0001581347,0.00005261648,0.000009451615,0.001463978,0.2726035,0.05729194,0.01863403,0.0001469951,0.6492074],"study_design_scores_gemma":[0.00003800927,0.0002100222,0.0004987357,0.0001223846,0.000009490346,0.0001357217,0.000325416,0.9627946,0.03120466,0.004230482,0.0002322051,0.0001982791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05949767,0.0004192393,0.9382278,0.00005126745,0.000942026,0.0003767276,0.000001146262,0.0002227413,0.0002613255],"genre_scores_gemma":[0.9420404,0.00001566624,0.05744787,0.000007782765,0.0002271371,0.00002349176,0.000002240637,0.00001184286,0.0002235112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8825428,"threshold_uncertainty_score":0.7941024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2957818796","doi":"10.1007/s12065-019-00246-1","title":"Chemical reaction optimization: survey on variants","year":2019,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Metaheuristic; Tabu search; Ant colony optimization algorithms; Computer science; Simulated annealing; Meta-optimization; Parallel metaheuristic; Mathematical optimization; Robustness (evolution); Particle swarm optimization; Genetic algorithm; Optimization problem; Multi-swarm optimization; Algorithm; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03461061903126983,"gpt":0.293270391387825,"spread":0.2586597723565552,"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.0006853762,0.0001616429,0.000165323,0.0002015879,0.0001009683,0.0000950961,0.001018816,0.0001021726,0.0009668724],"category_scores_gemma":[0.0006698726,0.0001614589,0.00005080583,0.00106449,0.0000575775,0.000548421,0.00023012,0.0002640646,0.003310972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001791148,"about_ca_system_score_gemma":0.0001834571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005622702,"about_ca_topic_score_gemma":8.772564e-7,"domain_scores_codex":[0.9976949,0.0002538335,0.0003399611,0.0006215424,0.0007668628,0.0003229027],"domain_scores_gemma":[0.9979793,0.0005112477,0.00009990373,0.0008376597,0.0004265788,0.0001452754],"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.00009534996,0.0004826123,0.002476653,0.00002020873,0.00004502783,0.00002079951,0.0001431118,0.8764679,0.0007410666,0.09380998,0.01011984,0.01557742],"study_design_scores_gemma":[0.00008361744,0.00007674772,0.01070157,0.00001770292,0.000001370974,0.00002184857,0.00000593733,0.9866772,0.0008193513,0.0007840001,0.0006162572,0.0001943668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006981678,0.00004739274,0.9901116,0.0004885399,0.0009265789,0.0002855793,0.00001305553,0.0001673134,0.007261761],"genre_scores_gemma":[0.4707558,0.0001586997,0.5214938,0.0004615943,0.0001879336,0.00003743859,0.0001759089,0.00003346532,0.006695396],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4700576,"threshold_uncertainty_score":0.9999464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995566852","doi":"10.1007/s12065-011-0065-0","title":"Evolutionary computation as an artificial attacker: generating evasion attacks for detector vulnerability testing","year":2011,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Carleton University","funders":"Mitacs","keywords":"Computer science; Evasion (ethics); Intrusion detection system; Vulnerability (computing); Detector; Black box; Computer security; Frame (networking); Anomaly detection; White box; Artificial intelligence; Machine learning; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.1082917580730283,"gpt":0.3183179606629741,"spread":0.2100262025899458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008999021,0.0003077842,0.000252065,0.0002017544,0.001272545,0.0001126304,0.0007896987,0.0002118879,0.0001315822],"category_scores_gemma":[0.0007075614,0.0003293607,0.0001446807,0.0008621854,0.0001742593,0.001787978,0.0002538906,0.0003458811,0.0001827831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002772707,"about_ca_system_score_gemma":0.0002466535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002295689,"about_ca_topic_score_gemma":0.00005430563,"domain_scores_codex":[0.9968117,0.0003294538,0.0007921042,0.001013652,0.0005038696,0.0005492024],"domain_scores_gemma":[0.9975801,0.0004927095,0.0002974118,0.0006032169,0.0008005442,0.0002260816],"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.000575762,0.001944519,0.004463352,0.0001540951,0.00007538378,0.00003070872,0.00595179,0.07519783,0.02650872,0.1161893,0.002381358,0.7665272],"study_design_scores_gemma":[0.00008273968,0.0009148697,0.00444452,0.00004456443,0.0000109686,0.00006747008,0.0001165754,0.8757448,0.01024495,0.1075507,0.0003864595,0.0003914714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2426009,0.0001959227,0.754467,0.00008367591,0.001241457,0.0005565897,0.00001030094,0.0004357088,0.0004084062],"genre_scores_gemma":[0.7022207,0.000008697322,0.2969158,0.0001455834,0.0005273555,0.0001069442,0.00002874342,0.00001762133,0.00002853731],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8005469,"threshold_uncertainty_score":0.9999158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3015239645","doi":"10.1007/s12065-020-00394-9","title":"Neuromodulated multiobjective evolutionary neurocontrollers without speciation","year":2020,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Neuroevolution; Computer science; Evolutionary algorithm; Artificial intelligence; Neuromodulation; Genetic algorithm; Artificial neural network; Mathematical optimization; Mathematics; Ecology; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.02657709668681028,"gpt":0.2453389950625495,"spread":0.2187618983757392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001357604,0.0002880956,0.0002572311,0.0001508143,0.0003198788,0.0001012391,0.001190169,0.0001050203,0.0001325517],"category_scores_gemma":[0.0006077456,0.0003079376,0.0001405295,0.0009968095,0.0001215038,0.001160635,0.0003647051,0.0004425909,0.001072945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002180613,"about_ca_system_score_gemma":0.000182967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002080626,"about_ca_topic_score_gemma":7.453703e-7,"domain_scores_codex":[0.9973263,0.0002044927,0.0005353797,0.0007728479,0.0007029377,0.0004580252],"domain_scores_gemma":[0.998455,0.0002023291,0.0002565689,0.0005148231,0.0003153128,0.0002559827],"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.00005092416,0.00004235905,0.003931296,0.00001085545,0.00003360186,0.00002651822,0.0007821838,0.9759814,0.0007187121,0.01416904,0.002091072,0.002162018],"study_design_scores_gemma":[0.0002172479,0.000274492,0.02823564,0.00001498725,0.000009720702,0.00003037486,0.00005687718,0.9654311,0.0003618557,0.0009614308,0.004101014,0.0003052422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001589498,0.0001658858,0.988772,0.004328551,0.0006871434,0.0005084524,0.000004506866,0.0006444073,0.00329951],"genre_scores_gemma":[0.9608445,0.00005354183,0.03659963,0.00169453,0.0002989572,0.00002779855,0.00001933259,0.00002391852,0.000437859],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9592549,"threshold_uncertainty_score":0.9999373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999677481","doi":"10.1007/s12065-013-0103-1","title":"On evolutionary subspace clustering with symbiosis","year":2014,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Benchmarking; Scalability; Subspace topology; Population; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01541483046728774,"gpt":0.26708960754386,"spread":0.2516747770765722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003179915,0.000292327,0.0002165676,0.0002734284,0.0004165519,0.00009039538,0.001513714,0.00009262277,0.00005699151],"category_scores_gemma":[0.0002315394,0.000262245,0.0000731015,0.0009070211,0.0002258785,0.001018366,0.0005712879,0.0004070798,0.0006898201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003673426,"about_ca_system_score_gemma":0.0001185123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003720347,"about_ca_topic_score_gemma":0.000006636418,"domain_scores_codex":[0.9970965,0.0001649364,0.0002900086,0.000851293,0.0009148755,0.0006824209],"domain_scores_gemma":[0.9977239,0.0005659849,0.000099268,0.001118618,0.0002531724,0.000239086],"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.0002366504,0.0004561323,0.0012111,0.0001065567,0.00007940339,0.0001083788,0.0007359377,0.2864209,0.0006165776,0.5683284,0.003320716,0.1383793],"study_design_scores_gemma":[0.0001453383,0.0007499204,0.003514596,0.0001508908,0.000003663946,0.0002116883,0.00005322215,0.9726089,0.001090959,0.01695838,0.004060383,0.0004521013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001456292,0.0001797826,0.9900294,0.001580639,0.0003370937,0.0002348197,0.000003253233,0.0004383062,0.005740445],"genre_scores_gemma":[0.7379059,0.00003754605,0.2598232,0.0003995772,0.0001301397,0.00006971705,0.000005367022,0.00002916879,0.001599395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7364495,"threshold_uncertainty_score":0.999983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2887511890","doi":"10.1007/s12065-018-0166-0","title":"Mesh smoothing of complex geometry using variations of cohort intelligence algorithm","year":2018,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Smoothing; Algorithm; Enhanced Data Rates for GSM Evolution; Node (physics); Object (grammar); Artificial intelligence; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.04388587278373347,"gpt":0.3064964673981956,"spread":0.2626105946144622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006040866,0.0001801221,0.0002709084,0.0005030129,0.0002507638,0.00003271937,0.0009062056,0.00008927932,0.000236488],"category_scores_gemma":[0.000235167,0.0001967317,0.0001136469,0.002158422,0.0003372957,0.0006670481,0.000323344,0.0001344609,0.00004352332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113732,"about_ca_system_score_gemma":0.0002948075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001833701,"about_ca_topic_score_gemma":0.00000456503,"domain_scores_codex":[0.9977282,0.0001171118,0.000796232,0.0004553369,0.0006335997,0.000269551],"domain_scores_gemma":[0.9975184,0.0003445951,0.0003952727,0.0005370977,0.001112044,0.00009262809],"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.00002088348,0.0004931721,0.003736944,0.00007234726,0.0002106709,0.000005247621,0.001525505,0.08853605,0.0145692,0.6047364,0.0004632155,0.2856303],"study_design_scores_gemma":[0.00003262856,0.0001561993,0.009800691,0.00004961675,0.00002021024,0.00004206198,0.00006224004,0.9257232,0.03045076,0.03311478,0.0003535592,0.0001940426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200118,0.0002793483,0.9857407,0.00009394469,0.0006876072,0.0002192376,0.00002757765,0.00006518992,0.0008852282],"genre_scores_gemma":[0.5560657,0.000043142,0.4436194,0.00004425273,0.0001380978,0.000004645918,0.00001643241,0.00000597829,0.0000623299],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8371872,"threshold_uncertainty_score":0.8022485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391230394","doi":"10.1007/s12065-023-00900-9","title":"Gaussian mixture models for training Bayesian convolutional neural networks","year":2024,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Rimouski","funders":"","keywords":"Computer science; Convolutional neural network; Machine learning; Artificial intelligence; Training (meteorology); Bayesian probability; Gaussian process; Gaussian; Mixture model; Training set; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.03253978695410235,"gpt":0.2700905110650882,"spread":0.2375507241109858,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002828299,0.0003238201,0.0002421654,0.0002099299,0.0003870754,0.0004081344,0.00124141,0.0002599539,0.00009135246],"category_scores_gemma":[0.00004443448,0.0002978053,0.000220723,0.0008588915,0.0001713251,0.001653948,0.0001783196,0.000547916,0.00004108835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001313236,"about_ca_system_score_gemma":0.0003932856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000132194,"about_ca_topic_score_gemma":0.000007849867,"domain_scores_codex":[0.9974799,0.00005030625,0.0004733027,0.00089849,0.0003828915,0.0007151053],"domain_scores_gemma":[0.9987459,0.0003184439,0.00007573321,0.0004570277,0.000173436,0.0002294256],"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.00001055461,0.00002969838,0.00001511828,0.00007227552,0.00002926249,0.00003084734,0.0007335199,0.08493823,0.0000139511,0.8319663,0.00381647,0.07834379],"study_design_scores_gemma":[0.00003477397,0.00008150643,0.00006704963,0.00011997,0.00000901602,0.0001705246,0.00006879783,0.7280142,0.00002482738,0.2674453,0.003685148,0.0002788929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0000280017,0.007382391,0.9828636,0.004703636,0.001870098,0.0003303137,0.00003444777,0.0005623687,0.002225116],"genre_scores_gemma":[0.9042671,0.000118664,0.09375313,0.0005073074,0.0005350507,0.0001322742,0.00002954261,0.00002599119,0.0006309036],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9042391,"threshold_uncertainty_score":0.9999474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2044141314","doi":"10.1007/s12065-014-0114-6","title":"Advancing genetic algorithm approaches to field programmable gate array placement with enhanced recombination operators","year":2014,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Genetic algorithm; Field (mathematics); Gate array; Parallel computing; Algorithm; Field-programmable gate array; Computer hardware; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01663700403645227,"gpt":0.2122806633637536,"spread":0.1956436593273014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001702677,0.000184985,0.0001448027,0.0001109744,0.00009614225,0.00003330773,0.0001877396,0.00006898699,0.00006300372],"category_scores_gemma":[0.00002969231,0.0001732101,0.00002954667,0.0002922686,0.00002171044,0.0001689353,0.00002162715,0.0001424817,0.00007179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001462842,"about_ca_system_score_gemma":0.00002122353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000127443,"about_ca_topic_score_gemma":0.000008747987,"domain_scores_codex":[0.9989395,0.00003387099,0.0002305302,0.0002726624,0.0001934763,0.0003300045],"domain_scores_gemma":[0.9995173,0.00005391427,0.00002752441,0.0002349708,0.00005642554,0.0001098821],"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.00002371103,0.00008558301,0.0001478617,0.00008166984,0.00003929892,0.000002611634,0.0007201383,0.371918,0.007815051,0.0008508976,0.001397805,0.6169174],"study_design_scores_gemma":[0.00009551075,0.0009948879,0.0002198121,0.0001624264,0.00001479689,0.0000177052,0.0002737152,0.3807939,0.6085218,0.002182067,0.006194106,0.0005292674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00662024,0.0001769602,0.9895117,0.0001050713,0.0001618979,0.0005097024,0.000002012999,0.0005018854,0.002410482],"genre_scores_gemma":[0.6648387,0.00005257627,0.3345155,0.00005879542,0.00006444992,0.0002770681,0.00000895592,0.00002555923,0.0001583605],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6582185,"threshold_uncertainty_score":0.7063302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4296184860","doi":"10.1007/s12065-022-00766-3","title":"A generalized trust establishment model architecture for designing robust trust establishment models","year":2022,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Access Control and Trust","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":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Preprocessor; Architecture; Trustworthiness; Database transaction; Multitier architecture; Simple (philosophy); Behavioral modeling; Distributed computing; Artificial intelligence; Computer security; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.05412013611379663,"gpt":0.295942417168912,"spread":0.2418222810551154,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00127248,0.0003216839,0.0003592423,0.0002679266,0.00364616,0.0002031818,0.001166794,0.0001191142,0.0009545086],"category_scores_gemma":[0.0002142478,0.0003394038,0.0002707672,0.000721701,0.0003109895,0.0008250597,0.0003455177,0.0004464313,0.00001201647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009677279,"about_ca_system_score_gemma":0.0008796608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666516,"about_ca_topic_score_gemma":0.0002518246,"domain_scores_codex":[0.9962059,0.0003467744,0.0005655926,0.0007572863,0.001180226,0.0009442461],"domain_scores_gemma":[0.9985154,0.0002860546,0.0002374528,0.0004059589,0.0002683794,0.0002867999],"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.0001982929,0.0001794277,0.0001771213,0.00001279517,0.00003846507,0.000006060156,0.00525838,0.8089368,0.00004497882,0.1723597,0.005329511,0.007458402],"study_design_scores_gemma":[0.0003749222,0.000123063,0.00002860502,0.00001396145,0.00005159148,0.000007416716,0.005872268,0.8105367,0.00007592973,0.1479355,0.0345324,0.0004477012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005226932,0.001910209,0.9742844,0.003728977,0.000753378,0.001671022,0.000284508,0.0002656376,0.01187492],"genre_scores_gemma":[0.9163522,0.0002236708,0.07344547,0.0008852458,0.0004937982,0.002038501,0.000133648,0.00005165523,0.006375836],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9111252,"threshold_uncertainty_score":0.9999588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945824210","doi":"10.1007/s12065-020-00553-y","title":"Disparity-augmented trajectories for human activity recognition","year":2021,"lang":"en","type":"preprint","venue":"Evolutionary Intelligence","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Trajectory; Computer science; Artificial intelligence; Set (abstract data type); Representation (politics); Computer vision; Activity recognition; Motion (physics); Point (geometry); Pattern recognition (psychology); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06917636535091874,"gpt":0.3150061268269559,"spread":0.2458297614760372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002993671,0.0003854361,0.0003814226,0.0002334181,0.0005836458,0.0003998882,0.0008531035,0.0003684095,0.0002517248],"category_scores_gemma":[0.0001869309,0.0004469918,0.000362645,0.0003114571,0.0001098759,0.0008689751,0.0006720544,0.0006975731,0.00008256477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003496014,"about_ca_system_score_gemma":0.0003205265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001943084,"about_ca_topic_score_gemma":0.0001151147,"domain_scores_codex":[0.9973944,0.0001878755,0.0004801925,0.001100574,0.0004242867,0.0004126038],"domain_scores_gemma":[0.9978218,0.0002782721,0.0003415495,0.0007626473,0.0006614886,0.0001342596],"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.0001579261,0.003799064,0.0007389875,0.002245744,0.0008563497,0.0001124709,0.003629567,0.002906745,0.01298286,0.04368548,0.01446739,0.9144174],"study_design_scores_gemma":[0.0006073849,0.0006502604,0.01815543,0.001936793,0.0002417809,0.0001226513,0.0005863979,0.1456075,0.1415257,0.6802858,0.006956086,0.00332427],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06406628,0.0003887108,0.9298319,0.0005201101,0.003054741,0.0007575465,0.0001767182,0.000418437,0.0007855687],"genre_scores_gemma":[0.9613777,0.0002215366,0.03527793,0.0001614193,0.0005686354,0.000634412,0.001224017,0.00002848417,0.0005058763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9110932,"threshold_uncertainty_score":0.9997982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}