{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":762,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":762,"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":"531a2dd68840","filters":{"topic":"Metaheuristic Optimization Algorithms Research"}},"results":[{"id":"W2738900493","doi":"10.1016/j.advengsoft.2017.07.002","title":"Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems","year":2017,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4981,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Convergence (economics); Computer science; Swarm behaviour; Pareto principle; Multi-objective optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02226714207504294,"gpt":0.2812625154124628,"spread":0.2589953733374199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006817822,0.0003215487,0.0003783865,0.0003513152,0.0002231534,0.0004468677,0.001986673,0.0001148085,0.000006310732],"category_scores_gemma":[0.002425936,0.0003373233,0.00009129041,0.000336281,0.00004254769,0.001771878,0.0003597974,0.000265713,0.00001283846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000130435,"about_ca_system_score_gemma":0.00008134345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007371149,"about_ca_topic_score_gemma":0.00000109517,"domain_scores_codex":[0.9977676,0.00002472318,0.0004221009,0.0006532337,0.0004055559,0.0007268123],"domain_scores_gemma":[0.9977422,0.0005504815,0.0001506829,0.001188742,0.0001886248,0.0001792295],"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.000003578368,0.00003074764,0.00008152171,0.0001517995,0.00001516756,0.000017579,0.00008784579,0.905889,0.00003406038,0.000670499,0.00003455885,0.09298362],"study_design_scores_gemma":[0.0008497847,0.00007460366,0.0001772206,0.0001660503,0.000005059886,0.00001004013,0.000002367034,0.9875738,0.0008737554,0.0003343392,0.009536867,0.0003961197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002278532,0.00156639,0.9958028,0.0001323384,0.001032192,0.0008233751,0.00001398144,0.0005849512,0.000021241],"genre_scores_gemma":[0.002811514,0.0004250434,0.9958953,0.0000202751,0.0001250381,0.0005169166,0.000007860231,0.00006367259,0.0001344023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0925875,"threshold_uncertainty_score":0.9999079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1801849579","doi":"10.1016/s0167-739x(00)00043-1","title":"– Ant System","year":2000,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2698,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Travelling salesman problem; Ant colony optimization algorithms; Computer science; Benchmark (surveying); Quadratic assignment problem; Extremal optimization; Mathematical optimization; Parallel metaheuristic; Combinatorial optimization; Metaheuristic; Ant colony; Optimization problem; Artificial intelligence; Algorithm; Meta-optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01681498692808548,"gpt":0.2320439440966263,"spread":0.2152289571685409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005721984,0.0002113533,0.0002748098,0.0001729347,0.0002859392,0.001037124,0.0009341567,0.0001154495,0.0001123384],"category_scores_gemma":[0.000004354692,0.0001836464,0.00006906155,0.0006132674,0.00001797905,0.0004742817,0.0001018895,0.0001457882,0.000879877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001166352,"about_ca_system_score_gemma":0.0001010968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002250957,"about_ca_topic_score_gemma":0.000001624791,"domain_scores_codex":[0.9973883,0.0004242592,0.0005071988,0.0006093668,0.0007223405,0.0003485418],"domain_scores_gemma":[0.9984195,0.00003697474,0.0001003809,0.0009542519,0.0002891762,0.0001997309],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004201399,0.00007210622,0.00002508154,0.0001113502,0.00006143469,0.00008224219,0.0005277353,0.1355162,0.0001112355,0.1178306,0.5913973,0.1542605],"study_design_scores_gemma":[0.0001981432,0.00003722067,0.00003727741,0.00001398633,0.000002247753,0.0001220969,0.00001042052,0.7021792,0.00005095472,6.316396e-7,0.2972024,0.0001454679],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002603387,0.0006261996,0.9476088,0.0005487787,0.04745623,0.000407976,0.000005703159,0.0005265079,0.002559476],"genre_scores_gemma":[0.01772675,0.000109227,0.7166417,0.0005827383,0.2553385,0.0001957752,0.000120458,0.00006088971,0.009223957],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.566663,"threshold_uncertainty_score":0.9999999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123682012","doi":"10.1109/tevc.2007.894200","title":"Opposition-Based Differential Evolution","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1602,"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":"Differential evolution; Ode; Initialization; Evolutionary algorithm; Curse of dimensionality; Population; Mathematical optimization; Benchmark (surveying); Evolutionary computation; Computer science; Nonlinear system; Algorithm; Mathematics; Artificial intelligence; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02639547269231373,"gpt":0.262270554169624,"spread":0.2358750814773102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001533918,0.0002379071,0.0001997254,0.0006963758,0.001005596,0.00007530361,0.0004577938,0.0001229608,0.0001544194],"category_scores_gemma":[0.00001431832,0.0002605883,0.000161924,0.001098016,0.0001560965,0.0006856547,0.000004473037,0.000314068,0.0003670371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006737708,"about_ca_system_score_gemma":0.0004520925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003241889,"about_ca_topic_score_gemma":0.000002261291,"domain_scores_codex":[0.9973084,0.0003116877,0.000429642,0.0005848145,0.001000393,0.000365009],"domain_scores_gemma":[0.9985645,0.0003107356,0.0001211752,0.0004276354,0.0003760174,0.0001999278],"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.00003818054,0.000615373,0.00001950267,0.00001228295,0.00003065496,0.00002202653,0.00007656888,0.9900583,0.0005725158,0.003589893,0.001213962,0.003750723],"study_design_scores_gemma":[0.0008741396,0.0002082558,0.002468908,0.00001729599,0.00001183071,0.00008148465,0.000006545283,0.9927893,0.001193119,0.00204349,0.00004759704,0.0002580254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002022912,0.00002253969,0.9946393,0.0007735019,0.001181744,0.0003937491,0.00002677613,0.0005516175,0.0003878023],"genre_scores_gemma":[0.8638417,0.000009936832,0.1355774,0.0001211416,0.00007003888,0.00007715366,0.00003639799,0.00001946391,0.0002467781],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8618188,"threshold_uncertainty_score":0.9999846,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137849348","doi":"10.1016/s0166-218x(01)00338-9","title":"A survey of very large-scale neighborhood search techniques","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":639,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Heuristic; Mathematics; Mathematical optimization; Local search (optimization); Variable neighborhood search; Search algorithm; Computation; Algorithm; Incremental heuristic search; Scale (ratio); Computer science; Beam search; Metaheuristic","retraction":null,"screen_n_in":null,"score":{"opus":0.04136196228381948,"gpt":0.2908560751222848,"spread":0.2494941128384653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001419591,0.0001886223,0.0003902846,0.0002071049,0.00009578081,0.0001231751,0.001229606,0.0000974069,0.0002968451],"category_scores_gemma":[0.0001930637,0.0001666207,0.0000640709,0.001017743,0.00009415048,0.0001614885,0.0005638502,0.000217009,0.000153591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000294477,"about_ca_system_score_gemma":0.00004372761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215455,"about_ca_topic_score_gemma":0.000004541424,"domain_scores_codex":[0.9977009,0.00008751827,0.0005259981,0.0003700017,0.000868696,0.0004469382],"domain_scores_gemma":[0.9978788,0.0004175797,0.0001548436,0.001124601,0.000278585,0.0001455773],"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.00002770496,0.003537973,0.001054852,0.001650993,0.0003024093,0.00003424893,0.01882934,0.0006344219,0.005485534,0.8500903,0.01067614,0.107676],"study_design_scores_gemma":[0.0003189564,0.00005614808,0.0004235162,0.00002959191,0.000008434212,0.000004612092,0.0001286308,0.9851815,0.009655465,0.003766138,0.0001789676,0.0002480774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005521814,0.00006242563,0.9617215,0.00009188481,0.0000343581,0.0004487387,0.00003852905,0.0001803512,0.03686998],"genre_scores_gemma":[0.2225694,0.00009037697,0.7766513,0.00005410606,0.00002369868,0.00006045702,0.00001899492,0.00003526104,0.0004963793],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.984547,"threshold_uncertainty_score":0.6794596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026267944","doi":"10.5267/j.ijiec.2012.03.007","title":"An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":504,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Computer science; Population; Algorithm; Mathematical optimization; Optimization algorithm; Population-based incremental learning; Range (aeronautics); Optimization problem; Process (computing); Artificial intelligence; Machine learning; Mathematics; Genetic algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04507322606150652,"gpt":0.3144906225427194,"spread":0.2694173964812128,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001648801,0.000219814,0.0002907449,0.0008225393,0.000218544,0.0005707341,0.001031648,0.0001381453,0.00006528621],"category_scores_gemma":[0.001593402,0.0002345563,0.0001456497,0.0003709825,0.00004453252,0.001515818,0.00007255416,0.0005608593,0.000002327319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002596777,"about_ca_system_score_gemma":0.0003557541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001107768,"about_ca_topic_score_gemma":1.710081e-7,"domain_scores_codex":[0.9974361,0.0001715754,0.0009190994,0.0002255276,0.0008704205,0.0003772458],"domain_scores_gemma":[0.9963553,0.0007175133,0.0006189679,0.0001808814,0.001804116,0.0003232328],"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.000009588666,0.0002133897,0.00005249274,0.000005585669,0.0001003911,0.000003797021,0.0001726969,0.9673803,0.00006277186,0.00206445,0.0002200033,0.02971451],"study_design_scores_gemma":[0.0020292,0.000231569,0.00003712361,0.00008329688,0.00002342051,0.00008611727,0.00002706673,0.9956849,0.00007143128,0.00002902793,0.001475579,0.0002212438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007667584,0.00003080719,0.9961925,0.0009056603,0.002204503,0.0003635201,0.0000331068,0.000147797,0.00004549888],"genre_scores_gemma":[0.1203343,0.0000057516,0.8779535,0.00007969113,0.001349817,0.00002087644,0.0002077234,0.00003389295,0.00001445423],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1202576,"threshold_uncertainty_score":0.9564928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038636021","doi":"10.1016/j.ins.2011.03.016","title":"Enhancing particle swarm optimization using generalized opposition-based learning","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":473,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"National Natural Science Foundation of China","keywords":"Premature convergence; Initialization; Mathematical optimization; Particle swarm optimization; Local optimum; Differential evolution; Population; Benchmark (surveying); Computer science; Mathematics; Ode; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09140839569055396,"gpt":0.3139838274931784,"spread":0.2225754318026244,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141904,0.0001035993,0.0001090847,0.0002985203,0.000640828,0.0006046342,0.0006595627,0.00004162876,0.0002417655],"category_scores_gemma":[0.0003386708,0.00009428874,0.00003782104,0.001416261,0.0001282439,0.004662014,0.0001128862,0.00009537584,0.0001010708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005476501,"about_ca_system_score_gemma":0.0002971149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001072054,"about_ca_topic_score_gemma":0.000001741456,"domain_scores_codex":[0.9981843,0.0001455633,0.0004511293,0.0001913747,0.0007186899,0.0003089921],"domain_scores_gemma":[0.9989846,0.00008081787,0.0002353957,0.0002127143,0.0003653486,0.00012117],"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.000002697318,0.00001521903,0.0003473827,0.00000668522,0.000002709153,6.754019e-7,0.001406926,0.9905499,0.0002588724,0.004568126,0.00001044491,0.002830355],"study_design_scores_gemma":[0.0002395936,0.00005487117,0.00009953142,0.00001167279,0.000002660266,0.000004682423,0.0001266641,0.9718193,0.02726072,0.0001286211,0.0001279747,0.000123652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01179587,0.00001143786,0.9849668,0.0001229782,0.0001986828,0.0001612408,8.113616e-7,0.0001806696,0.002561584],"genre_scores_gemma":[0.3152099,0.000004360618,0.6844562,0.0002744832,0.0000146559,0.00001124172,0.000004449647,0.000002737349,0.00002199728],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.303414,"threshold_uncertainty_score":0.5830501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045050140","doi":"10.1016/j.ins.2014.10.042","title":"Metaheuristics in large-scale global continues optimization: A survey","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":470,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Metaheuristic; Computer science; Parallel metaheuristic; Decomposition; Engineering optimization; Search-based software engineering; Scale (ratio); Field (mathematics); Mathematical optimization; Optimization problem; Global optimization; Management science; Industrial engineering; Artificial intelligence; Algorithm; Meta-optimization; Engineering; Mathematics; Software; Software development","retraction":null,"screen_n_in":null,"score":{"opus":0.02750561603582747,"gpt":0.3127759119738857,"spread":0.2852702959380582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005475319,0.0001229603,0.0001962824,0.0002986489,0.0002379574,0.0009519263,0.001308395,0.00005769713,0.00008106792],"category_scores_gemma":[0.002304965,0.0001077717,0.00003162055,0.002795252,0.0001608747,0.003402543,0.0002830519,0.00009614342,0.000178127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005422459,"about_ca_system_score_gemma":0.0001938307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001131621,"about_ca_topic_score_gemma":0.0001283598,"domain_scores_codex":[0.9974499,0.0003699026,0.000584883,0.0002428021,0.0009588496,0.0003936152],"domain_scores_gemma":[0.9985133,0.0003269617,0.0002079849,0.0003592256,0.0004717193,0.0001208302],"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.000008489389,0.00008995253,0.09182621,0.00002216194,0.000007751894,0.00000125149,0.001624502,0.8086691,4.626248e-7,0.0630297,0.002427932,0.03229241],"study_design_scores_gemma":[0.0003273621,0.00004011183,0.03981882,0.000006679327,9.558958e-7,0.000004414708,0.00006669688,0.9541472,0.000008766847,0.0006507827,0.004801141,0.0001271125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006783865,0.00001773155,0.9716517,0.0004815919,0.000346135,0.0001684483,0.00002163048,0.00009706669,0.0265373],"genre_scores_gemma":[0.2645101,0.0000311159,0.7342972,0.0009069897,0.00003953809,0.00002425206,0.000043867,0.000003516977,0.0001433909],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2638317,"threshold_uncertainty_score":0.9179448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2760225670","doi":"10.1016/j.swevo.2017.09.010","title":"Opposition based learning: A literature review","year":2017,"lang":"en","type":"review","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":465,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Opposition (politics); Reinforcement learning; Variety (cybernetics); Artificial intelligence; Artificial neural network; Machine learning; Management science; Operations research; Law; Mathematics; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.0812765835477228,"gpt":0.3908341177917897,"spread":0.3095575342440668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007536682,0.0003746389,0.0009644448,0.0004362584,0.0006088771,0.0005453851,0.0007253584,0.0002408517,0.00001559627],"category_scores_gemma":[0.0003496065,0.000330341,0.0002578144,0.0006316158,0.00008065387,0.0006125824,0.0002865733,0.0006092802,0.000106613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001322013,"about_ca_system_score_gemma":0.000585296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002145588,"about_ca_topic_score_gemma":1.108582e-7,"domain_scores_codex":[0.9970588,0.0007312881,0.0005876732,0.0007426183,0.0005890639,0.0002905704],"domain_scores_gemma":[0.9979688,0.0002678191,0.0005905407,0.0005427913,0.0004463146,0.000183751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[8.786578e-7,0.00003346145,3.188382e-7,0.02708036,0.00003005365,0.0000391751,0.00001367657,0.0005568798,1.816504e-8,0.0005575372,0.005370482,0.9663172],"study_design_scores_gemma":[0.0001320715,0.00007578944,0.000004518535,0.04345275,0.0001089876,0.0001800916,2.968133e-7,0.1861458,3.265941e-8,0.0004080541,0.7692063,0.0002853225],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[6.715205e-9,0.6198131,0.3786579,0.0002690705,0.0002095142,0.000563018,0.00001211758,0.0001108222,0.0003644534],"genre_scores_gemma":[8.665625e-7,0.9176486,0.08029886,0.0001069359,0.0001406004,0.0001080048,0.001109672,0.0000247136,0.0005617604],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9660318,"threshold_uncertainty_score":0.9999149,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157833270","doi":"10.1109/cec.2007.4424748","title":"Quasi-oppositional Differential Evolution","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":447,"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":"Ode; Initialization; Differential evolution; Benchmark (surveying); Applied mathematics; Computer science; Test suite; Suite; Population; Algorithm; Mathematical optimization; Mathematics; Test case; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01624056719856473,"gpt":0.2861569665247169,"spread":0.2699163993261522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004351965,0.00006697008,0.0000685152,0.0001696101,0.0001049396,0.0001077366,0.0004428569,0.00003903708,0.0007285219],"category_scores_gemma":[0.00006762915,0.00005895989,0.00003600291,0.0003668006,0.00003220904,0.0002575527,0.0001523282,0.00008703107,0.0003257394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007193014,"about_ca_system_score_gemma":0.0000605541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611214,"about_ca_topic_score_gemma":0.000004229932,"domain_scores_codex":[0.9987559,0.00004236963,0.0001788942,0.0002266369,0.0005400182,0.0002562384],"domain_scores_gemma":[0.9992937,0.0001092304,0.00002973547,0.0002754442,0.0001594969,0.0001323311],"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.000006079612,0.0002264755,0.0002267661,0.000003290268,0.000009393323,0.00001164498,0.00003610388,0.00009220767,0.0006386171,0.9779631,0.001663427,0.01912291],"study_design_scores_gemma":[0.0004259819,0.0001175878,0.02105707,0.000003570422,0.000002509511,0.00002963891,0.0000112882,0.9667965,0.001796306,0.008378687,0.00120698,0.0001738636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008461958,0.00001206832,0.9811298,0.0004540632,0.0003134852,0.00008141424,8.749159e-7,0.0001496313,0.01701247],"genre_scores_gemma":[0.6146784,0.00000181218,0.382074,0.00009878047,0.0001273891,0.000003252638,0.000006232122,0.000004527953,0.003005564],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9695844,"threshold_uncertainty_score":0.7976804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062355752","doi":"10.1016/j.ins.2012.10.012","title":"Diversity enhanced particle swarm optimization with neighborhood search","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":402,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"Nanchang Institute of Technology; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Particle swarm optimization; Premature convergence; Convergence (economics); Mathematical optimization; Computer science; Set (abstract data type); Diversity (politics); Multi-swarm optimization; Metaheuristic; Local search (optimization); Swarm behaviour; Artificial intelligence; Mathematics; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.04076355132915047,"gpt":0.2876941417484873,"spread":0.2469305904193368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390072,0.00009295146,0.00009283449,0.0001903664,0.001248849,0.000379473,0.0008789388,0.00003225856,0.0001228884],"category_scores_gemma":[0.0001479817,0.0000703617,0.00002036879,0.001900587,0.0001842148,0.01023261,0.0008090269,0.00008805527,0.0002232125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004629815,"about_ca_system_score_gemma":0.0001519201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003185096,"about_ca_topic_score_gemma":0.000001026806,"domain_scores_codex":[0.9979044,0.00008618084,0.0002311206,0.0001451888,0.001186467,0.000446662],"domain_scores_gemma":[0.9989711,0.0001032463,0.0001041524,0.0002665711,0.0003466961,0.0002082265],"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.00001411308,0.0001003119,0.01301922,0.00001774968,0.00001430407,5.187209e-7,0.02092209,0.8802959,0.00002591467,0.03560472,0.0001743909,0.04981075],"study_design_scores_gemma":[0.0002768784,0.00008462166,0.002816339,0.000005119422,0.00000180326,0.000005707147,0.0006138239,0.9919043,0.003936162,0.00006907366,0.0001599437,0.0001262612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01907903,0.00001551172,0.9693183,0.0005310204,0.0001730538,0.000187738,0.000001437308,0.0001220265,0.01057188],"genre_scores_gemma":[0.8576575,0.00001167683,0.142005,0.0002377626,0.0000284895,0.000008775567,0.000002735504,0.000001730961,0.00004634294],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8385785,"threshold_uncertainty_score":0.9605261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084993914","doi":"10.1016/j.camwa.2006.07.013","title":"A novel population initialization method for accelerating evolutionary algorithms","year":2007,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":377,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Initialization; Population; Benchmark (surveying); Convergence (economics); Computer science; Mathematical optimization; Evolutionary algorithm; Algorithm; Set (abstract data type); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0573682288893775,"gpt":0.3569625786743005,"spread":0.2995943497849231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178903,0.0002207434,0.0002648077,0.0003507083,0.0004812658,0.0002786123,0.0008200805,0.00009117396,0.000007590259],"category_scores_gemma":[0.0001167044,0.0002073636,0.0000677185,0.001222081,0.00004456049,0.0004475416,0.0001858556,0.0001355469,0.00001443881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001342998,"about_ca_system_score_gemma":0.0001120489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001547619,"about_ca_topic_score_gemma":0.000005456142,"domain_scores_codex":[0.9978204,0.00003668833,0.0006346247,0.0005451667,0.0005517905,0.0004113157],"domain_scores_gemma":[0.997163,0.00086399,0.0003489701,0.0007569473,0.0006857921,0.0001812862],"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.000009813569,0.0005541407,0.00005828265,0.000190828,0.00007280452,0.00000168446,0.0008195598,0.0235802,0.0006605432,0.8041804,0.000476123,0.1693956],"study_design_scores_gemma":[0.0005820245,0.00006009531,0.0006186399,0.00003509347,0.00002014716,0.00006398024,0.00004662304,0.9832091,0.0001856465,0.01346678,0.001466468,0.0002453827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000278703,0.00002400655,0.9965509,0.0003410873,0.0001051639,0.001980591,0.00001572343,0.0003311338,0.0006234802],"genre_scores_gemma":[0.002213321,0.000004153945,0.9965015,0.0001669251,0.0001940591,0.0006303668,0.0001572153,0.00003675677,0.00009571484],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9596289,"threshold_uncertainty_score":0.8456042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982970548","doi":"10.1007/s00500-010-0591-1","title":"DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization","year":2010,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":367,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"China University of Geosciences; China Scholarship Council","keywords":"Differential evolution; Benchmark (surveying); Evolutionary algorithm; Computer science; Global optimization; Curse of dimensionality; Mathematical optimization; Convergence (economics); Range (aeronautics); Evolutionary computation; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009130652461568212,"gpt":0.2613821391107193,"spread":0.2522514866491511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004860194,0.0002462537,0.0002461688,0.0002261208,0.000465246,0.0005379159,0.0007465448,0.0001033711,0.00005197942],"category_scores_gemma":[0.0003741694,0.0002316973,0.0001164075,0.001152982,0.0001065128,0.0003059901,0.0001680141,0.0002477765,0.000003946445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001206586,"about_ca_system_score_gemma":0.0004029349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000315973,"about_ca_topic_score_gemma":0.000001907122,"domain_scores_codex":[0.997669,0.0001354116,0.0003727297,0.0006515619,0.0005635777,0.0006077197],"domain_scores_gemma":[0.9981539,0.0002595808,0.0002301065,0.0005030737,0.0006171798,0.0002361856],"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.00003386195,0.000119839,0.002481636,0.00002425563,0.0000225641,0.000003479184,0.00002821984,0.9820101,0.00003525448,0.005563052,0.00006451423,0.009613175],"study_design_scores_gemma":[0.001124668,0.000155734,0.0006369616,0.00002249707,0.00001974342,0.00002860678,0.000006366276,0.9972147,0.0001312697,0.0003257791,0.00005986843,0.0002738259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00260591,0.00001296869,0.9953242,0.0003528014,0.0005379639,0.0005837202,0.00001660915,0.0004585114,0.000107335],"genre_scores_gemma":[0.4051571,4.3365e-7,0.5945538,0.00005903709,0.0001296566,0.00002030979,0.00005722384,0.00001630821,0.000006020907],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4025513,"threshold_uncertainty_score":0.9448344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2961079568","doi":"10.5267/j.ijiec.2019.6.002","title":"Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Algorithm; Simple (philosophy); Dimension (graph theory); Mathematical optimization; Computer science; Optimization problem; Optimization algorithm; Continuous optimization; Process (computing); Mathematics; Multi-swarm optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.06204859873689692,"gpt":0.3061649612971565,"spread":0.2441163625602596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156638,0.0002359695,0.000395745,0.0009213403,0.00009448045,0.0005909222,0.001658351,0.0001479402,0.00006421501],"category_scores_gemma":[0.0009965538,0.0002348876,0.0002382932,0.0006794871,0.0000256884,0.001117218,0.0002254678,0.0004515509,0.00001324069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000256272,"about_ca_system_score_gemma":0.0004399124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002432194,"about_ca_topic_score_gemma":0.000001236722,"domain_scores_codex":[0.9970833,0.00005026234,0.001043031,0.0003285091,0.001149142,0.0003457554],"domain_scores_gemma":[0.9957309,0.0008254338,0.0005910037,0.0002776929,0.002381174,0.0001938191],"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.00001397741,0.00007585101,0.00009781768,0.00001030472,0.0002748065,0.000009834542,0.0001103895,0.9702231,0.0001118496,0.003312417,0.000537629,0.02522201],"study_design_scores_gemma":[0.002246009,0.0001678234,0.00005897533,0.000103196,0.00002519277,0.00009127249,0.0000258298,0.9934305,0.0002753388,0.0006954426,0.002652824,0.000227574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001177318,0.0000950155,0.9922504,0.001253837,0.004453718,0.0005889991,0.00003389355,0.00009175763,0.00005509907],"genre_scores_gemma":[0.05551127,0.00003470882,0.942699,0.00008959315,0.001407023,0.00003833278,0.00006989983,0.00005344081,0.00009673591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05433396,"threshold_uncertainty_score":0.957844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229942708","doi":"10.1007/978-3-319-41192-7","title":"Search and Optimization by Metaheuristics","year":2016,"lang":"en","type":"book","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02225960806332289,"gpt":0.2743247402065508,"spread":0.252065132143228,"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.0007104636,0.0003332782,0.0004166429,0.0003486133,0.00014133,0.0004888102,0.001198371,0.0003099248,0.001019511],"category_scores_gemma":[0.0002246321,0.0002551006,0.00006146015,0.000194729,0.0001796433,0.0003362086,0.0008964563,0.0003480135,0.0002890026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001451909,"about_ca_system_score_gemma":0.0005949134,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004716768,"about_ca_topic_score_gemma":3.447498e-7,"domain_scores_codex":[0.9970676,0.0001680269,0.0004261391,0.0008445357,0.001061327,0.0004323523],"domain_scores_gemma":[0.9976687,0.0004299339,0.0001028229,0.0009500472,0.00052058,0.0003278486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004530066,0.00004143507,0.000001987784,0.0001059998,0.0001270496,0.00002978195,0.00004905247,0.00461248,0.000009214042,0.1723656,0.7602625,0.06239028],"study_design_scores_gemma":[0.0003212947,0.00006059746,4.12851e-7,0.00004020245,0.00001786005,0.00001814939,9.005207e-7,0.7775747,0.00006996872,0.002318698,0.2191816,0.0003956977],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[2.02513e-8,0.0005033144,0.7007668,0.0006836121,0.000158704,0.000263118,0.0000454143,0.0001538592,0.2974252],"genre_scores_gemma":[7.79841e-7,0.001213478,0.3798523,0.0001259308,0.00008018948,0.000009514169,0.00005378652,0.00003349888,0.6186305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7729622,"threshold_uncertainty_score":0.9999901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3035777076","doi":"10.1109/tfuzz.2020.3003506","title":"Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":273,"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":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Job shop scheduling; Fuzzy logic; Selection (genetic algorithm); Particle swarm optimization; Differential evolution; Ant colony optimization algorithms; Algorithm; Metaheuristic; Scheduling (production processes); Cuckoo search; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03094422708337601,"gpt":0.2688349960740788,"spread":0.2378907689907028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008832919,0.0003594715,0.0004298273,0.0003293884,0.0006728895,0.0007804609,0.0008125534,0.0002303065,0.00002267795],"category_scores_gemma":[0.00003576948,0.00038342,0.0001571397,0.001641116,0.00004043375,0.0007694224,0.00001303295,0.0006962448,0.00007695618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004272887,"about_ca_system_score_gemma":0.0004261004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003757992,"about_ca_topic_score_gemma":0.000006157391,"domain_scores_codex":[0.9963502,0.0004656772,0.0006854724,0.0009078946,0.000811656,0.0007790782],"domain_scores_gemma":[0.9982379,0.0001616727,0.0002207179,0.0004520611,0.0003963722,0.000531278],"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.0000390704,0.000299544,0.000005672098,0.0003712407,0.0002937943,0.00002925784,0.001891095,0.7592595,0.1887363,0.001820412,0.0003452294,0.04690895],"study_design_scores_gemma":[0.0006176288,0.0002059408,4.356264e-7,0.00007710535,0.00003312141,0.00008451786,0.0001667914,0.9797242,0.01839809,0.0001753209,0.0001528021,0.0003640669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004991199,0.0001149674,0.9958938,0.0005232012,0.0009874352,0.0009749535,0.0000345088,0.0006433011,0.0003287462],"genre_scores_gemma":[0.2841331,0.00004621311,0.714579,0.0002291044,0.0002509165,0.000183462,0.000003539667,0.00007935808,0.0004952716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.283634,"threshold_uncertainty_score":0.9998618,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066173509","doi":"10.1109/tsmcb.2012.2213808","title":"Gaussian Bare-Bones Differential Evolution","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":268,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Differential evolution; Gaussian; Task (project management); Mathematical optimization; Algorithm; Computer science; Differential (mechanical device); Gaussian process; Optimization problem; Mathematics; Engineering; Physics; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.02244593156429011,"gpt":0.2691512136448326,"spread":0.2467052820805425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002085604,0.0001831013,0.0001624295,0.0002657336,0.0002276246,0.0001398139,0.0005363713,0.0001573254,0.0004745433],"category_scores_gemma":[0.00001166944,0.0001746144,0.00009699297,0.000540684,0.00007568356,0.0004055464,0.000006321534,0.0004225082,0.0005592357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001254523,"about_ca_system_score_gemma":0.00006423795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003599055,"about_ca_topic_score_gemma":0.00001044906,"domain_scores_codex":[0.9981172,0.0001555782,0.0002759226,0.0003011876,0.0006331899,0.0005169095],"domain_scores_gemma":[0.9987737,0.0001253423,0.00004038082,0.0006300189,0.000117625,0.0003129529],"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.0001829303,0.008952024,0.0009136617,0.0002109951,0.0006405753,0.00004391774,0.009791532,0.1664613,0.01203127,0.2372821,0.007054206,0.5564355],"study_design_scores_gemma":[0.001107989,0.0002478869,0.005125289,0.00003457605,0.00006340379,0.00005706132,0.00006823177,0.9584576,0.02976305,0.0007914736,0.003600652,0.0006827874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002569627,0.00005678643,0.9930427,0.0003715489,0.0019868,0.0001976601,0.00001181549,0.0002057601,0.001557303],"genre_scores_gemma":[0.9434506,0.00004570125,0.05419144,0.00006435391,0.0001426296,0.00003266866,0.000002073719,0.00002086061,0.002049708],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.940881,"threshold_uncertainty_score":0.718803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2893066337","doi":"10.1007/s00500-018-3536-8","title":"Phasor particle swarm optimization: a simple and efficient variant of PSO","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":262,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Particle swarm optimization; Phasor; Multi-swarm optimization; Benchmark (surveying); Mathematical optimization; Mathematics; Derivative-free optimization; Algorithm; Meta-optimization; Computer science; Electric power system; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.02121247710130197,"gpt":0.2948523991375553,"spread":0.2736399220362534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007621873,0.0001048627,0.0001752926,0.00008429066,0.0002258991,0.0001404948,0.0004377567,0.00003480856,0.00005765384],"category_scores_gemma":[0.0004099382,0.00009953604,0.00002858715,0.0007004975,0.0001599997,0.0001029805,0.0005199716,0.00007920048,0.00001822207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001881543,"about_ca_system_score_gemma":0.00008206016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001493905,"about_ca_topic_score_gemma":5.205321e-7,"domain_scores_codex":[0.998509,0.0001130077,0.0003358804,0.0003614067,0.0003689574,0.0003117432],"domain_scores_gemma":[0.9986796,0.0002804296,0.0001324447,0.0003992266,0.0003772815,0.0001309727],"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.00001096624,0.0001803549,0.0005413805,0.00004154054,0.00003179891,0.00001599815,0.002063356,0.9280584,0.0002591631,0.01575536,0.0002298913,0.05281173],"study_design_scores_gemma":[0.000426218,0.0001015189,0.0002602759,0.00001539346,0.000004496422,0.00002243134,0.00002573332,0.9965436,0.002143117,0.0001846466,0.0001688199,0.0001037226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02772792,0.00007038524,0.9710366,0.0002564326,0.0001744876,0.0001573186,0.000001479459,0.0001067886,0.0004685814],"genre_scores_gemma":[0.617903,0.000002223623,0.3819096,0.00006703238,0.0000796675,0.000001317649,9.778398e-7,0.000006805094,0.00002933287],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5901751,"threshold_uncertainty_score":0.4058962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013517059","doi":"10.1016/j.ins.2014.04.013","title":"Multi-strategy ensemble artificial bee colony algorithm","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":260,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ontario Institute of Technology","funders":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Artificial bee colony algorithm; Evolutionary algorithm; Set (abstract data type); Process (computing); Population; Algorithm; Local search (optimization); Search algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06196425370856051,"gpt":0.3306889462073624,"spread":0.2687246924988019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00219677,0.0001149523,0.000135802,0.000365964,0.0004938125,0.001264874,0.001273028,0.00005847724,0.00008009368],"category_scores_gemma":[0.0005517683,0.00009781047,0.00003906892,0.001284237,0.0002391979,0.003947956,0.0002029005,0.0001170295,0.001155219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003028999,"about_ca_system_score_gemma":0.0002330927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005138764,"about_ca_topic_score_gemma":0.000007478123,"domain_scores_codex":[0.9978313,0.0001277905,0.0004697834,0.0002294456,0.0009697679,0.0003719321],"domain_scores_gemma":[0.9988489,0.0001936926,0.0001851427,0.0002680478,0.0003560885,0.0001481516],"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.000001236725,0.0000338502,0.00003106518,0.000006964412,0.000003739123,7.231046e-7,0.0007162575,0.01482448,0.0001923071,0.03945737,0.001856003,0.942876],"study_design_scores_gemma":[0.000157664,0.00009542787,0.000366381,0.000003725598,0.000001030029,0.000008590322,0.00009597931,0.982078,0.001185347,0.001817869,0.01406076,0.000129198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003918651,0.000008133038,0.9864447,0.0008573444,0.00035738,0.0001749839,0.000003693968,0.0001577641,0.01160413],"genre_scores_gemma":[0.08057384,0.000009584158,0.9181421,0.0008247941,0.00008031207,0.0000277403,0.000006626199,0.000003343793,0.0003316446],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9672536,"threshold_uncertainty_score":0.9997719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098540440","doi":"10.1109/tsmcb.2010.2056367","title":"Enhanced Differential Evolution With Adaptive Strategies for Numerical Optimization","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":229,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Differential evolution; Benchmark (surveying); Computer science; Mathematical optimization; Scalability; Convergence (economics); Evolutionary algorithm; Optimization problem; Global optimization; Evolution strategy; Adaptive strategies; Adaptation (eye); Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01794864544707643,"gpt":0.2511247999847204,"spread":0.233176154537644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002612151,0.0003792476,0.0004051355,0.0002650974,0.0003640636,0.0007036288,0.0004987012,0.0002283495,0.00007456334],"category_scores_gemma":[0.00001401194,0.0003373266,0.00009238935,0.0004391256,0.0002200313,0.0003633871,0.00001051416,0.0004753129,0.00002855563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006809299,"about_ca_system_score_gemma":0.0002030918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008964558,"about_ca_topic_score_gemma":0.00006612001,"domain_scores_codex":[0.9972708,0.0001703951,0.0005287774,0.0007972079,0.0007010638,0.0005318224],"domain_scores_gemma":[0.9980232,0.0002603291,0.0002093551,0.0006735944,0.0005131766,0.0003204142],"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.0002121138,0.0005070474,0.000006977142,0.00009561106,0.0001758696,0.000006052447,0.0007876086,0.9090278,0.001467959,0.07975711,0.0002608199,0.007695089],"study_design_scores_gemma":[0.001273001,0.0007796385,0.00005802692,0.00005684833,0.00006358339,0.00003412864,0.0002188424,0.9940773,0.00211278,0.0003211284,0.0005727526,0.0004319554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002881341,0.00004006368,0.9929364,0.000115839,0.001446186,0.001131792,0.00004535908,0.0001977095,0.001205323],"genre_scores_gemma":[0.9206284,0.00005063185,0.07679453,0.00002503517,0.0001640753,0.0003425006,0.00001047307,0.00004851441,0.001935883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.917747,"threshold_uncertainty_score":0.9999079,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153260109","doi":"10.1109/tcyb.2013.2279211","title":"Differential Evolution With Two-Level Parameter Adaptation","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":226,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Beijing Information Science and Technology University; Huazhong University of Science and Technology; Shenyang Institute of Automation; National Natural Science Foundation of China; Ministère de l'Économie, de l’Innovation et des Exportations du Québec","keywords":"Population; Convergence (economics); Computer science; Adaptive control; Mathematical optimization; Mathematics; Algorithm; Artificial intelligence; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.03422211415081033,"gpt":0.2601096161588607,"spread":0.2258875020080504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001667977,0.0001817579,0.0001638202,0.0002363143,0.0001839658,0.0001885818,0.0004477528,0.00007124583,0.0001290431],"category_scores_gemma":[0.00002403288,0.0001574767,0.0000604793,0.0004852735,0.00008480435,0.0002425145,0.000003504812,0.0002718079,0.0001638566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009027038,"about_ca_system_score_gemma":0.00007880192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006479174,"about_ca_topic_score_gemma":0.00007046354,"domain_scores_codex":[0.998139,0.0001982028,0.0002496086,0.0004196634,0.0006863571,0.0003072067],"domain_scores_gemma":[0.9986348,0.0003006483,0.00007822849,0.0006001306,0.0002312384,0.0001549092],"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.0000602955,0.000420141,0.00001704668,0.00001614625,0.00006925615,0.000004207933,0.000471817,0.7455037,0.0004801896,0.01573602,0.00008708268,0.2371341],"study_design_scores_gemma":[0.0008775725,0.000312057,0.0003689529,0.00001577407,0.00002330842,0.00001257548,0.00001138556,0.9924703,0.004530087,0.001008475,0.0001688133,0.0002007289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002534359,0.000003497275,0.9955922,0.0002350677,0.0005002602,0.0002266717,0.00000933295,0.0001599939,0.000738659],"genre_scores_gemma":[0.7237379,0.00000638039,0.2750639,0.00005619949,0.00004041809,0.00003252799,0.000002412763,0.00001675578,0.001043542],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7212035,"threshold_uncertainty_score":0.6421715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155370091","doi":"10.1007/s00500-010-0642-7","title":"Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems","year":2010,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Differential evolution; Initialization; Ode; Opposition (politics); Mathematical optimization; Computer science; Population; Mathematics; Evolutionary algorithm; Algorithm; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0106242622329757,"gpt":0.2517901850349561,"spread":0.2411659228019804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006294003,0.0002100497,0.0002547458,0.0002420097,0.0006147508,0.0003896639,0.0006218525,0.0001306433,0.00007702191],"category_scores_gemma":[0.0005322509,0.0002164704,0.00009764831,0.0004273781,0.00007569163,0.0003065992,0.0002230845,0.0003113632,0.00001454742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062022,"about_ca_system_score_gemma":0.0002606733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002186749,"about_ca_topic_score_gemma":0.000005711314,"domain_scores_codex":[0.9977607,0.0000867013,0.0004656521,0.0006194061,0.000560119,0.0005074631],"domain_scores_gemma":[0.9978333,0.0006341396,0.0002560067,0.0004402364,0.0006772426,0.0001590609],"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.00001059858,0.0001182019,0.0000498685,0.00004024757,0.00001740049,0.000001617914,0.00007075597,0.9469119,0.02914473,0.01794834,0.0001160907,0.005570314],"study_design_scores_gemma":[0.001062278,0.00008557779,0.0002040022,0.00004356796,0.000009635037,0.000005769177,0.000003581201,0.9918062,0.005139809,0.001386726,0.00001007547,0.0002427412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081278,0.000009975844,0.9859574,0.0004002738,0.001642844,0.0007332058,0.000007755814,0.0003736646,0.00006203329],"genre_scores_gemma":[0.5531131,1.551829e-7,0.4465085,0.00005446912,0.0001943978,0.00002539061,0.00005447866,0.00001617946,0.00003334867],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5423003,"threshold_uncertainty_score":0.8827409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088999732","doi":"10.1080/15732470500254535","title":"A modified shuffled frog-leaping optimization algorithm: applications to project management","year":2006,"lang":"en","type":"article","venue":"Structure and Infrastructure Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":188,"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":"Benchmark (surveying); Computer science; Algorithm; Particle swarm optimization; Flowchart; Range (aeronautics); Mathematical optimization; USable; Domain (mathematical analysis); Evolutionary algorithm; Mathematics; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.005988490860227859,"gpt":0.2329618345007944,"spread":0.2269733436405665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001074153,0.0002799862,0.0002355058,0.0005220392,0.0001703997,0.0003562409,0.0005549251,0.0001078457,0.00002936715],"category_scores_gemma":[0.00002117016,0.0002654628,0.00003914536,0.001167017,0.00002192983,0.000343997,0.0003132399,0.0002313231,0.000002155819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007403178,"about_ca_system_score_gemma":0.00003644879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001863751,"about_ca_topic_score_gemma":7.804067e-7,"domain_scores_codex":[0.9982467,0.00002692672,0.0003339351,0.0005834267,0.0003974996,0.0004114745],"domain_scores_gemma":[0.9991403,0.00003608954,0.00006730676,0.000500452,0.0001229739,0.000132844],"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.000001931114,0.000005175227,0.00001470447,0.00005033754,0.00002574635,0.000005411085,0.00008602851,0.9426198,0.0003071995,0.01721502,0.0004755084,0.03919314],"study_design_scores_gemma":[0.000336771,0.0000215502,0.0009392714,0.00001768857,0.00001267526,0.00002784611,0.00001239863,0.9897929,0.0003428632,0.001285083,0.00691495,0.0002959492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003468082,0.0001338456,0.9973068,0.0001097514,0.0002127746,0.0009217876,0.00002378415,0.0002937705,0.0006506654],"genre_scores_gemma":[0.04024265,0.00002301925,0.9590104,0.00009432113,0.0002543115,0.0001220602,0.00005498205,0.00003069731,0.0001675348],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04717315,"threshold_uncertainty_score":0.9999797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994895518","doi":"10.1007/s10898-007-9234-1","title":"Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search","year":2007,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Mathematics; Variable neighborhood search; Mathematical optimization; Metaheuristic; Convergence (economics); Local search (optimization); Variable (mathematics); Guided Local Search; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02169005376408899,"gpt":0.2979204776592476,"spread":0.2762304238951586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328646,0.0002663189,0.0004570952,0.0002856858,0.000283322,0.000488432,0.0008627698,0.0001868971,0.0001395937],"category_scores_gemma":[0.0005651054,0.0002417758,0.000096293,0.002536157,0.0001329949,0.002229713,0.000353935,0.0003984001,0.000007668465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004574342,"about_ca_system_score_gemma":0.0006523264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000564047,"about_ca_topic_score_gemma":0.000002877318,"domain_scores_codex":[0.9960027,0.0004029568,0.0009508406,0.0004527295,0.001563759,0.0006269968],"domain_scores_gemma":[0.9962236,0.0003355058,0.0003701444,0.0004216572,0.002260257,0.000388872],"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.0001184625,0.0001523266,0.0004820714,0.0000154017,0.00007907621,0.00004850242,0.0002121949,0.9687564,0.000009066946,0.02451492,0.0002632015,0.005348428],"study_design_scores_gemma":[0.001158692,0.0004556973,0.0004860624,0.00005698383,0.00003199924,0.0002329694,0.0001215003,0.9965358,0.0001357055,0.0004399988,0.0001162137,0.0002284162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001243343,0.000423672,0.9842018,0.0005950191,0.0004288334,0.0003350979,0.00001233884,0.00006215821,0.01381675],"genre_scores_gemma":[0.05963765,0.0006130883,0.9392055,0.0001792776,0.0001937348,0.000002022733,0.000008224722,0.00002274761,0.0001377971],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05951332,"threshold_uncertainty_score":0.985933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154369526","doi":"10.1109/cec.2006.1688554","title":"Opposition-Based Differential Evolution Algorithms","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":184,"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":"Differential evolution; Initialization; Evolutionary algorithm; Computer science; Benchmark (surveying); Population; Evolutionary computation; Swarm intelligence; Mathematical optimization; Computational intelligence; Algorithm; Artificial intelligence; Cultural algorithm; Machine learning; Optimization problem; Particle swarm optimization; Meta-optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01136418331225883,"gpt":0.2479830212986889,"spread":0.23661883798643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001739747,0.0001102625,0.0001078198,0.0002063747,0.0001550594,0.00026271,0.0005533917,0.00005324689,0.0005183009],"category_scores_gemma":[0.00002856104,0.00009856068,0.00005801477,0.0005060736,0.00004527348,0.0002655547,0.0001021171,0.00009297468,0.0002275022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001450181,"about_ca_system_score_gemma":0.0001240142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002396642,"about_ca_topic_score_gemma":0.000007801797,"domain_scores_codex":[0.9984653,0.000102443,0.000226032,0.0003372123,0.0005835763,0.0002854237],"domain_scores_gemma":[0.9991675,0.00009551016,0.00004757429,0.0004369136,0.0001613401,0.00009114857],"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.00000536673,0.0004190388,0.0003508314,0.0000142856,0.00001297858,0.00002341906,0.0000104678,0.02011035,0.002776684,0.9561235,0.01137379,0.008779321],"study_design_scores_gemma":[0.0003844915,0.00003164344,0.002430307,0.000003148815,0.000002620023,0.000003561002,0.000001492638,0.9869175,0.001872412,0.007930364,0.0002964543,0.0001259879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001721131,0.00001439996,0.9885361,0.0009693196,0.0002965727,0.0001538475,0.000003356643,0.000300793,0.009553544],"genre_scores_gemma":[0.5212448,5.027218e-7,0.4762911,0.0000923644,0.0001580181,0.0000245642,0.00002972393,0.00000896819,0.002149967],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9668072,"threshold_uncertainty_score":0.5675031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138588773","doi":"10.1007/s10489-014-0613-2","title":"Measuring the curse of dimensionality and its effects on particle swarm optimization and differential evolution","year":2014,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":169,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Curse of dimensionality; Differential evolution; Computer science; Particle swarm optimization; Divergence (linguistics); Population; Mathematical optimization; Swarm behaviour; Algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02736205520661054,"gpt":0.2593924310048275,"spread":0.2320303757982169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627984,0.00009666267,0.0001237016,0.0000445849,0.0001401113,0.00006137567,0.0002736789,0.00003495415,0.000008475542],"category_scores_gemma":[0.0002977269,0.00007011492,0.00001495334,0.0002421428,0.00008895282,0.00009940513,0.0002149055,0.0001021435,0.00001008635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000174178,"about_ca_system_score_gemma":0.00001688653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006374893,"about_ca_topic_score_gemma":5.076174e-7,"domain_scores_codex":[0.9988088,0.0001396157,0.0001976355,0.0002950114,0.0003972757,0.0001616847],"domain_scores_gemma":[0.9988863,0.0005447482,0.0000809163,0.0002951533,0.0001155595,0.0000773045],"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.00002719506,0.00008347887,0.0001505612,0.00007292034,0.00001741926,4.400048e-7,0.000331934,0.1199611,0.005471298,0.8159259,0.00001019728,0.0579476],"study_design_scores_gemma":[0.00009288314,0.00005382604,0.001388286,0.00001648484,0.000005683741,0.000001431873,0.000006541733,0.870536,0.1246924,0.003130831,0.000008939035,0.00006677146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07992144,0.0000786347,0.919275,0.0001855715,0.00007940832,0.0002564141,4.789673e-7,0.00002904944,0.0001740261],"genre_scores_gemma":[0.9842278,0.00004529329,0.01560247,0.00005091472,0.00002615837,0.00002304121,7.615612e-7,0.000005375619,0.0000182246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9043064,"threshold_uncertainty_score":0.2859203,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083110812","doi":"10.1016/j.amc.2010.03.123","title":"A real-coded biogeography-based optimization with mutation","year":2010,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Benchmark (surveying); Mutation; Computer science; Operator (biology); Range (aeronautics); Domain (mathematical analysis); Global optimization; Mathematical optimization; Population; Optimization problem; Algorithm; Mathematics; Engineering; Biology; Genetics; Geography; Cartography","retraction":null,"screen_n_in":null,"score":{"opus":0.01263419133212613,"gpt":0.2575149655768707,"spread":0.2448807742447446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003407866,0.000146449,0.0001574895,0.0002586388,0.0001675613,0.0003185835,0.0002125754,0.00006704577,0.00001355974],"category_scores_gemma":[0.0000259163,0.0001245085,0.0000217646,0.0006492012,0.00007374247,0.0001691861,0.00005140216,0.0001353467,0.00000895994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009098971,"about_ca_system_score_gemma":0.00007123439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000101418,"about_ca_topic_score_gemma":0.000004518768,"domain_scores_codex":[0.9988255,0.00001484715,0.0002572958,0.0003216476,0.0004033041,0.0001773868],"domain_scores_gemma":[0.9990317,0.0001825624,0.0001744018,0.0002820283,0.0002280493,0.0001012696],"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.00001864507,0.0003108957,0.00003231792,0.0001504036,0.00003595399,0.000009274859,0.0009014579,0.5878915,0.003001519,0.3502463,0.00005136859,0.05735047],"study_design_scores_gemma":[0.000607595,0.00005873745,0.0001099279,0.00000934842,0.00001129529,0.00001262912,0.0000342296,0.988878,0.001023496,0.009086124,0.00001358487,0.0001550801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009463784,0.000002716179,0.9872351,0.0002131568,0.00005357089,0.0004219867,0.000001857161,0.0001922391,0.00241554],"genre_scores_gemma":[0.1580606,0.000006078122,0.8417581,0.0000441726,0.00001640013,0.00005619685,0.00003642645,0.00001487639,0.000007157098],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4009865,"threshold_uncertainty_score":0.507731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770783293","doi":"10.1007/s11721-017-0150-9","title":"Self-adaptive particle swarm optimization: a review and analysis of convergence","year":2017,"lang":"en","type":"review","venue":"Swarm Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Particle swarm optimization; Computer science; Flocking (texture); A priori and a posteriori; Mathematical optimization; Convergence (economics); Population; Swarm behaviour; Multi-swarm optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.15445702536842,"gpt":0.4157993763360676,"spread":0.2613423509676475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001464337,0.0004598319,0.002691234,0.0004984295,0.0001975627,0.0002111521,0.002924124,0.0001837612,0.0002528087],"category_scores_gemma":[0.0008931764,0.0003906155,0.0005114379,0.003255818,0.0002691702,0.0004298028,0.0009827929,0.0003672885,0.00009127768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008841361,"about_ca_system_score_gemma":0.0005963962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002093725,"about_ca_topic_score_gemma":0.000002101576,"domain_scores_codex":[0.9959381,0.0005057662,0.001349699,0.001045292,0.0007257497,0.0004354127],"domain_scores_gemma":[0.9949027,0.0005662243,0.001262806,0.002180884,0.0007985436,0.0002887941],"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.000001278901,0.0001016739,0.000002817251,0.01789543,0.001861065,0.000022932,0.0001497909,0.00379672,6.09063e-9,0.008076043,0.0001084863,0.9679838],"study_design_scores_gemma":[0.0000321453,0.00008145911,9.278714e-7,0.005150339,0.006099728,0.00002262007,0.000005580656,0.7867472,0.00001314268,0.00007979673,0.2012679,0.0004992271],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[6.707041e-9,0.515123,0.4838364,0.00004172948,0.00009493272,0.0005527697,0.00002379631,0.00004786055,0.0002795152],"genre_scores_gemma":[0.00000168705,0.7903688,0.2090561,0.00004882725,0.00001842994,0.0001052329,0.000020356,0.00001950338,0.000361079],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9674845,"threshold_uncertainty_score":0.9998546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3083389769","doi":"10.3390/app10186173","title":"A Spring Search Algorithm Applied to Engineering Optimization Problems","year":2020,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematical optimization; Spring (device); Algorithm; Mathematics; Engineering; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0391604103543382,"gpt":0.2599731436853561,"spread":0.2208127333310179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985397,0.0001904672,0.0002194087,0.0002883468,0.0003143697,0.0006847098,0.001910769,0.00005239448,0.00005959033],"category_scores_gemma":[0.000106357,0.0001808174,0.00003235638,0.003509925,0.00009214679,0.0003153839,0.0007637457,0.0002060323,0.0002663779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004456973,"about_ca_system_score_gemma":0.0001684381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001469217,"about_ca_topic_score_gemma":4.896768e-7,"domain_scores_codex":[0.996984,0.00002881623,0.000316499,0.000887351,0.00116844,0.0006148966],"domain_scores_gemma":[0.9989009,0.0001248383,0.00005302128,0.000344799,0.0001013006,0.0004751611],"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.00000136102,0.00001464228,0.000008346262,0.00001505662,0.000005340483,0.000002002588,0.0008069696,0.9442707,0.002005185,0.02023313,0.00008117649,0.03255614],"study_design_scores_gemma":[0.0001784365,0.00005653345,0.00003639495,0.000006376782,0.000001820962,0.00000154578,0.0000663167,0.9954077,0.003034151,0.00008896126,0.0008967734,0.0002249929],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002558691,0.00002502752,0.9909896,0.002388766,0.00009953538,0.0006649393,0.000001516359,0.0003658932,0.00520886],"genre_scores_gemma":[0.09643357,0.000007819434,0.9024951,0.0008138548,0.0001091861,0.00009963963,0.000001430933,0.00001552194,0.00002387389],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09617769,"threshold_uncertainty_score":0.7373518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056678525","doi":"10.1016/j.ins.2006.09.016","title":"Exchange strategies for multiple Ant Colony System","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ant colony optimization algorithms; Travelling salesman problem; Computer science; Weighting; Ant colony; Scheme (mathematics); Local search (optimization); Metaheuristic; Mathematical optimization; Artificial intelligence; Machine learning; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03510963660855574,"gpt":0.2952731545360752,"spread":0.2601635179275195,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001200568,0.0000812619,0.0001022515,0.0002813966,0.0004203639,0.00134868,0.0008257414,0.00003476409,0.00001261279],"category_scores_gemma":[0.0001404088,0.00006530309,0.00003327431,0.0007919882,0.0001262828,0.004674369,0.000104256,0.00003799005,0.0001020682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005165146,"about_ca_system_score_gemma":0.0002652442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001731801,"about_ca_topic_score_gemma":0.00001961615,"domain_scores_codex":[0.9985726,0.00003893269,0.0003520257,0.0001506136,0.0006143715,0.0002714963],"domain_scores_gemma":[0.9989898,0.0002458442,0.0001639905,0.0002016363,0.0003480836,0.00005062664],"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.000008179451,0.00003833132,0.0003529131,0.0002462121,0.00000638778,0.000001526168,0.001894802,0.06508563,0.00008398008,0.8795998,0.01780826,0.03487401],"study_design_scores_gemma":[0.0002517947,0.00005865357,0.0004240352,0.000009040162,9.093378e-7,0.000006572578,0.0007859551,0.9729049,0.0002143796,0.001005437,0.02424712,0.00009117593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009846078,0.00003049177,0.9768523,0.0003683557,0.0003758793,0.0004028135,0.00001510702,0.0001857368,0.02078474],"genre_scores_gemma":[0.6845203,0.000004272353,0.314813,0.0001477539,0.00008863077,0.000146707,0.0000160236,0.000002686509,0.0002606007],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9078193,"threshold_uncertainty_score":0.999688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W7021242","doi":"10.13140/2.1.1320.2568","title":"Swarm Intelligence: Concepts, Models and Applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06248270455043398,"gpt":0.3585503422520119,"spread":0.296067637701578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003361694,0.00006292169,0.00007157592,0.00006875973,0.00008622668,0.0001032607,0.0004009518,0.00002936143,0.0001115094],"category_scores_gemma":[0.00002681116,0.00005343441,0.00001352928,0.000323322,0.00006456001,0.0006194653,0.0002497843,0.00007218243,0.0001611198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000131177,"about_ca_system_score_gemma":0.00002926212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009710741,"about_ca_topic_score_gemma":3.126904e-7,"domain_scores_codex":[0.9991986,0.00003849152,0.0001327159,0.0001767548,0.000220644,0.0002327489],"domain_scores_gemma":[0.9992244,0.0001036149,0.00002402356,0.0003502945,0.00009647364,0.0002011564],"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":[2.290421e-7,0.00003152253,0.00006662827,0.00000377551,0.000003644989,1.298102e-7,0.0002273844,0.001569838,0.000004355574,0.8815244,0.0003430716,0.1162251],"study_design_scores_gemma":[0.00004064013,0.000008347277,0.00005814699,0.000001134196,0.000001571771,0.000008619902,0.0000496401,0.9675314,0.0007256574,0.01686411,0.01461894,0.00009172824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002039572,0.0003793963,0.9717944,0.0003028098,0.00005566165,0.000199721,8.173429e-7,0.0000997537,0.0271471],"genre_scores_gemma":[0.2221342,0.0002588211,0.773849,0.0002925561,0.0001060658,0.0001029592,0.000002102991,0.000006664075,0.003247601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9659616,"threshold_uncertainty_score":0.2178992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391145932","doi":"10.3390/biomimetics9020065","title":"Pufferfish Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Biomimetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":133,"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":"Benchmark (surveying); Metaheuristic; Algorithm; Test suite; Computer science; Evolutionary algorithm; Optimization algorithm; Optimization problem; Mathematical optimization; Artificial intelligence; Test case; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.0328331190701672,"gpt":0.2881612102099395,"spread":0.2553280911397723,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001152829,0.0005146086,0.0005356587,0.00102264,0.0003643825,0.002191273,0.001392887,0.000292099,0.0001818008],"category_scores_gemma":[0.0006541701,0.0005056293,0.0002607902,0.002923968,0.00011882,0.001075992,0.0004373273,0.0002854778,0.00009308519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002539365,"about_ca_system_score_gemma":0.000674017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004538914,"about_ca_topic_score_gemma":9.712397e-7,"domain_scores_codex":[0.9956383,0.0001631907,0.0009805803,0.001319691,0.0009981958,0.0009001094],"domain_scores_gemma":[0.9969286,0.0006038862,0.0002184062,0.0009970693,0.0007460833,0.0005059154],"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.000004197872,0.0001334139,0.000002080598,0.0001276501,0.0001809972,0.00002375054,0.0001954089,0.5535012,0.00009095391,0.002752106,0.006538935,0.4364493],"study_design_scores_gemma":[0.000839763,0.000249951,0.000002592112,0.0001087954,0.0001223638,0.00003605644,0.00001122422,0.9841058,0.0009220221,0.0009776832,0.0120532,0.0005705226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001702791,0.001692168,0.9907334,0.001471072,0.002986779,0.001678056,0.0001004194,0.001136072,0.0002003278],"genre_scores_gemma":[0.000159168,0.0004884747,0.9943622,0.0001462907,0.0005895608,0.0001913936,0.0002836456,0.0001252767,0.003653945],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4358788,"threshold_uncertainty_score":0.9997395,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073491843","doi":"10.1007/s11590-008-0089-2","title":"Mesh adaptive direct search algorithms for mixed variable optimization","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Variable (mathematics); Algorithm; Iterated function; Convergence (economics); Mathematics; Categorical variable; Mathematical optimization; Class (philosophy); Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04295862349070323,"gpt":0.27375931317915,"spread":0.2308006896884468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009378234,0.0003511006,0.0004192199,0.0005550673,0.0007636373,0.0003078737,0.001142434,0.0001533027,0.0002964882],"category_scores_gemma":[0.0004603338,0.0003688647,0.000136359,0.001901655,0.0001771741,0.001312945,0.0002729751,0.0002312876,0.00004229836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002081657,"about_ca_system_score_gemma":0.0003145038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003078246,"about_ca_topic_score_gemma":3.923437e-7,"domain_scores_codex":[0.9962648,0.0003762438,0.0006043286,0.0009888214,0.0009927396,0.000773062],"domain_scores_gemma":[0.9971781,0.0005180081,0.0002055929,0.0008711414,0.0009300998,0.0002970991],"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.00002764283,0.00009446137,0.00001934159,0.00001529855,0.00005818002,0.00001309492,0.0002375154,0.9854199,0.00007876186,0.002514956,0.01042361,0.001097296],"study_design_scores_gemma":[0.001162342,0.00011312,0.00001794212,0.00001610343,0.00001592556,0.00003387282,0.00001886136,0.9962445,0.0006609765,0.00002363076,0.001283788,0.0004089548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001965063,0.00005090545,0.9925301,0.002534506,0.0006793573,0.00116897,0.00004015586,0.0004330638,0.002543306],"genre_scores_gemma":[0.00109384,0.000163106,0.9951981,0.001236069,0.000205173,0.0002720343,0.0002043698,0.0000683692,0.001558914],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01082464,"threshold_uncertainty_score":0.9998763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2618467698","doi":"10.1007/s12293-017-0234-5","title":"A Hybrid grey wolf optimizer and genetic algorithm for minimizing potential energy function","year":2017,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":131,"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":"Premature convergence; Crossover; Maxima and minima; Algorithm; Population; Genetic algorithm; Population-based incremental learning; Mathematical optimization; Computer science; Benchmark (surveying); Curse of dimensionality; Operator (biology); Convergence (economics); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0210543000855937,"gpt":0.2711286795990178,"spread":0.2500743795134241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006524606,0.0002260772,0.0003106793,0.0002103714,0.001247659,0.001395599,0.001048929,0.00005860794,0.00002616743],"category_scores_gemma":[0.0004045486,0.0002303927,0.00009835983,0.0001083816,0.0001203704,0.0003265413,0.001009291,0.0001337434,0.000006932017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003738212,"about_ca_system_score_gemma":0.00008416894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005857294,"about_ca_topic_score_gemma":9.64243e-7,"domain_scores_codex":[0.9977155,0.000113742,0.0004172804,0.0007415206,0.0004623743,0.0005495694],"domain_scores_gemma":[0.9979776,0.0002283066,0.0003004275,0.0009317542,0.0003563284,0.0002056007],"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.000007681153,0.00003634301,0.0000456806,0.00002180281,0.00004732177,0.0000366393,0.00005898195,0.007186391,0.0001096644,0.000948386,0.0003333183,0.9911678],"study_design_scores_gemma":[0.001060453,0.0001106962,0.001804146,0.0000281552,0.00002965759,0.00009779578,0.000009280301,0.9937288,0.0003969828,0.001355781,0.001127055,0.0002512067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002616832,0.0002459193,0.9948416,0.0004705119,0.001142759,0.0002827577,0.000004039174,0.000121957,0.0002735932],"genre_scores_gemma":[0.1493994,0.00002771054,0.8496115,0.0001279111,0.000380402,0.00002147124,0.000005080642,0.00002591278,0.0004007198],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9909166,"threshold_uncertainty_score":0.9996411,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094252454","doi":"10.5267/j.ijiec.2012.09.001","title":"Comparative performance of an elitist teaching-learning-based optimization algorithm for solving unconstrained optimization problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Optimization algorithm; Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04034164815511341,"gpt":0.3085967055323746,"spread":0.2682550573772612,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001403957,0.000181095,0.0003289684,0.0007262061,0.0001348172,0.0001999186,0.0007832189,0.0001065148,0.00002430666],"category_scores_gemma":[0.0008226139,0.0001872926,0.0001146253,0.0003755343,0.00004791299,0.001468348,0.00006768893,0.0004603504,8.87216e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001811685,"about_ca_system_score_gemma":0.0003629175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008386523,"about_ca_topic_score_gemma":1.644804e-7,"domain_scores_codex":[0.9977511,0.0001344778,0.0009086219,0.000171623,0.0007641667,0.0002699769],"domain_scores_gemma":[0.9963758,0.0006228059,0.0007557392,0.0001399692,0.00190767,0.0001980445],"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.00001846227,0.0002013328,0.00007528658,0.00001010754,0.000107918,0.000001225416,0.0003671043,0.9812203,0.00004593147,0.0006246896,0.0000416644,0.01728598],"study_design_scores_gemma":[0.001715279,0.0003778127,0.00004605858,0.0001440143,0.00002250144,0.00004764174,0.00003665722,0.9965947,0.0006162465,0.000009766061,0.000224555,0.0001647226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002367377,0.00003358837,0.9953801,0.0002244772,0.001550305,0.0003171237,0.00002335042,0.00006234439,0.00004132235],"genre_scores_gemma":[0.3199472,0.000004441837,0.6794152,0.00001479815,0.0005014942,0.00001249222,0.00007792852,0.00001525772,0.00001113518],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3175799,"threshold_uncertainty_score":0.7637572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4254212488","doi":"10.1007/978-3-540-68830-3_6","title":"Opposition-Based Differential Evolution","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Ode; Initialization; Opposition (politics); Differential evolution; Suite; Test suite; Mathematical optimization; Benchmark (surveying); Population; Computer science; Algorithm; Mathematics; Applied mathematics; Test case; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.126897753637026,"gpt":0.3686390694557175,"spread":0.2417413158186915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000268476,0.0003946717,0.000499978,0.0007293806,0.0002626088,0.00008221509,0.001048054,0.0001838024,0.0001891677],"category_scores_gemma":[0.0002458347,0.0004097142,0.0001535245,0.0002664045,0.0005816121,0.0001880228,0.0004971478,0.0005306806,0.0003269767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009295362,"about_ca_system_score_gemma":0.0005122474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007438739,"about_ca_topic_score_gemma":0.000007383948,"domain_scores_codex":[0.9967087,0.00009298199,0.0007885009,0.0008171358,0.001255328,0.0003373776],"domain_scores_gemma":[0.9969315,0.001314751,0.0002743372,0.0004739177,0.0009016595,0.0001038182],"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.000007461296,0.00004828108,0.000005182058,0.00005658176,0.00008322006,0.00009943623,0.0001941379,0.4040122,3.207215e-7,0.5885158,0.002385276,0.00459206],"study_design_scores_gemma":[0.0001097025,0.00007018727,0.00002707787,0.0002219217,0.000008269545,0.00002373999,0.00001239899,0.7629595,0.00001031505,0.2351658,0.001046425,0.0003446881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001145069,0.001708505,0.9647123,0.0005117204,0.001026762,0.0003808567,0.00002525925,0.0001167669,0.0315167],"genre_scores_gemma":[0.1483319,0.00411195,0.7486807,0.0007663664,0.0009136054,0.0002505558,0.0004040737,0.0001677808,0.09637315],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3589472,"threshold_uncertainty_score":0.9998355,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083028490","doi":"10.1016/j.jpdc.2012.02.019","title":"Parallel differential evolution with self-adapting control parameters and generalized opposition-based learning for solving high-dimensional optimization problems","year":2012,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Differential evolution; Speedup; Benchmark (surveying); Computational complexity theory; Graphics; Parallel computing; Optimization problem; Execution time; Mathematical optimization; Algorithm; Mathematics; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.01425295086016035,"gpt":0.2382615037605564,"spread":0.2240085529003961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001055447,0.0002181044,0.0004054512,0.000192619,0.0005329457,0.000323982,0.0002045064,0.00008407801,0.00000422077],"category_scores_gemma":[0.0002101163,0.0001761071,0.00007539109,0.0002466751,0.00005541711,0.0005608697,0.00008604939,0.0002771474,2.898033e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009982735,"about_ca_system_score_gemma":0.0001328025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001657879,"about_ca_topic_score_gemma":4.038843e-7,"domain_scores_codex":[0.9978929,0.0002498245,0.0006196103,0.000261163,0.0004961432,0.0004804282],"domain_scores_gemma":[0.9976838,0.0005829965,0.0007311731,0.0001166808,0.0005811511,0.0003042438],"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.0001299544,0.0001127078,0.004130229,0.0000488793,0.00010744,0.000003744352,0.0001210392,0.9928495,0.0001742906,0.001430535,0.00002827584,0.0008633879],"study_design_scores_gemma":[0.00523739,0.0003581402,0.003560167,0.0001089468,0.00008210996,0.0001102346,0.00002743469,0.9901486,0.00002381222,0.0001178629,0.00001278797,0.0002124827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07909353,0.0003287618,0.9196832,0.0003494626,0.0001488729,0.0003326107,0.000006438941,0.00005525143,0.000001865591],"genre_scores_gemma":[0.5307455,0.000007219791,0.4690961,0.00002628719,0.00008473521,0.000005247166,0.00002435985,0.000008731256,0.00000183404],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.451652,"threshold_uncertainty_score":0.7181441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148600622","doi":"10.1109/cec.2006.1688534","title":"Opposition-Based Differential Evolution for Optimization of Noisy Problems","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","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 Waterloo","funders":"Russian Science Foundation","keywords":"Initialization; Differential evolution; Computer science; Benchmark (surveying); Mathematical optimization; Population; Optimization problem; Convergence (economics); Optimization algorithm; Algorithm; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01455068373189594,"gpt":0.2494523002541933,"spread":0.2349016165222974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002070117,0.0000893147,0.0001272504,0.0002037268,0.00009114113,0.00008863597,0.0003537899,0.00005275177,0.0001224528],"category_scores_gemma":[0.00005655306,0.00008168054,0.00006276488,0.0004016859,0.0000393888,0.0002244769,0.00004808151,0.0000387031,0.000004728118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000815444,"about_ca_system_score_gemma":0.0001211535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006205995,"about_ca_topic_score_gemma":0.00000698375,"domain_scores_codex":[0.9988118,0.00005996855,0.0003154936,0.0002532639,0.0003687746,0.0001907373],"domain_scores_gemma":[0.9990026,0.0001354404,0.0001148729,0.0002937481,0.0004075103,0.00004587854],"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.000005034768,0.0001339946,0.00007310171,0.00003405125,0.00000432926,1.900163e-7,0.000005013214,0.8787881,0.001004406,0.1191419,0.0005782188,0.0002316025],"study_design_scores_gemma":[0.0006453817,0.00008272696,0.0002359407,0.000009436025,0.000005444553,7.888861e-7,0.000001381453,0.9919851,0.003443477,0.003470201,0.00003059755,0.000089529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009081008,0.00001091168,0.9974772,0.0004127588,0.0001407806,0.0005441651,0.00001045281,0.0001021091,0.001210786],"genre_scores_gemma":[0.3274089,7.511683e-7,0.6719715,0.00001650333,0.00004561359,0.00006834088,0.00007024367,0.00000774865,0.0004104108],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3273181,"threshold_uncertainty_score":0.3330836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153654605","doi":"10.1016/j.dam.2005.05.020","title":"First vs. best improvement: An empirical study","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Constructive; Travelling salesman problem; Mathematics; Enhanced Data Rates for GSM Evolution; Heuristic; Mathematical optimization; Greedy algorithm; Algorithm; Combinatorics; Computer science; Artificial intelligence; Process (computing)","retraction":null,"screen_n_in":null,"score":{"opus":0.03618088057861051,"gpt":0.3343979954373477,"spread":0.2982171148587372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006813986,0.000246118,0.0003246772,0.0001494773,0.0002489267,0.0004128653,0.001465636,0.00006793712,0.0001800786],"category_scores_gemma":[0.0000765583,0.0002089003,0.00005263067,0.0005102863,0.00006143314,0.0003624162,0.0005710637,0.0002143824,0.0006452433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006974202,"about_ca_system_score_gemma":0.00006384421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000534381,"about_ca_topic_score_gemma":0.00001862968,"domain_scores_codex":[0.9974986,0.00003062134,0.0005434904,0.0005633071,0.0009067857,0.0004572047],"domain_scores_gemma":[0.9979301,0.0001485367,0.0001452964,0.001388454,0.0001107453,0.0002768342],"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.0001024078,0.03185799,0.001208462,0.0009188799,0.0006595884,0.0001336869,0.09435702,0.03014091,0.001532132,0.5644032,0.009560479,0.2651253],"study_design_scores_gemma":[0.0009570917,0.0004543014,0.0001368467,0.00001022641,0.00002702352,0.000005921549,0.001023476,0.9891595,0.0005341466,0.004185752,0.003125763,0.0003799304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01301046,0.00001001645,0.9744422,0.0008484209,0.00006647698,0.001101124,0.000005423323,0.0002357707,0.01028004],"genre_scores_gemma":[0.229787,0.000009672231,0.7689384,0.000277033,0.000146147,0.0002011966,0.000008458524,0.00003820704,0.0005938893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9590186,"threshold_uncertainty_score":0.8518705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165687335","doi":"10.1109/tevc.2009.2017517","title":"Bi-Objective Multipopulation Genetic Algorithm for Multimodal Function Optimization","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; Local optimum; Mathematical optimization; Genetic algorithm; Population; Artificial intelligence; Algorithm; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01815384982913662,"gpt":0.2780752823084465,"spread":0.2599214324793099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003007636,0.0003173267,0.0002601577,0.0008012868,0.0007529976,0.0001739395,0.0003589837,0.0001899801,0.00003671249],"category_scores_gemma":[0.00003469536,0.0003565601,0.0001862452,0.001201451,0.00005487545,0.001117292,0.000003616757,0.0002541374,0.00005599011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004205288,"about_ca_system_score_gemma":0.0001846765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002294,"about_ca_topic_score_gemma":0.00000176159,"domain_scores_codex":[0.9971387,0.0002475391,0.0006133942,0.0008247101,0.0007453168,0.0004303324],"domain_scores_gemma":[0.997973,0.0003250108,0.0002277981,0.0003996492,0.000897592,0.0001769416],"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.00004465249,0.0002784164,0.000001634261,0.000005406472,0.00002390328,9.969774e-7,0.00007381372,0.6607782,0.0000779425,0.0001697357,0.0001303944,0.3384148],"study_design_scores_gemma":[0.001612531,0.000823964,0.00364171,0.00002079795,0.00003415993,0.00001791721,0.00001900193,0.9901311,0.0003938779,0.002899856,0.00005640693,0.0003486522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001562995,0.0000482723,0.9957219,0.0004834584,0.001326234,0.001572251,0.0000507296,0.000553821,0.00008706431],"genre_scores_gemma":[0.2481944,0.00002031711,0.7509962,0.0001872723,0.0001295019,0.0001711999,0.0001004161,0.00002391786,0.000176786],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3380662,"threshold_uncertainty_score":0.9998887,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392190020","doi":"10.1016/j.swevo.2024.101517","title":"Reinforcement learning-assisted evolutionary algorithm: A survey and research opportunities","year":2024,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Shaanxi Key Science and Technology Innovation Team Project","keywords":"Reinforcement learning; Computer science; Evolutionary algorithm; Evolutionary computation; Artificial intelligence; Machine learning; Adaptation (eye); Optimization problem; Population; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1356344590218789,"gpt":0.362117218612814,"spread":0.2264827595909351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430051,0.0001823216,0.0001840852,0.0008019613,0.0007272944,0.0005344496,0.0002597941,0.0000996508,0.00003521458],"category_scores_gemma":[0.0002696262,0.0001816341,0.00003593833,0.001127564,0.0003108041,0.0008677996,0.0005128406,0.0004559121,0.00005586422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001797223,"about_ca_system_score_gemma":0.0004787597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002043124,"about_ca_topic_score_gemma":0.000003204774,"domain_scores_codex":[0.9965698,0.000948859,0.0003852727,0.0006419938,0.00102392,0.0004302278],"domain_scores_gemma":[0.9976955,0.001071428,0.00005104974,0.0002023012,0.0007397842,0.0002399156],"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.0000579821,0.000187122,0.001149016,0.000407745,0.0001978341,0.00025631,0.002101711,0.09141544,0.00005037306,0.05370191,0.04835261,0.8021219],"study_design_scores_gemma":[0.0002342059,0.0002072753,0.03368208,0.00005401674,0.000005062065,0.0001443076,0.0001350834,0.9518425,0.000004166211,0.006884662,0.006618505,0.0001881325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00253333,0.005082201,0.988184,0.001699115,0.0004344,0.0003509753,0.00001499572,0.0003400567,0.001360886],"genre_scores_gemma":[0.7835637,0.003130733,0.2039353,0.00009087531,0.0002441153,0.000104385,0.0006118117,0.00004106995,0.008278029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8604271,"threshold_uncertainty_score":0.7406824,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387873795","doi":"10.3390/biomimetics8060507","title":"Lyrebird Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Biomimetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Metaheuristic; Algorithm; Benchmark (surveying); Computer science; Mathematical optimization; Test suite; Optimization problem; Suite; Mathematics; Test case; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.04427160285548675,"gpt":0.2948410349910398,"spread":0.250569432135553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001388583,0.0004946839,0.0005801333,0.001251728,0.0005187574,0.0009246651,0.001609812,0.0002861785,0.0001095134],"category_scores_gemma":[0.001092793,0.0005069245,0.0002347688,0.00468684,0.0001209999,0.0007584966,0.0006117552,0.0002149943,0.0002102267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001852504,"about_ca_system_score_gemma":0.0004889849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005269493,"about_ca_topic_score_gemma":0.000001364686,"domain_scores_codex":[0.9954159,0.0001812579,0.001014203,0.001189121,0.001107026,0.001092495],"domain_scores_gemma":[0.9963588,0.0005998244,0.0004101125,0.001162827,0.0009241058,0.0005442955],"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.000004578083,0.0001074276,0.00000631448,0.00004463487,0.00009897233,0.00001222448,0.0001699377,0.7736415,0.0001001823,0.0008825531,0.006661922,0.2182698],"study_design_scores_gemma":[0.001546088,0.0002261395,0.000012926,0.00004239598,0.00007318555,0.00001500013,0.00002189439,0.9904584,0.0008607406,0.0007854574,0.005387867,0.0005699502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004280112,0.0002190717,0.9932562,0.001270656,0.001798906,0.001773255,0.00008433464,0.001449126,0.0001441717],"genre_scores_gemma":[0.00008226845,0.0004317899,0.9937754,0.0001461133,0.0004039558,0.0002143457,0.0004403884,0.0001219057,0.004383884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2176998,"threshold_uncertainty_score":0.9997382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2802761309","doi":"10.1016/j.aci.2018.04.001","title":"Hybrid binary bat enhanced particle swarm optimization algorithm for solving feature selection problems","year":2018,"lang":"en","type":"article","venue":"Applied Computing and Informatics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"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; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Particle swarm optimization; Computer science; Multi-swarm optimization; Feature (linguistics); Algorithm; Feature selection; Binary number; Set (abstract data type); Binary search algorithm; Metaheuristic; Swarm behaviour; Hybrid algorithm (constraint satisfaction); Bat algorithm; Mathematical optimization; Meta-optimization; Selection (genetic algorithm); Feature vector; Search algorithm; Artificial intelligence; Mathematics; Constraint satisfaction","retraction":null,"screen_n_in":null,"score":{"opus":0.01267380492240101,"gpt":0.2571261389554496,"spread":0.2444523340330486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006614107,0.0001759618,0.0002005836,0.0001223623,0.0006076604,0.0004573191,0.0003537698,0.00007075724,0.000005941356],"category_scores_gemma":[0.00007232583,0.000168183,0.00003178576,0.0004752256,0.00008115121,0.0004685552,0.000271482,0.0001629086,0.00001701055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004597126,"about_ca_system_score_gemma":0.00007242023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002184688,"about_ca_topic_score_gemma":2.208504e-7,"domain_scores_codex":[0.9985552,0.0000217504,0.0004382227,0.0002399007,0.0003124043,0.0004324759],"domain_scores_gemma":[0.9988234,0.0001658586,0.0002294125,0.0002605249,0.0003906735,0.0001300989],"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.000007991357,0.000052873,0.00000612719,0.0001110365,0.00003342851,2.461582e-7,0.002925378,0.2547369,0.0003615187,0.003012696,0.001453012,0.7372988],"study_design_scores_gemma":[0.0006031686,0.0001842875,0.00001027491,0.00002692949,0.000008094838,0.00001341398,0.00009211701,0.9826541,0.01513849,0.0004422048,0.0006259219,0.000201021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004935625,0.00002108971,0.9928997,0.000114487,0.0002113015,0.0005932339,0.000002552932,0.0002753441,0.0009466706],"genre_scores_gemma":[0.141343,0.00002087095,0.8580903,0.0002211507,0.0001720011,0.00002894047,0.00002008028,0.00001424976,0.00008935548],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7370977,"threshold_uncertainty_score":0.6858306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2474290527","doi":"10.1007/s12351-016-0251-z","title":"A new monarch butterfly optimization with an improved crossover operator","year":2016,"lang":"en","type":"article","venue":"Operational Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Crossover; Operator (biology); Benchmark (surveying); Butterfly; Computer science; Swarm intelligence; Mathematical optimization; Metaheuristic; Artificial intelligence; Particle swarm optimization; Mathematics; Algorithm; Ecology","retraction":null,"screen_n_in":null,"score":{"opus":0.05427543962770417,"gpt":0.3647605437736715,"spread":0.3104851041459673,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002058914,0.000204108,0.0001908328,0.0004471616,0.0006515151,0.001555629,0.001643525,0.0001075526,0.002040472],"category_scores_gemma":[0.0007893534,0.0001273474,0.00003420062,0.001346315,0.0002047843,0.002616789,0.0004968002,0.0003265322,0.0003740407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002337431,"about_ca_system_score_gemma":0.002532411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001924647,"about_ca_topic_score_gemma":0.00002992476,"domain_scores_codex":[0.9949691,0.0005916848,0.0003484118,0.0009370201,0.002376771,0.0007770035],"domain_scores_gemma":[0.9952164,0.0005048003,0.00004276118,0.001038683,0.002546715,0.0006506484],"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.001902934,0.001422689,0.002938925,0.00006333987,0.0002747599,0.0002470026,0.001880705,0.1754087,0.06338347,0.4037506,0.04381086,0.3049161],"study_design_scores_gemma":[0.002172478,0.0008660108,0.0006433123,0.00003176892,0.000002014564,0.0000350733,0.00001925134,0.984464,0.005284364,0.0007093667,0.00546055,0.0003117491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001579365,0.00003345874,0.9853568,0.01006421,0.00008636494,0.0006409304,0.00001644404,0.00009810857,0.002124302],"genre_scores_gemma":[0.06589469,0.00005408517,0.9022592,0.0003263495,0.0003740815,0.0001782643,0.00003140737,0.0000475353,0.0308344],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8090554,"threshold_uncertainty_score":0.9994808,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2969862035","doi":"10.1007/s13042-019-00996-5","title":"Feature selection based on rough set approach, wrapper approach, and binary whale optimization algorithm","year":2019,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"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":"Feature selection; Computer science; Feature (linguistics); Heuristic; Algorithm; Artificial intelligence; Computational intelligence; Selection (genetic algorithm); Rough set; Optimization problem; Set (abstract data type); Wilcoxon signed-rank test; Pattern recognition (psychology); Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.009192440010017096,"gpt":0.2599653760498017,"spread":0.2507729360397846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006780263,0.0001679555,0.0002123528,0.0003973643,0.00008808465,0.0003602243,0.0004276297,0.0001022747,0.00003752808],"category_scores_gemma":[0.000150705,0.0001430804,0.00005853622,0.0002586115,0.00004466198,0.0003201879,0.0001366533,0.0006894901,0.00000420857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005573259,"about_ca_system_score_gemma":0.0000737831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000934738,"about_ca_topic_score_gemma":1.323299e-7,"domain_scores_codex":[0.9981276,0.0002628604,0.000269816,0.0002943996,0.0008764092,0.0001689063],"domain_scores_gemma":[0.9987695,0.0001664057,0.0003113917,0.0001156957,0.0005128729,0.000124196],"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.00005104101,0.0001329909,0.003659531,0.00001583726,0.00006641273,0.00001151757,0.0002250368,0.9590326,0.00002706101,0.000571029,0.000271642,0.03593532],"study_design_scores_gemma":[0.001082087,0.000400442,0.0007730709,0.00003818613,0.00001204705,0.0002844745,0.00004065651,0.9935056,0.00003076108,0.0000417243,0.003650212,0.0001407404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003015569,0.000344154,0.9927694,0.001465094,0.0003126979,0.0001272964,0.000005138266,0.00003404072,0.001926637],"genre_scores_gemma":[0.1549985,0.0004833621,0.8417479,0.0002493671,0.0002108271,0.000003215159,0.00004564248,0.00002505063,0.002236153],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1519829,"threshold_uncertainty_score":0.5834651,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2548265241","doi":"10.1007/s11721-016-0128-z","title":"Inertia weight control strategies for particle swarm optimization","year":2016,"lang":"en","type":"article","venue":"Swarm Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inertia; Benchmark (surveying); Particle swarm optimization; Computer science; Control (management); Mathematical optimization; Selection (genetic algorithm); Convergence (economics); Population; Control theory (sociology); Mathematics; Artificial intelligence; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.02980599871837959,"gpt":0.2991908573740253,"spread":0.2693848586556458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006384197,0.0001871246,0.0002099038,0.0001143159,0.0001576938,0.0003039805,0.001114104,0.00007557598,0.0001973723],"category_scores_gemma":[0.0006086777,0.0001296865,0.00008159115,0.0005175586,0.0001346508,0.0009966244,0.0001352731,0.00008040188,0.0002163882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006667697,"about_ca_system_score_gemma":0.0002397409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001156788,"about_ca_topic_score_gemma":0.000003153355,"domain_scores_codex":[0.9979151,0.0001202492,0.0004534723,0.0005465637,0.0004399806,0.0005246469],"domain_scores_gemma":[0.9977747,0.0006575778,0.0001261655,0.0006635418,0.0005816934,0.0001963516],"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.00007303786,0.0001749022,0.000142131,0.00003702185,0.00006004918,0.00001033303,0.0004237418,0.4174295,0.001721004,0.439963,0.001295212,0.1386701],"study_design_scores_gemma":[0.0003922009,0.0001424436,0.00001909617,0.00002322144,0.000007888436,0.000005421958,0.00003922154,0.9402742,0.04504602,0.01162288,0.0022115,0.0002158611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002178114,0.0001388186,0.9941186,0.003716235,0.0004342866,0.0005350597,0.00001386613,0.0002240748,0.0006012761],"genre_scores_gemma":[0.6445909,0.0001426393,0.3534232,0.0002983624,0.0001304528,0.0001872327,0.000002812926,0.00002237073,0.001202015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6443731,"threshold_uncertainty_score":0.5288461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4318323524","doi":"10.1016/j.ins.2023.01.103","title":"PSO-ELPM: PSO with elite learning, enhanced parameter updating, and exponential mutation operator","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Particle swarm optimization; Mathematical optimization; Benchmark (surveying); Operator (biology); Exponential function; Mutation; Population; Mathematics; Wilcoxon signed-rank test; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02021766652312251,"gpt":0.2964951871606678,"spread":0.2762775206375453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001363457,0.0001147778,0.0001185629,0.0004847329,0.0005389483,0.001502879,0.0005297685,0.00003999721,0.0000733334],"category_scores_gemma":[0.0006747872,0.00008758064,0.00001823542,0.001987891,0.0002262344,0.004957234,0.000160915,0.000129399,0.0004067623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001847841,"about_ca_system_score_gemma":0.0001588779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002537121,"about_ca_topic_score_gemma":0.000002845668,"domain_scores_codex":[0.9979907,0.0001154523,0.0003569262,0.000257361,0.000971085,0.0003085179],"domain_scores_gemma":[0.9989954,0.0002045055,0.0001902364,0.0001944068,0.0003011955,0.0001142574],"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.00003721246,0.00004722313,0.001991974,0.0001106935,0.00004586869,0.00001528516,0.03116927,0.1866919,0.001206739,0.02794806,0.002599444,0.7481363],"study_design_scores_gemma":[0.0003482823,0.0001582114,0.002241767,0.0000198189,0.000002235662,0.00001400881,0.001076397,0.9897795,0.002480386,0.0002160645,0.003500351,0.0001629972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164369,0.0000114664,0.8765875,0.0006500786,0.0001934304,0.0002609938,0.000002491658,0.0002948437,0.005562269],"genre_scores_gemma":[0.8830028,0.00008224045,0.1159756,0.0003724507,0.00003646499,0.00006456579,0.0000314161,0.000005495726,0.0004289579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8030875,"threshold_uncertainty_score":0.9995337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1835894572","doi":"10.1109/ccece.2002.1013043","title":"Enhancing the particle swarm optimizer via proper parameters selection","year":2003,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Particle swarm optimization; Range (aeronautics); Mathematical optimization; Selection (genetic algorithm); Swarm intelligence; Computer science; Swarm behaviour; Multi-swarm optimization; Process (computing); Metaheuristic; Algorithm; Mathematics; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02582213623270858,"gpt":0.2681246103243953,"spread":0.2423024740916868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132203,0.0001068826,0.0001046137,0.00003672369,0.0002494474,0.0003067308,0.0004859494,0.00003533514,0.0003137958],"category_scores_gemma":[0.0004124177,0.00006488612,0.00004419752,0.0007961054,0.0000541674,0.0003655626,0.00008851515,0.0001558703,0.0003270822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004584807,"about_ca_system_score_gemma":0.00009994079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003249187,"about_ca_topic_score_gemma":0.000007918131,"domain_scores_codex":[0.9982819,0.0003499083,0.0002430198,0.0003290371,0.0004303117,0.0003658076],"domain_scores_gemma":[0.9990237,0.0001877296,0.00004716676,0.0004496547,0.0001808088,0.0001108785],"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.00004222948,0.0008969784,0.00176762,0.00005701972,0.0002872022,0.00003632702,0.003891235,0.5299599,0.03405006,0.3187978,0.008673845,0.1015398],"study_design_scores_gemma":[0.0001953567,0.000043088,0.00005491573,0.000002211616,0.000003835894,0.0000242318,0.00002888471,0.8009429,0.1963174,0.0005436531,0.001734867,0.0001086652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004337983,0.00002697906,0.9891264,0.0009854585,0.0001952598,0.0003011387,8.821186e-8,0.0001462385,0.004880389],"genre_scores_gemma":[0.3198309,0.00000940457,0.6744447,0.0005184526,0.00001714867,0.00005697033,2.651934e-7,0.00001073701,0.005111423],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3182542,"threshold_uncertainty_score":0.4204089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2304131403","doi":"10.1007/s00500-016-2116-z","title":"Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"Science Foundation of Ministry of Education of China; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Firefly algorithm; Benchmark (surveying); Swarm intelligence; Convergence (economics); Premature convergence; Computer science; Mathematical optimization; Set (abstract data type); Mechanism (biology); Optimization problem; Algorithm; Particle swarm optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01366166025855101,"gpt":0.261132166591145,"spread":0.247470506332594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009064523,0.0002659193,0.0003423589,0.0002210077,0.0002662818,0.0002741489,0.0007042571,0.00008628694,0.00004395437],"category_scores_gemma":[0.0002120764,0.0001706667,0.00005265009,0.0005262303,0.000117216,0.0003866778,0.0005965613,0.0002387014,0.00005745806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009954532,"about_ca_system_score_gemma":0.0001588864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001972703,"about_ca_topic_score_gemma":0.000002049455,"domain_scores_codex":[0.9970574,0.0002844636,0.0003736203,0.0007850912,0.0008108781,0.0006885416],"domain_scores_gemma":[0.997532,0.001147781,0.0001063452,0.0006165153,0.0003142116,0.00028313],"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.00002661827,0.00008282075,0.0001682607,0.0000235438,0.00008116886,0.00005395758,0.0003682094,0.0003605948,0.0004398255,0.003479761,0.00003055136,0.9948847],"study_design_scores_gemma":[0.002959068,0.0002285072,0.00236548,0.00009657008,0.0000117724,0.00009632597,0.00002130395,0.9918769,0.0004574069,0.001543149,0.00005694795,0.0002865852],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007844065,0.000145607,0.9897575,0.001148697,0.0002226935,0.0004708576,0.000006352987,0.0002825002,0.0001217289],"genre_scores_gemma":[0.4648448,0.0000434841,0.5344332,0.0001576374,0.00006944889,0.0000127857,0.000003444746,0.00002956173,0.0004055677],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9945981,"threshold_uncertainty_score":0.6959586,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134788587","doi":"10.1109/sis.2007.368044","title":"Applying Opposition-Based Ideas to the Ant Colony System","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":96,"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":"Travelling salesman problem; Ant colony optimization algorithms; Synchronizing; Opposition (politics); Computer science; ANT; Ant colony; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.02070064834814609,"gpt":0.293804749325385,"spread":0.2731041009772389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00194942,0.00008765011,0.0001020835,0.0001581103,0.0002598566,0.000271951,0.0009936591,0.000031591,0.00005169637],"category_scores_gemma":[0.000129841,0.00005805114,0.00003598418,0.0009018469,0.00002164603,0.00009961245,0.000181471,0.00009578661,0.0004831194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000115771,"about_ca_system_score_gemma":0.0001198679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006501273,"about_ca_topic_score_gemma":0.00001732035,"domain_scores_codex":[0.9984154,0.0001002907,0.0002436088,0.0002819872,0.0006294331,0.0003293534],"domain_scores_gemma":[0.9984673,0.0004381706,0.00004266525,0.0006171562,0.0002324431,0.0002022258],"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.00004306383,0.0002021911,0.0004262766,0.0001301997,0.00005606477,0.0002690786,0.0006263779,0.1132437,0.001758549,0.7031664,0.03111141,0.1489666],"study_design_scores_gemma":[0.0001673549,0.00004262056,0.0002694153,0.00001632924,0.000002268938,0.00001285914,0.00007659655,0.9850324,0.002322004,0.00003919013,0.01191872,0.0001002185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001653345,0.00001808992,0.9834878,0.002408269,0.0002795828,0.0007982892,0.000001489663,0.0002150924,0.01262599],"genre_scores_gemma":[0.457427,5.938449e-7,0.5386928,0.002292581,0.0001104324,0.0001771335,0.000002440356,0.00001033521,0.00128664],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8717887,"threshold_uncertainty_score":0.6209683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1551741615","doi":"10.1007/3-540-45724-0_28","title":"Using Genetic Algorithms to Optimize ACS-TSP","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":96,"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":"Computer science; Genetic algorithm; Ant colony optimization algorithms; Algorithm; Variable (mathematics); Ant colony; Travelling salesman problem; Population-based incremental learning; Mathematical optimization; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05726925925110299,"gpt":0.3053369914652968,"spread":0.2480677322141938,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001089497,0.0007501487,0.0007921592,0.002067519,0.0003926782,0.00132896,0.006095765,0.0003916018,0.0002534532],"category_scores_gemma":[0.0003509947,0.0007342926,0.000155036,0.001899466,0.0005887554,0.0005554302,0.003184816,0.001023775,0.000330989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006251274,"about_ca_system_score_gemma":0.0007089811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003251556,"about_ca_topic_score_gemma":0.000005039055,"domain_scores_codex":[0.992814,0.00009378877,0.0008614174,0.002512254,0.002450468,0.001268054],"domain_scores_gemma":[0.9953706,0.0005105637,0.0002873224,0.002516937,0.0006790526,0.0006355555],"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.000002123715,0.00002419983,0.000005070081,0.00001700116,0.00001038757,0.000177605,0.0002565917,0.6024654,0.00003426409,0.001193032,0.00004381068,0.3957705],"study_design_scores_gemma":[0.0002666559,0.000139031,0.00003092728,0.0001889508,0.000008901411,0.000165139,6.853014e-8,0.9865824,0.0004007855,0.01015829,0.001262566,0.0007962626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001002598,0.0003783614,0.992761,0.0007252121,0.001931441,0.0008117711,0.000009273664,0.0002000143,0.003172932],"genre_scores_gemma":[0.0006934068,0.00008289424,0.9954931,0.001337408,0.0005962008,0.00001422477,0.000002510455,0.00007084752,0.001709401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3949743,"threshold_uncertainty_score":0.9997078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}