{"meta":{"query_hash":"d43e957fbe73","filters":{"venue":"Memetic Computing"},"cohort_total":13,"direct_labels_cover":0,"predictions_cover":13,"exported":13,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d43e957fbe73","api":"https://metacan.xera.ac/api/v1/cohort?venue=Memetic+Computing"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02228156810671539,"score_gpt":0.24519089203241773,"score_spread":0.22290932392570234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005144156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045481912,0.00013197388,0.9922481,0.00006629641,0.0011060426,0.00036467475,0.0000034564314,0.0008172663,0.0048073283],"genre_scores_gemma":[0.17681248,0.000002667458,0.8226802,0.00018937438,0.00011577958,0.000023078559,0.0000043063687,0.000025081506,0.0001470259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977852,0.00017511034,0.00039452597,0.0007702656,0.00039173602,0.00048312277],"domain_scores_gemma":[0.998296,0.0002752505,0.0002292949,0.0005757575,0.00046915383,0.00015451579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003408817,0.0002791375,0.0002657098,0.00032722385,0.0004528721,0.00006280506,0.00065015885,0.000082106046,0.00006957176],"category_scores_gemma":[0.00023171052,0.00029473854,0.00012737227,0.0011370383,0.000108538996,0.000416747,0.00030999992,0.0002521263,0.00009337353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014398662,0.00060125766,0.0012057024,0.000019412122,0.00007998939,0.00006279615,0.0038622147,0.047975007,0.00021649136,0.0026633483,0.00014489242,0.9431545],"study_design_scores_gemma":[0.00077534444,0.00009049932,0.016133169,0.000034026187,0.000010347191,0.000029641247,0.00008540515,0.9794652,0.0016986616,0.0009120843,0.000418893,0.0003467674],"about_ca_topic_score_codex":0.00012323793,"about_ca_topic_score_gemma":0.0000041362437,"teacher_disagreement_score":0.94280773,"about_ca_system_score_codex":0.00027782883,"about_ca_system_score_gemma":0.00015355516,"threshold_uncertainty_score":0.99995047},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.037039615462445975,"score_gpt":0.3038008521982924,"score_spread":0.2667612367358464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015050454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04638638,0.0011333501,0.9500015,0.00006019884,0.0013841223,0.00032685333,0.000010578415,0.00056282233,0.00013424632],"genre_scores_gemma":[0.48563373,0.0000019000103,0.51373786,0.00005651399,0.0004779872,0.000009651853,0.0000069981156,0.00006875915,0.000006571368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751914,0.00008546632,0.0005494871,0.00034206154,0.00040847747,0.0010953627],"domain_scores_gemma":[0.9981496,0.0008944182,0.000041741132,0.0003149152,0.00024598982,0.00035333392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011584205,0.00033488433,0.00040793567,0.00026860303,0.00035218077,0.00013343622,0.00023702977,0.00014856365,0.00007453279],"category_scores_gemma":[0.0004845026,0.00037021248,0.00016565171,0.0005735042,0.000119562894,0.00012295664,0.00007589169,0.00036100714,0.0000323725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003952202,0.000060917468,0.00018227608,0.00024718052,0.000038355527,0.0000042003608,0.00031791942,0.9174406,0.0003030056,0.00017838183,0.000011584968,0.08121163],"study_design_scores_gemma":[0.000687932,0.00004130033,0.00007402569,0.00020939052,0.0001016512,0.000024234689,0.00037774417,0.99641585,0.0015201473,0.000035174053,0.000081965496,0.00043056702],"about_ca_topic_score_codex":0.000014025964,"about_ca_topic_score_gemma":4.3961072e-7,"teacher_disagreement_score":0.43924737,"about_ca_system_score_codex":0.00019844345,"about_ca_system_score_gemma":0.00007447339,"threshold_uncertainty_score":0.999875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.029943360986871843,"score_gpt":0.2619239946884852,"score_spread":0.23198063370161337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033338535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028514215,0.000025296664,0.98972934,0.0019982802,0.0005064386,0.0006144099,0.0000023622479,0.0002682971,0.0040041786],"genre_scores_gemma":[0.29554915,0.00001509921,0.70351005,0.00041736139,0.00022951672,0.000026615697,0.000009711995,0.00003234633,0.0002101148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669164,0.000537212,0.00045752645,0.000676404,0.0010120126,0.0006252137],"domain_scores_gemma":[0.9976512,0.00096895103,0.00017780779,0.0006966199,0.00035387097,0.0001515405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024717224,0.00028875127,0.00032532465,0.00024193316,0.0008080111,0.00069607905,0.0012992925,0.00007402534,0.00018744932],"category_scores_gemma":[0.00048207268,0.00020976183,0.00009308145,0.00087198825,0.00013129176,0.00023486662,0.0008166111,0.00038698633,0.00007450139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000857243,0.00014132519,0.00022130189,0.000054287095,0.000058328802,0.000013897121,0.0012343467,0.79484886,0.00010590677,0.033302456,0.00024687906,0.16976385],"study_design_scores_gemma":[0.0004512727,0.00016314234,0.00036038496,0.00009656049,0.000009330065,0.000027583104,0.00007160979,0.9959341,0.00087865227,0.0003019517,0.0014426138,0.00026277965],"about_ca_topic_score_codex":0.00004398868,"about_ca_topic_score_gemma":0.0000025358693,"teacher_disagreement_score":0.29269776,"about_ca_system_score_codex":0.000110263536,"about_ca_system_score_gemma":0.000114977665,"threshold_uncertainty_score":0.85538393},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025472997722234998,"score_gpt":0.25568643560058646,"score_spread":0.23021343787835147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046858085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028031527,0.00004457054,0.99083436,0.001787414,0.00021235911,0.0008964298,5.1476246e-7,0.0001317948,0.0032894113],"genre_scores_gemma":[0.35476452,0.0000022953757,0.6448243,0.000198131,0.000100842844,0.000040908977,0.0000031085415,0.000016641477,0.00004922989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961907,0.0008361288,0.0007858461,0.0006899959,0.00089785986,0.0005994412],"domain_scores_gemma":[0.997889,0.000601085,0.00022982294,0.00087752764,0.00020463773,0.0001979464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042939004,0.00022920278,0.0003045425,0.00020313535,0.00038633813,0.00060583756,0.0012655419,0.000053089247,0.000010472081],"category_scores_gemma":[0.00037784787,0.00018327117,0.000048709,0.0020169166,0.00006310354,0.00015375832,0.0007589503,0.00030475983,0.000045469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002751042,0.00013712062,0.00022773174,0.000023848255,0.000006071296,0.0000025252916,0.001668836,0.928384,0.000039120583,0.05089838,0.00015353046,0.01845608],"study_design_scores_gemma":[0.00043450104,0.00007823852,0.00029112148,0.000042315263,0.000003275864,0.000009421089,0.00016164084,0.99638295,0.00012603053,0.0011412351,0.0011112429,0.00021801204],"about_ca_topic_score_codex":0.00001892478,"about_ca_topic_score_gemma":0.0000037448299,"teacher_disagreement_score":0.35196137,"about_ca_system_score_codex":0.00016279065,"about_ca_system_score_gemma":0.000083474704,"threshold_uncertainty_score":0.74735814},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005347936411961424,"score_gpt":0.21118837151574188,"score_spread":0.20584043510378044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083638310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060198274,0.00018526612,0.93862957,0.000036343965,0.00004713035,0.00004977285,0.0000016544034,0.00018933037,0.0006626807],"genre_scores_gemma":[0.8834662,0.000019019972,0.11643067,0.000020629059,0.000022076887,2.9289725e-7,0.0000067951,0.000008707589,0.000025617695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995535,0.0000092002265,0.0001234861,0.00011661505,0.00006881513,0.00012839375],"domain_scores_gemma":[0.9998098,0.000029445122,0.000016022006,0.000084123145,0.000023507722,0.00003707416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009951662,0.00008000893,0.00011366758,0.000048006576,0.000057464866,0.000037235917,0.00005124283,0.000040478022,0.0000048255274],"category_scores_gemma":[0.00003505337,0.00008331757,0.000024954214,0.00014621015,0.0000128692745,0.000016416245,0.000022247941,0.00010225403,0.0000021578041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.4331566e-7,0.000037229165,0.00042227667,0.000012696013,0.000020267491,0.0000022610645,0.00010142564,0.97430074,0.0032997183,0.00005933518,0.00018387812,0.021559304],"study_design_scores_gemma":[0.00014617175,0.00001725967,0.0031919677,0.00001125437,0.000023551236,0.000003817338,0.000013162839,0.996279,0.00010916514,0.000026973577,0.00008290191,0.00009479316],"about_ca_topic_score_codex":0.00000783202,"about_ca_topic_score_gemma":0.000002576048,"teacher_disagreement_score":0.82326794,"about_ca_system_score_codex":0.000025683612,"about_ca_system_score_gemma":0.0000021933197,"threshold_uncertainty_score":0.3397592},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015249681418932038,"score_gpt":0.22866214264811854,"score_spread":0.2134124612291865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510633763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20591684,0.000022182277,0.7911637,0.0009358874,0.00023664493,0.00027323494,2.321821e-7,0.00041389244,0.0010374365],"genre_scores_gemma":[0.78495586,5.5192015e-7,0.21415605,0.00022674457,0.00012405963,0.000007822142,4.267511e-7,0.000013538409,0.00051493174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978931,0.00003937654,0.00044455886,0.0006666713,0.00043523603,0.0005210887],"domain_scores_gemma":[0.9987641,0.00011695172,0.00018629893,0.00071626453,0.00008645081,0.00012991921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007714958,0.00021397995,0.00019847619,0.00014253492,0.00028703717,0.00011245585,0.0011228414,0.00004637816,0.0000027316746],"category_scores_gemma":[0.000046976744,0.00015054079,0.0000745243,0.00034042163,0.000038022827,0.000026926558,0.0011854933,0.00009129813,0.00009616013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005735722,0.0002366667,0.00045704332,0.00004117331,0.000043168802,0.000004068423,0.0021384584,0.027348245,0.009527213,0.016761597,0.00031529582,0.9431213],"study_design_scores_gemma":[0.00063062896,0.000024082423,0.00063071604,0.000120620454,0.0000060986017,0.0000067110877,0.000016539194,0.98919064,0.0027526226,0.0006012491,0.005747588,0.00027249788],"about_ca_topic_score_codex":0.000006449918,"about_ca_topic_score_gemma":0.0000017124681,"teacher_disagreement_score":0.9618424,"about_ca_system_score_codex":0.00016514104,"about_ca_system_score_gemma":0.000088931796,"threshold_uncertainty_score":0.6138875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011936310361194432,"score_gpt":0.2627367152526489,"score_spread":0.2508004048914545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607258061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10936867,0.000078458324,0.8868826,0.000059892598,0.00019327778,0.0008066435,0.000013530772,0.00057317433,0.0020237232],"genre_scores_gemma":[0.4993078,0.0000016717039,0.5003344,0.000021543961,0.00019700585,0.000013859681,0.000050963787,0.00004798188,0.000024749364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827665,0.00008626353,0.000526936,0.00027672583,0.00029156182,0.00054184475],"domain_scores_gemma":[0.99866414,0.00014429515,0.00037127986,0.0005184084,0.0002049134,0.00009694428],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012612619,0.00029484922,0.00034436348,0.00015062565,0.001122538,0.0003765653,0.0003945299,0.0001509812,0.00000792232],"category_scores_gemma":[0.00017876801,0.00029718445,0.000080036516,0.0001752281,0.00007301495,0.0007596182,0.00008081906,0.0002853224,0.0000122964575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024159564,0.000017327095,0.0019615404,0.00029652534,0.000057672423,0.0000010442133,0.001127329,0.95502454,0.0011594595,0.00012997,0.00005970149,0.040140737],"study_design_scores_gemma":[0.00090766273,0.00003523532,0.005567836,0.00021080174,0.000047484253,0.000041311898,0.00016059603,0.9920062,0.00015872087,0.000047530033,0.0004447691,0.00037184998],"about_ca_topic_score_codex":0.000012686085,"about_ca_topic_score_gemma":9.765882e-7,"teacher_disagreement_score":0.38993916,"about_ca_system_score_codex":0.00025408898,"about_ca_system_score_gemma":0.00007389876,"threshold_uncertainty_score":0.999948},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0210543000855937,"score_gpt":0.2711286795990178,"score_spread":0.2500743795134241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618467698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026168318,0.0002459193,0.99484164,0.0004705119,0.001142759,0.00028275774,0.0000040391737,0.000121957,0.0002735932],"genre_scores_gemma":[0.14939936,0.00002771054,0.84961146,0.00012791106,0.000380402,0.000021471242,0.000005080642,0.00002591278,0.00040071984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771553,0.00011374195,0.0004172804,0.0007415206,0.00046237433,0.00054956943],"domain_scores_gemma":[0.99797755,0.00022830657,0.0003004275,0.0009317542,0.00035632835,0.0002056007],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006524606,0.00022607725,0.00031067932,0.00021037144,0.0012476592,0.0013955985,0.0010489288,0.00005860794,0.000026167434],"category_scores_gemma":[0.0004045486,0.00023039275,0.00009835983,0.00010838161,0.00012037037,0.0003265413,0.0010092908,0.00013374336,0.000006932017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007681153,0.000036343008,0.000045680605,0.000021802814,0.000047321773,0.0000366393,0.00005898195,0.007186391,0.00010966437,0.00094838603,0.0003333183,0.9911678],"study_design_scores_gemma":[0.0010604528,0.00011069618,0.0018041461,0.000028155202,0.000029657593,0.00009779578,0.000009280301,0.9937288,0.00039698282,0.0013557812,0.0011270548,0.00025120671],"about_ca_topic_score_codex":0.000058572936,"about_ca_topic_score_gemma":9.64243e-7,"teacher_disagreement_score":0.9909166,"about_ca_system_score_codex":0.000037382124,"about_ca_system_score_gemma":0.00008416894,"threshold_uncertainty_score":0.99964106},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012046640714551271,"score_gpt":0.25060554894108106,"score_spread":0.23855890822652978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922377918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068590306,0.00009099681,0.92941517,0.0000825212,0.0002138524,0.00036108604,2.042666e-7,0.00017099104,0.0010748844],"genre_scores_gemma":[0.4575178,0.0000104848,0.5421874,0.00008258213,0.00003835731,0.0000034164418,8.4742067e-7,0.00001087719,0.00014826316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986704,0.00006068533,0.0002226483,0.00052875024,0.00023541275,0.00028210084],"domain_scores_gemma":[0.99943054,0.00008997593,0.00013176544,0.0002460503,0.00004672805,0.000054954056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029204378,0.00015493769,0.00016654939,0.00016344803,0.0001481267,0.00010903286,0.0002061617,0.000044299737,0.000020776855],"category_scores_gemma":[0.00002808178,0.00015800857,0.00003332649,0.0003808542,0.000022291619,0.00026000803,0.00024519092,0.00015299802,0.000046265814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046443256,0.00006484722,0.0032113374,0.000028692179,0.00003710111,0.0000045258735,0.00076148583,0.8960419,0.0052838423,0.008309464,0.000008300891,0.08624384],"study_design_scores_gemma":[0.0004499425,0.00006429641,0.0024759609,0.000024028353,0.0000053375625,0.000035107547,0.00009968165,0.9946404,0.0008744139,0.0008829633,0.0002491528,0.0001986948],"about_ca_topic_score_codex":0.00001266523,"about_ca_topic_score_gemma":5.575787e-7,"teacher_disagreement_score":0.3889275,"about_ca_system_score_codex":0.00011011327,"about_ca_system_score_gemma":0.000046466073,"threshold_uncertainty_score":0.6443403},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.055240046627404386,"score_gpt":0.26657739797066426,"score_spread":0.21133735134325987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164558703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1088384,0.0015930744,0.88734794,0.00006668246,0.00038764827,0.0007620377,0.000014420497,0.0006626624,0.00032710828],"genre_scores_gemma":[0.498831,0.000022348964,0.50069356,0.000076568496,0.00013539764,0.000050297305,0.00010919618,0.000074555675,0.0000070616566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975818,0.00024006734,0.00075606245,0.0005602805,0.00036651065,0.0004953176],"domain_scores_gemma":[0.99703455,0.0010406664,0.00013965729,0.0008233086,0.00083777134,0.00012407276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010174182,0.00038292614,0.0004732242,0.00025377408,0.00026983424,0.0002206388,0.00037841525,0.00028238064,0.000020194795],"category_scores_gemma":[0.00035509997,0.00041316324,0.00014609504,0.0010523476,0.000032446893,0.00019992239,0.00007781757,0.0007404876,0.000015627891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001489644,0.000054546585,0.00013819794,0.0000907274,0.000066008244,0.000002171799,0.0008183652,0.8186286,0.0018632499,0.00030929362,0.0000011020028,0.17801282],"study_design_scores_gemma":[0.00052575517,0.00013529959,0.00016653995,0.00086900475,0.00004171552,0.0000038222556,0.0012386258,0.9883555,0.006698425,0.001305841,0.00023389688,0.000425542],"about_ca_topic_score_codex":0.00004358368,"about_ca_topic_score_gemma":0.000046066245,"teacher_disagreement_score":0.3899926,"about_ca_system_score_codex":0.00020639328,"about_ca_system_score_gemma":0.000119245364,"threshold_uncertainty_score":0.99983203},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08347497233303464,"score_gpt":0.3928723355189769,"score_spread":0.30939736318594224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388757355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02986721,0.00001483151,0.9683912,0.00090924796,0.00021569226,0.00027008183,7.592126e-7,0.00012959455,0.0002013951],"genre_scores_gemma":[0.52485245,6.2426545e-7,0.47493097,0.00015749542,0.00003181979,0.000008622789,0.0000029825349,0.00000842449,0.0000066287985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982087,0.0006553259,0.0003107258,0.00033287506,0.00021362513,0.0002787386],"domain_scores_gemma":[0.99616927,0.0030944303,0.00014402445,0.00046463608,0.000097578326,0.0000300536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063960683,0.00011563855,0.00020890345,0.00023437425,0.0001445137,0.00008638271,0.0005655923,0.000041445935,0.0000051228058],"category_scores_gemma":[0.0006228682,0.000089650355,0.00006067602,0.0012194373,0.000018306457,0.0000921452,0.00008839836,0.00011966356,0.0000022766794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057993047,0.00003194919,0.0025606041,0.000029786015,0.0000047723966,0.0000016675336,0.0006452897,0.9351616,0.0009908732,0.0023713992,0.00002896583,0.05816731],"study_design_scores_gemma":[0.0002970145,0.00008956761,0.009777631,0.00006919905,0.0000031403652,5.98753e-7,0.00005147007,0.98318714,0.0055268565,0.0008362704,0.000059720413,0.00010138408],"about_ca_topic_score_codex":0.000030362336,"about_ca_topic_score_gemma":0.0000058732344,"teacher_disagreement_score":0.49498522,"about_ca_system_score_codex":0.000019485195,"about_ca_system_score_gemma":0.000049207007,"threshold_uncertainty_score":0.36558354},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008627332995099194,"score_gpt":0.22438542896562447,"score_spread":0.21575809597052528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400467634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.935178,0.0014730991,0.059934657,0.000062358784,0.00061380095,0.00014779234,0.0000054459692,0.0013375328,0.001247351],"genre_scores_gemma":[0.9938631,0.000033529,0.0058630477,0.000031707998,0.00011469534,0.000002619022,0.0000053110793,0.00005161132,0.000034353194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988553,0.000026378224,0.00027066126,0.0003443373,0.00012968451,0.0003736689],"domain_scores_gemma":[0.9996215,0.00012254705,0.000028566645,0.00015189916,0.000014551359,0.000060927883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020517976,0.00024259403,0.00024351067,0.00017120659,0.00021277893,0.00009055324,0.00014729728,0.00015794451,0.000015771455],"category_scores_gemma":[0.0000157651,0.0002517622,0.0000547557,0.00027341128,0.00010069647,0.00013844458,0.00010424059,0.00048235868,0.000008769032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044623255,0.00008537501,0.021863062,0.0018911952,0.0008358439,0.00048618767,0.009123191,0.37560293,0.16067539,0.0075876866,0.00067511766,0.42112938],"study_design_scores_gemma":[0.00017652831,0.000038913884,0.0014324936,0.00025369966,0.00003649909,0.000038581522,0.00020062778,0.97912765,0.017612914,0.00017353245,0.000601702,0.00030688877],"about_ca_topic_score_codex":0.0000154642,"about_ca_topic_score_gemma":0.0000032189955,"teacher_disagreement_score":0.6035247,"about_ca_system_score_codex":0.000119394186,"about_ca_system_score_gemma":0.000024390063,"threshold_uncertainty_score":0.99999344},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006466877492983044,"score_gpt":0.2581186958881561,"score_spread":0.2516518183951731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401644259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9736855,0.00793488,0.0019318315,0.00041158963,0.0001800549,0.000043643384,0.00000284226,0.00014500707,0.015664646],"genre_scores_gemma":[0.99721706,0.00019748551,0.0002538639,0.000025646297,0.00023718069,0.000006546988,0.0000015147798,0.000024705141,0.0020359682],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872553,0.00004669608,0.00035121644,0.0002970149,0.00025387492,0.00032568423],"domain_scores_gemma":[0.9988934,0.000553745,0.000118595526,0.00036433426,0.00003907242,0.000030856812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037876706,0.00017960982,0.00023302568,0.00013731854,0.00022848407,0.00021355259,0.00040516228,0.00007682718,0.00054076174],"category_scores_gemma":[0.0001317959,0.00009681163,0.00012834455,0.0016125542,0.00012671364,0.00005581258,0.0001244198,0.00047699045,0.000019699168],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051658586,0.00010474285,0.0066561266,0.0007177657,0.0003333828,0.000016792006,0.004439035,0.002191167,0.8462226,0.0003630763,0.00039562132,0.13850805],"study_design_scores_gemma":[0.00015741798,0.000014447946,0.0003331605,0.00015798966,0.0001221838,0.000012889445,0.002928013,0.097269356,0.87038714,0.00091342157,0.027549114,0.00015486297],"about_ca_topic_score_codex":0.00042422127,"about_ca_topic_score_gemma":0.0001173665,"teacher_disagreement_score":0.13835318,"about_ca_system_score_codex":0.000089009016,"about_ca_system_score_gemma":0.00005128775,"threshold_uncertainty_score":0.5920962},"labels":[],"label_agreement":null}]}