{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":13,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":13,"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":"d43e957fbe73","filters":{"venue":"Memetic Computing"}},"results":[{"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":"W2922377918","doi":"10.1007/s12293-019-00282-5","title":"Project portfolio selection and scheduling under a fuzzy environment","year":2019,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Project portfolio management; Mathematical optimization; Portfolio; Flexibility (engineering); Pareto principle; Fuzzy logic; Scheduling (production processes); Evolutionary algorithm; Operations research; Project management; Machine learning; Artificial intelligence; Mathematics; Engineering; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01204664071455127,"gpt":0.2506055489410811,"spread":0.2385589082265298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002920438,0.0001549377,0.0001665494,0.000163448,0.0001481267,0.0001090329,0.0002061617,0.00004429974,0.00002077686],"category_scores_gemma":[0.00002808178,0.0001580086,0.00003332649,0.0003808542,0.00002229162,0.000260008,0.0002451909,0.000152998,0.00004626581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101133,"about_ca_system_score_gemma":0.00004646607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001266523,"about_ca_topic_score_gemma":5.575787e-7,"domain_scores_codex":[0.9986704,0.00006068533,0.0002226483,0.0005287502,0.0002354128,0.0002821008],"domain_scores_gemma":[0.9994305,0.00008997593,0.0001317654,0.0002460503,0.00004672805,0.00005495406],"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.000004644326,0.00006484722,0.003211337,0.00002869218,0.00003710111,0.000004525873,0.0007614858,0.8960419,0.005283842,0.008309464,0.000008300891,0.08624384],"study_design_scores_gemma":[0.0004499425,0.00006429641,0.002475961,0.00002402835,0.000005337562,0.00003510755,0.00009968165,0.9946404,0.0008744139,0.0008829633,0.0002491528,0.0001986948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06859031,0.00009099681,0.9294152,0.0000825212,0.0002138524,0.000361086,2.042666e-7,0.000170991,0.001074884],"genre_scores_gemma":[0.4575178,0.0000104848,0.5421874,0.00008258213,0.00003835731,0.000003416442,8.474207e-7,0.00001087719,0.0001482632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3889275,"threshold_uncertainty_score":0.6443403,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3164558703","doi":"10.1007/s12293-021-00333-w","title":"Integrated scheduling problem for earth observation satellites based on three modeling frameworks: an adaptive bi-objective memetic algorithm","year":2021,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"China Scholarship Council","keywords":"Memetic algorithm; Complex system; Computer science; Scheduling (production processes); Complex adaptive system; Mathematical optimization; Algorithm; Artificial intelligence; Evolutionary algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05524004662740439,"gpt":0.2665773979706643,"spread":0.2113373513432599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001017418,0.0003829261,0.0004732242,0.0002537741,0.0002698342,0.0002206388,0.0003784153,0.0002823806,0.0000201948],"category_scores_gemma":[0.0003551,0.0004131632,0.000146095,0.001052348,0.00003244689,0.0001999224,0.00007781757,0.0007404876,0.00001562789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002063933,"about_ca_system_score_gemma":0.0001192454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004358368,"about_ca_topic_score_gemma":0.00004606624,"domain_scores_codex":[0.9975818,0.0002400673,0.0007560625,0.0005602805,0.0003665106,0.0004953176],"domain_scores_gemma":[0.9970345,0.001040666,0.0001396573,0.0008233086,0.0008377713,0.0001240728],"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.00001489644,0.00005454658,0.0001381979,0.0000907274,0.00006600824,0.000002171799,0.0008183652,0.8186286,0.00186325,0.0003092936,0.000001102003,0.1780128],"study_design_scores_gemma":[0.0005257552,0.0001352996,0.0001665399,0.0008690048,0.00004171552,0.000003822256,0.001238626,0.9883555,0.006698425,0.001305841,0.0002338969,0.000425542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1088384,0.001593074,0.8873479,0.00006668246,0.0003876483,0.0007620377,0.0000144205,0.0006626624,0.0003271083],"genre_scores_gemma":[0.498831,0.00002234896,0.5006936,0.0000765685,0.0001353976,0.00005029731,0.0001091962,0.00007455568,0.000007061657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3899926,"threshold_uncertainty_score":0.999832,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005144156","doi":"10.1007/s12293-011-0072-9","title":"DMEA: a direction-based multiobjective evolutionary algorithm","year":2011,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Population; Benchmark (surveying); Computer science; Evolutionary algorithm; Multi-objective optimization; Ideal (ethics); Selection (genetic algorithm); Mathematical optimization; Pareto principle; Convergence (economics); Point (geometry); Algorithm; Current (fluid); Artificial intelligence; Mathematics; Machine learning; Geography; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.02228156810671539,"gpt":0.2451908920324177,"spread":0.2229093239257023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003408817,0.0002791375,0.0002657098,0.0003272239,0.0004528721,0.00006280506,0.0006501589,0.00008210605,0.00006957176],"category_scores_gemma":[0.0002317105,0.0002947385,0.0001273723,0.001137038,0.000108539,0.000416747,0.0003099999,0.0002521263,0.00009337353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002778288,"about_ca_system_score_gemma":0.0001535552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001232379,"about_ca_topic_score_gemma":0.000004136244,"domain_scores_codex":[0.9977852,0.0001751103,0.000394526,0.0007702656,0.000391736,0.0004831228],"domain_scores_gemma":[0.998296,0.0002752505,0.0002292949,0.0005757575,0.0004691538,0.0001545158],"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.00001439866,0.0006012577,0.001205702,0.00001941212,0.00007998939,0.00006279615,0.003862215,0.04797501,0.0002164914,0.002663348,0.0001448924,0.9431545],"study_design_scores_gemma":[0.0007753444,0.00009049932,0.01613317,0.00003402619,0.00001034719,0.00002964125,0.00008540515,0.9794652,0.001698662,0.0009120843,0.000418893,0.0003467674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004548191,0.0001319739,0.9922481,0.00006629641,0.001106043,0.0003646748,0.000003456431,0.0008172663,0.004807328],"genre_scores_gemma":[0.1768125,0.000002667458,0.8226802,0.0001893744,0.0001157796,0.00002307856,0.000004306369,0.00002508151,0.0001470259],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9428077,"threshold_uncertainty_score":0.9999505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015050454","doi":"10.1007/s12293-012-0084-0","title":"A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic","year":2012,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Memetic algorithm; Computer science; Mathematical optimization; Fitness function; Job shop scheduling; Local search (optimization); Tabu search; Critical path method; Tournament selection; Flow shop scheduling; Generality; Evolutionary algorithm; Schedule; Algorithm; Crossover; Genetic algorithm; Artificial intelligence; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03703961546244598,"gpt":0.3038008521982924,"spread":0.2667612367358464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00115842,0.0003348843,0.0004079357,0.000268603,0.0003521808,0.0001334362,0.0002370298,0.0001485636,0.00007453279],"category_scores_gemma":[0.0004845026,0.0003702125,0.0001656517,0.0005735042,0.0001195629,0.0001229566,0.00007589169,0.0003610071,0.0000323725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001984434,"about_ca_system_score_gemma":0.00007447339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001402596,"about_ca_topic_score_gemma":4.396107e-7,"domain_scores_codex":[0.9975191,0.00008546632,0.0005494871,0.0003420615,0.0004084775,0.001095363],"domain_scores_gemma":[0.9981496,0.0008944182,0.00004174113,0.0003149152,0.0002459898,0.0003533339],"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.000003952202,0.00006091747,0.0001822761,0.0002471805,0.00003835553,0.000004200361,0.0003179194,0.9174406,0.0003030056,0.0001783818,0.00001158497,0.08121163],"study_design_scores_gemma":[0.000687932,0.00004130033,0.00007402569,0.0002093905,0.0001016512,0.00002423469,0.0003777442,0.9964159,0.001520147,0.00003517405,0.0000819655,0.000430567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04638638,0.00113335,0.9500015,0.00006019884,0.001384122,0.0003268533,0.00001057841,0.0005628223,0.0001342463],"genre_scores_gemma":[0.4856337,0.00000190001,0.5137379,0.00005651399,0.0004779872,0.000009651853,0.000006998116,0.00006875915,0.000006571368],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4392474,"threshold_uncertainty_score":0.999875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2046858085","doi":"10.1007/s12293-014-0141-y","title":"Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem","year":2014,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Heuristics; Particle swarm optimization; Complex system; Domain (mathematical analysis); Quadratic equation; Mathematical optimization; Computer science; Multi-swarm optimization; Metaheuristic; Quadratic assignment problem; Algorithm; Mathematics; Optimization problem; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.025472997722235,"gpt":0.2556864356005865,"spread":0.2302134378783515,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042939,0.0002292028,0.0003045425,0.0002031354,0.0003863381,0.0006058376,0.001265542,0.00005308925,0.00001047208],"category_scores_gemma":[0.0003778479,0.0001832712,0.000048709,0.002016917,0.00006310354,0.0001537583,0.0007589503,0.0003047598,0.000045469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001627906,"about_ca_system_score_gemma":0.0000834747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001892478,"about_ca_topic_score_gemma":0.00000374483,"domain_scores_codex":[0.9961907,0.0008361288,0.0007858461,0.0006899959,0.0008978599,0.0005994412],"domain_scores_gemma":[0.997889,0.000601085,0.0002298229,0.0008775276,0.0002046377,0.0001979464],"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.000002751042,0.0001371206,0.0002277317,0.00002384826,0.000006071296,0.000002525292,0.001668836,0.928384,0.00003912058,0.05089838,0.0001535305,0.01845608],"study_design_scores_gemma":[0.000434501,0.00007823852,0.0002911215,0.00004231526,0.000003275864,0.000009421089,0.0001616408,0.996383,0.0001260305,0.001141235,0.001111243,0.000218012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002803153,0.00004457054,0.9908344,0.001787414,0.0002123591,0.0008964298,5.147625e-7,0.0001317948,0.003289411],"genre_scores_gemma":[0.3547645,0.000002295376,0.6448243,0.000198131,0.0001008428,0.00004090898,0.000003108541,0.00001664148,0.00004922989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3519614,"threshold_uncertainty_score":0.7473581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2607258061","doi":"10.1007/s12293-017-0231-8","title":"A co-evolutionary approach using information about future requests for dynamic vehicle routing problem with soft time windows","year":2017,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"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":"Computer science; Vehicle routing problem; Heuristic; Routing (electronic design automation); Genetic algorithm; Evolutionary algorithm; Artificial intelligence; Machine learning; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01193631036119443,"gpt":0.2627367152526489,"spread":0.2508004048914545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001261262,0.0002948492,0.0003443635,0.0001506257,0.001122538,0.0003765653,0.0003945299,0.0001509812,0.00000792232],"category_scores_gemma":[0.000178768,0.0002971845,0.00008003652,0.0001752281,0.00007301495,0.0007596182,0.00008081906,0.0002853224,0.00001229646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000254089,"about_ca_system_score_gemma":0.00007389876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268609,"about_ca_topic_score_gemma":9.765882e-7,"domain_scores_codex":[0.9982767,0.00008626353,0.000526936,0.0002767258,0.0002915618,0.0005418448],"domain_scores_gemma":[0.9986641,0.0001442951,0.0003712799,0.0005184084,0.0002049134,0.00009694428],"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.00002415956,0.00001732709,0.00196154,0.0002965253,0.00005767242,0.000001044213,0.001127329,0.9550245,0.001159459,0.00012997,0.00005970149,0.04014074],"study_design_scores_gemma":[0.0009076627,0.00003523532,0.005567836,0.0002108017,0.00004748425,0.0000413119,0.000160596,0.9920062,0.0001587209,0.00004753003,0.0004447691,0.00037185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1093687,0.00007845832,0.8868826,0.0000598926,0.0001932778,0.0008066435,0.00001353077,0.0005731743,0.002023723],"genre_scores_gemma":[0.4993078,0.000001671704,0.5003344,0.00002154396,0.0001970059,0.00001385968,0.00005096379,0.00004798188,0.00002474936],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3899392,"threshold_uncertainty_score":0.999948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033338535","doi":"10.1007/s12293-013-0129-z","title":"A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem","year":2014,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"Missouri University of Science and Technology; University of Missouri; Intelligent Systems Center; National Science Foundation","keywords":"Ant colony optimization algorithms; Ant colony; Computer science; Algorithm; State (computer science); Complex system; ANT; Mathematical optimization; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02994336098687184,"gpt":0.2619239946884852,"spread":0.2319806337016134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002471722,0.0002887513,0.0003253247,0.0002419332,0.0008080111,0.000696079,0.001299293,0.00007402534,0.0001874493],"category_scores_gemma":[0.0004820727,0.0002097618,0.00009308145,0.0008719882,0.0001312918,0.0002348666,0.0008166111,0.0003869863,0.00007450139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001102635,"about_ca_system_score_gemma":0.0001149777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004398868,"about_ca_topic_score_gemma":0.000002535869,"domain_scores_codex":[0.9966916,0.000537212,0.0004575264,0.000676404,0.001012013,0.0006252137],"domain_scores_gemma":[0.9976512,0.000968951,0.0001778078,0.0006966199,0.000353871,0.0001515405],"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.00000857243,0.0001413252,0.0002213019,0.00005428709,0.0000583288,0.00001389712,0.001234347,0.7948489,0.0001059068,0.03330246,0.0002468791,0.1697638],"study_design_scores_gemma":[0.0004512727,0.0001631423,0.000360385,0.00009656049,0.000009330065,0.0000275831,0.00007160979,0.9959341,0.0008786523,0.0003019517,0.001442614,0.0002627796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002851421,0.00002529666,0.9897293,0.00199828,0.0005064386,0.0006144099,0.000002362248,0.0002682971,0.004004179],"genre_scores_gemma":[0.2955492,0.00001509921,0.70351,0.0004173614,0.0002295167,0.0000266157,0.000009711995,0.00003234633,0.0002101148],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2926978,"threshold_uncertainty_score":0.8553839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388757355","doi":"10.1007/s12293-023-00402-2","title":"An optimization method for pruning rates of each layer in CNN based on the GA-SMSM","year":2023,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Pruning; Complex system; Layer (electronics); Computer science; Artificial intelligence; Algorithm; Pattern recognition (psychology); Biological system; Materials science; Nanotechnology; Biology; Botany","retraction":null,"screen_n_in":null,"score":{"opus":0.08347497233303464,"gpt":0.3928723355189769,"spread":0.3093973631859422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006396068,0.0001156385,0.0002089035,0.0002343743,0.0001445137,0.00008638271,0.0005655923,0.00004144594,0.000005122806],"category_scores_gemma":[0.0006228682,0.00008965036,0.00006067602,0.001219437,0.00001830646,0.0000921452,0.00008839836,0.0001196636,0.000002276679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001948519,"about_ca_system_score_gemma":0.00004920701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003036234,"about_ca_topic_score_gemma":0.000005873234,"domain_scores_codex":[0.9982087,0.0006553259,0.0003107258,0.0003328751,0.0002136251,0.0002787386],"domain_scores_gemma":[0.9961693,0.00309443,0.0001440245,0.0004646361,0.00009757833,0.0000300536],"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.000005799305,0.00003194919,0.002560604,0.00002978602,0.000004772397,0.000001667534,0.0006452897,0.9351616,0.0009908732,0.002371399,0.00002896583,0.05816731],"study_design_scores_gemma":[0.0002970145,0.00008956761,0.009777631,0.00006919905,0.000003140365,5.98753e-7,0.00005147007,0.9831871,0.005526857,0.0008362704,0.00005972041,0.0001013841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02986721,0.00001483151,0.9683912,0.000909248,0.0002156923,0.0002700818,7.592126e-7,0.0001295946,0.0002013951],"genre_scores_gemma":[0.5248525,6.242655e-7,0.474931,0.0001574954,0.00003181979,0.000008622789,0.000002982535,0.00000842449,0.000006628798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4949852,"threshold_uncertainty_score":0.3655835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083638310","doi":"10.1007/s12293-009-0020-0","title":"Multi-objective optimization by technical laws and heuristics","year":2009,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Gear and Bearing Dynamics Analysis","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Optech (Canada)","funders":"","keywords":"Heuristics; Computer science; Conceptual design; Heuristic; Mathematical optimization; Industrial engineering; Reliability engineering; Artificial intelligence; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.005347936411961424,"gpt":0.2111883715157419,"spread":0.2058404351037804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009951662,0.00008000893,0.0001136676,0.00004800658,0.00005746487,0.00003723592,0.00005124283,0.00004047802,0.000004825527],"category_scores_gemma":[0.00003505337,0.00008331757,0.00002495421,0.0001462101,0.00001286927,0.00001641624,0.00002224794,0.000102254,0.000002157804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002568361,"about_ca_system_score_gemma":0.00000219332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000783202,"about_ca_topic_score_gemma":0.000002576048,"domain_scores_codex":[0.9995535,0.000009200226,0.0001234861,0.000116615,0.00006881513,0.0001283937],"domain_scores_gemma":[0.9998098,0.00002944512,0.00001602201,0.00008412314,0.00002350772,0.00003707416],"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":[8.433157e-7,0.00003722917,0.0004222767,0.00001269601,0.00002026749,0.000002261065,0.0001014256,0.9743007,0.003299718,0.00005933518,0.0001838781,0.0215593],"study_design_scores_gemma":[0.0001461717,0.00001725967,0.003191968,0.00001125437,0.00002355124,0.000003817338,0.00001316284,0.996279,0.0001091651,0.00002697358,0.00008290191,0.00009479316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06019827,0.0001852661,0.9386296,0.00003634396,0.00004713035,0.00004977285,0.000001654403,0.0001893304,0.0006626807],"genre_scores_gemma":[0.8834662,0.00001901997,0.1164307,0.00002062906,0.00002207689,2.928973e-7,0.0000067951,0.000008707589,0.0000256177],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8232679,"threshold_uncertainty_score":0.3397592,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2510633763","doi":"10.1007/s12293-016-0203-4","title":"A proposed novel enterprise cloud development application model","year":2016,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"","keywords":"Cloud computing; Computer science; Provisioning; Cloud testing; Service-oriented modeling; Software deployment; Software as a service; Software engineering; Cloud computing security; Software development; Software; Distributed computing; Systems engineering; Software architecture; Reference architecture; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01524968141893204,"gpt":0.2286621426481185,"spread":0.2134124612291865,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007714958,0.0002139799,0.0001984762,0.0001425349,0.0002870372,0.0001124558,0.001122841,0.00004637816,0.000002731675],"category_scores_gemma":[0.00004697674,0.0001505408,0.0000745243,0.0003404216,0.00003802283,0.00002692656,0.001185493,0.00009129813,0.00009616013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000165141,"about_ca_system_score_gemma":0.0000889318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006449918,"about_ca_topic_score_gemma":0.000001712468,"domain_scores_codex":[0.9978931,0.00003937654,0.0004445589,0.0006666713,0.000435236,0.0005210887],"domain_scores_gemma":[0.9987641,0.0001169517,0.0001862989,0.0007162645,0.00008645081,0.0001299192],"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.000005735722,0.0002366667,0.0004570433,0.00004117331,0.0000431688,0.000004068423,0.002138458,0.02734824,0.009527213,0.0167616,0.0003152958,0.9431213],"study_design_scores_gemma":[0.000630629,0.00002408242,0.000630716,0.0001206205,0.000006098602,0.000006711088,0.00001653919,0.9891906,0.002752623,0.0006012491,0.005747588,0.0002724979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2059168,0.00002218228,0.7911637,0.0009358874,0.0002366449,0.0002732349,2.321821e-7,0.0004138924,0.001037437],"genre_scores_gemma":[0.7849559,5.519202e-7,0.214156,0.0002267446,0.0001240596,0.000007822142,4.267511e-7,0.00001353841,0.0005149317],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9618424,"threshold_uncertainty_score":0.6138875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401644259","doi":"10.1007/s12293-024-00425-3","title":"Where does the crude oil originate? The role of near-infrared spectroscopy in accurate source detection","year":2024,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":4,"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":"Xuzhou Science and Technology Program; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Tracing; Rendering (computer graphics); Computer science; Outlier; Near-infrared spectroscopy; Crude oil; Artificial intelligence; Pattern recognition (psychology); Data mining; Petroleum engineering; Geology; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.006466877492983044,"gpt":0.2581186958881561,"spread":0.2516518183951731,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003787671,0.0001796098,0.0002330257,0.0001373185,0.0002284841,0.0002135526,0.0004051623,0.00007682718,0.0005407617],"category_scores_gemma":[0.0001317959,0.00009681163,0.0001283445,0.001612554,0.0001267136,0.00005581258,0.0001244198,0.0004769904,0.00001969917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008900902,"about_ca_system_score_gemma":0.00005128775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004242213,"about_ca_topic_score_gemma":0.0001173665,"domain_scores_codex":[0.9987255,0.00004669608,0.0003512164,0.0002970149,0.0002538749,0.0003256842],"domain_scores_gemma":[0.9988934,0.000553745,0.0001185955,0.0003643343,0.00003907242,0.00003085681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005165859,0.0001047429,0.006656127,0.0007177657,0.0003333828,0.00001679201,0.004439035,0.002191167,0.8462226,0.0003630763,0.0003956213,0.1385081],"study_design_scores_gemma":[0.000157418,0.00001444795,0.0003331605,0.0001579897,0.0001221838,0.00001288945,0.002928013,0.09726936,0.8703871,0.0009134216,0.02754911,0.000154863],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9736855,0.00793488,0.001931831,0.0004115896,0.0001800549,0.00004364338,0.00000284226,0.0001450071,0.01566465],"genre_scores_gemma":[0.9972171,0.0001974855,0.0002538639,0.0000256463,0.0002371807,0.000006546988,0.00000151478,0.00002470514,0.002035968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1383532,"threshold_uncertainty_score":0.5920962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400467634","doi":"10.1007/s12293-024-00416-4","title":"Driver profiling using trajectories on arbitrary roads by clustering roads and drivers successively","year":2024,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"BC Research (Canada)","funders":"Agency for Science, Technology and Research","keywords":"Profiling (computer programming); Cluster analysis; Computer science; Complex system; Data mining; Artificial intelligence; Transport engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.008627332995099194,"gpt":0.2243854289656245,"spread":0.2157580959705253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002051798,0.000242594,0.0002435107,0.0001712066,0.0002127789,0.00009055324,0.0001472973,0.0001579445,0.00001577145],"category_scores_gemma":[0.0000157651,0.0002517622,0.0000547557,0.0002734113,0.0001006965,0.0001384446,0.0001042406,0.0004823587,0.000008769032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001193942,"about_ca_system_score_gemma":0.00002439006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000154642,"about_ca_topic_score_gemma":0.000003218996,"domain_scores_codex":[0.9988553,0.00002637822,0.0002706613,0.0003443373,0.0001296845,0.0003736689],"domain_scores_gemma":[0.9996215,0.000122547,0.00002856664,0.0001518992,0.00001455136,0.00006092788],"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.00004462326,0.00008537501,0.02186306,0.001891195,0.0008358439,0.0004861877,0.009123191,0.3756029,0.1606754,0.007587687,0.0006751177,0.4211294],"study_design_scores_gemma":[0.0001765283,0.00003891388,0.001432494,0.0002536997,0.00003649909,0.00003858152,0.0002006278,0.9791276,0.01761291,0.0001735324,0.000601702,0.0003068888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.935178,0.001473099,0.05993466,0.00006235878,0.0006138009,0.0001477923,0.000005445969,0.001337533,0.001247351],"genre_scores_gemma":[0.9938631,0.000033529,0.005863048,0.000031708,0.0001146953,0.000002619022,0.000005311079,0.00005161132,0.00003435319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6035247,"threshold_uncertainty_score":0.9999934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}