{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":645,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":645,"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":"d1408aa5b2d4","filters":{"topic":"Advanced Multi-Objective Optimization Algorithms"}},"results":[{"id":"W2097998348","doi":"","title":"Random search for hyper-parameter optimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":7937,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Hyperparameter optimization; Random search; Computer science; Grid; Set (abstract data type); Artificial neural network; Fraction (chemistry); Search algorithm; Data mining; Artificial intelligence; Machine learning; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03004404638362173,"gpt":0.2976025547664607,"spread":0.267558508382839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003057177,0.0001082422,0.0001256469,0.00009889371,0.0001209208,0.00007939302,0.0003106156,0.00004869904,0.00007224338],"category_scores_gemma":[0.0001261009,0.00009305241,0.00005897675,0.000290362,0.00002746915,0.001261306,0.0001080038,0.00005747964,0.00004724801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004999562,"about_ca_system_score_gemma":0.00002566831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003059972,"about_ca_topic_score_gemma":2.409461e-7,"domain_scores_codex":[0.9990258,0.0000493094,0.0001568229,0.0002387661,0.0001725776,0.0003567808],"domain_scores_gemma":[0.9989792,0.000332457,0.0000395515,0.0003119384,0.0002126881,0.0001241735],"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.00002900649,0.0001233159,0.000385222,0.000006806139,0.00001513874,2.062465e-7,0.0004558414,0.9489498,0.0001295933,0.01463999,0.0003109926,0.03495416],"study_design_scores_gemma":[0.001499832,0.00003008726,0.0000699839,0.000002033191,0.000003236832,0.000006310906,0.00002123282,0.9911203,0.005485146,0.00009981196,0.001520858,0.0001411074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001044451,0.00005174994,0.9956669,0.0002600317,0.0003932623,0.0005087549,0.000001878897,0.0002073654,0.002805608],"genre_scores_gemma":[0.02400307,0.0000106053,0.9739851,0.0003675142,0.0001046767,0.00008182279,0.000007782495,0.00001485832,0.00142459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04217063,"threshold_uncertainty_score":0.3794567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W60686164","doi":"10.1007/978-3-642-25566-3_40","title":"Sequential Model-Based Optimization for General Algorithm Configuration","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2377,"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":"Solver; Computer science; Algorithm; Categorical variable; Mathematical optimization; Satisfiability; Integer programming; State (computer science); Optimization problem; Search algorithm; State space; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.02616477628119233,"gpt":0.2674975861835472,"spread":0.2413328099023549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005247568,0.0006096991,0.0005015853,0.0008785846,0.0003653966,0.0004216869,0.001942353,0.0004092219,0.00003840955],"category_scores_gemma":[0.00008723113,0.0006276979,0.0001745011,0.0004837822,0.0004998371,0.00112277,0.0003780352,0.0004355017,0.00001128304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005223036,"about_ca_system_score_gemma":0.001072773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009203582,"about_ca_topic_score_gemma":0.00000946371,"domain_scores_codex":[0.9962039,0.00003538729,0.0006244569,0.001757964,0.0007392892,0.0006390087],"domain_scores_gemma":[0.9970486,0.0001944647,0.0004914929,0.001067845,0.001011856,0.0001857336],"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.00000558929,0.00002004323,2.839999e-7,0.00001034764,0.000005435883,0.000005591134,0.0001237326,0.6804618,0.00003293552,0.009221246,0.00000399366,0.310109],"study_design_scores_gemma":[0.0006702276,0.0001449054,0.000001107272,0.00007892436,0.00001153921,0.00001205802,3.938852e-8,0.926464,0.003411001,0.06842327,0.000131902,0.0006510412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[4.989434e-7,0.00007747368,0.9955601,0.0001821432,0.00169266,0.001136787,0.0000330017,0.0002681568,0.001049239],"genre_scores_gemma":[0.0007306621,0.00001858285,0.9971319,0.0009858292,0.0004054768,0.00006757867,0.00008409699,0.00006446243,0.0005114481],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.309458,"threshold_uncertainty_score":0.9996175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151238122","doi":"10.1023/a:1012771025575","title":"A Taxonomy of Global Optimization Methods Based on Response Surfaces","year":2001,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2137,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Waterloo; RAND Corporation","keywords":"Mathematics; Simple (philosophy); Mathematical optimization; Theme (computing); Management science; Algorithm; Computer science; Epistemology; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02457143740247184,"gpt":0.3308629553278328,"spread":0.3062915179253609,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001571037,0.0002972907,0.0004971764,0.0001810352,0.0001287444,0.0001368847,0.000799797,0.0001642172,0.00005867444],"category_scores_gemma":[0.00127126,0.000279374,0.0002077432,0.0024049,0.00009403945,0.00144994,0.0001039644,0.0001663755,0.000003300867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009568722,"about_ca_system_score_gemma":0.0005603045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008947962,"about_ca_topic_score_gemma":0.000001887719,"domain_scores_codex":[0.9966089,0.0009376432,0.001040569,0.0003772885,0.0007199707,0.0003156265],"domain_scores_gemma":[0.9957034,0.0003464802,0.00161942,0.0004777747,0.001639762,0.000213166],"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.001003325,0.0002723583,0.001779309,0.000005995883,0.00003628901,0.00002719645,0.00002154853,0.988131,0.00002861346,0.0007740325,0.0001056927,0.007814653],"study_design_scores_gemma":[0.001935537,0.0006608565,0.001863578,0.00007772101,0.00003270481,0.000133881,0.00003530484,0.9941744,0.000194876,0.0001663586,0.0004853376,0.0002395004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006317706,0.000131019,0.9960013,0.0008860551,0.0006548419,0.0003557107,0.00001867274,0.00007067596,0.001249946],"genre_scores_gemma":[0.04555365,0.00007953651,0.9539672,0.0002886528,0.00005985772,0.000007440524,0.000005165512,0.00001466712,0.00002384975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04492188,"threshold_uncertainty_score":0.9999658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048711666","doi":"10.1115/1.2429697","title":"Review of Metamodeling Techniques in Support of Engineering Design Optimization","year":2006,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1680,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metamodeling; Scope (computer science); Computer science; Engineering design process; Process (computing); Computation; Systems engineering; Industrial engineering; Management science; Engineering; Software engineering; Algorithm; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0273155051470184,"gpt":0.2721950032825603,"spread":0.2448794981355419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00238092,0.0001299541,0.0005024311,0.0003175449,0.00001268711,0.00001152562,0.0004805815,0.00007344259,0.0000134635],"category_scores_gemma":[0.0005524519,0.0001154704,0.0001203066,0.0006549601,0.00001265069,0.0005637346,0.00005893618,0.0001820939,3.513415e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008402428,"about_ca_system_score_gemma":0.0001333442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002901969,"about_ca_topic_score_gemma":8.939613e-8,"domain_scores_codex":[0.997932,0.0002154056,0.001175966,0.0001535503,0.0003703451,0.0001526905],"domain_scores_gemma":[0.9979876,0.000284622,0.0008295091,0.0002062403,0.0006405325,0.00005144574],"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.00001388715,0.00009240767,5.098133e-7,0.0001673617,0.00001064567,0.00001126858,0.00001033841,0.9857861,0.009265513,0.001600039,0.0001289308,0.002912947],"study_design_scores_gemma":[0.0002669373,0.0002479379,0.000001503219,0.001159113,0.0000187247,0.00005004104,0.000001391487,0.8522086,0.1446533,0.001254764,0.00004278164,0.00009486867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000002190559,0.001872508,0.9976087,0.0001202682,0.00008188363,0.0002688222,6.362138e-7,0.00002417676,0.0000208699],"genre_scores_gemma":[0.003221496,0.002906044,0.9937039,0.0001151764,0.00002822906,0.000005830587,5.061723e-7,0.00001392699,0.00000488842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1353878,"threshold_uncertainty_score":0.4708746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155752967","doi":"10.1109/tmtt.2003.820904","title":"Space Mapping: The State of the Art","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":1038,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Space mapping; Uniqueness; Surrogate model; Computer science; Context (archaeology); Mathematical optimization; Optimization problem; Algorithm; Wedge (geometry); State space; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01181982180121096,"gpt":0.2343835669542944,"spread":0.2225637451530834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003924989,0.0001285585,0.0001086455,0.00008371971,0.0002550848,0.00003565544,0.0004141901,0.00003798047,0.000005089653],"category_scores_gemma":[0.000007997265,0.00007878709,0.00007443731,0.000373824,0.0002948428,0.000201298,0.000008334868,0.0002248505,0.000004849957],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003986942,"about_ca_system_score_gemma":0.00003934563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004700395,"about_ca_topic_score_gemma":0.000007012004,"domain_scores_codex":[0.9992108,0.000160058,0.0001583209,0.0002173319,0.0001148946,0.0001385525],"domain_scores_gemma":[0.9991772,0.0001495291,0.00009417915,0.0004718537,0.00007792748,0.00002937898],"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.0000780445,0.0003150901,0.000001528534,0.00002449419,0.00008322486,0.000004729164,0.005057524,0.02007903,0.5901547,0.1239804,0.00006022046,0.260161],"study_design_scores_gemma":[0.0001393303,0.00004931711,0.000008322098,0.00003748588,0.00000593059,0.00002630642,0.00004943054,0.0001490161,0.8813737,0.1174597,0.000612016,0.0000894623],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002729401,0.00004296177,0.9949744,0.0007442136,0.0001189012,0.0003411952,0.00000766113,0.0001808518,0.0008604046],"genre_scores_gemma":[0.8056861,0.0001470245,0.1924806,0.0004153982,0.000008929933,0.00004050551,1.907522e-7,0.00001390786,0.001207373],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8029567,"threshold_uncertainty_score":0.3212844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1528483814","doi":"10.1029/2011wr011527","title":"Review of surrogate modeling in water resources","year":2012,"lang":"en","type":"article","venue":"Water Resources Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":961,"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":"Surrogate model; Computer science; Metamodeling; Variety (cybernetics); Fidelity; Field (mathematics); Management science; Data science; Systems engineering; Operations research; Risk analysis (engineering); Machine learning; Artificial intelligence; Engineering; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09503813210406548,"gpt":0.3663211718458375,"spread":0.271283039741772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004666636,0.0002025017,0.0003787986,0.0006527317,0.0001779677,0.00009023738,0.001336259,0.00009231343,0.0001168151],"category_scores_gemma":[0.0001887151,0.0001259733,0.00008888751,0.0007581406,0.0001674959,0.0008874472,0.001313798,0.0005266656,0.0002426236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001246952,"about_ca_system_score_gemma":0.00001422788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001900606,"about_ca_topic_score_gemma":0.000008893598,"domain_scores_codex":[0.9956774,0.0008730956,0.000590876,0.0005097903,0.00102838,0.001320488],"domain_scores_gemma":[0.9982265,0.0001318083,0.00004933559,0.0008730584,0.0004987477,0.0002205287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005079609,0.003582726,0.01748678,0.02117663,0.000333088,0.0002587266,0.4603534,0.2560415,0.07907656,0.001953007,0.001584514,0.1576451],"study_design_scores_gemma":[0.001693732,0.0002125149,0.0002835088,0.005230625,0.000010714,0.00004968683,0.0006959711,0.6925296,0.1183017,0.001370866,0.1787036,0.0009174612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6918815,0.04471621,0.2468207,0.003827886,0.0004048427,0.002232217,0.000008038881,0.0003354145,0.00977312],"genre_scores_gemma":[0.9498157,0.005098319,0.04254993,0.0004144958,0.00021242,0.000154668,0.00001798639,0.00006826893,0.001668245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4596574,"threshold_uncertainty_score":0.5137041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041749499","doi":"10.1016/j.compstruc.2006.10.013","title":"Particle swarm approach for structural design optimization","year":2007,"lang":"en","type":"article","venue":"Computers & Structures","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":703,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Multi-swarm optimization; Mathematical optimization; Metaheuristic; Benchmark (surveying); Particle swarm optimization; Meta-optimization; Derivative-free optimization; Computer science; Scope (computer science); Engineering optimization; Continuous optimization; Optimization problem; Imperialist competitive algorithm; Constraint (computer-aided design); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02539615806998819,"gpt":0.2829805710165175,"spread":0.2575844129465293,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003131482,0.0002727133,0.000236843,0.000129474,0.0003273022,0.0002176082,0.0008324319,0.00009836084,0.00000513483],"category_scores_gemma":[0.00007876101,0.0002511024,0.00009251547,0.0005018966,0.0000918544,0.0006610108,0.000189864,0.0001291201,0.000001435809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001129945,"about_ca_system_score_gemma":0.00004971535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003451543,"about_ca_topic_score_gemma":4.648696e-7,"domain_scores_codex":[0.9981041,0.0000671772,0.000356074,0.0006501229,0.0002817587,0.0005407951],"domain_scores_gemma":[0.9986019,0.0002766832,0.0001832088,0.0005015647,0.0002592767,0.0001774262],"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.00003158623,0.00001449608,0.00003939025,0.000009368351,0.00002210957,0.000003198662,0.0004497724,0.9512786,0.0001254598,0.01115191,0.0001577632,0.0367163],"study_design_scores_gemma":[0.0009252601,0.0000920092,0.0007105228,0.000003607116,0.000008409936,0.00003451892,0.00003559439,0.9845149,0.008775418,0.004477223,0.0001107125,0.0003118456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004735602,0.0001385239,0.9972187,0.00006121933,0.0008436667,0.0007749654,0.000003998373,0.0004000343,0.00008537988],"genre_scores_gemma":[0.163102,0.000003780001,0.8363177,0.000305153,0.0001787963,0.00001944638,0.00002116715,0.00002496572,0.00002704012],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1626284,"threshold_uncertainty_score":0.9999941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138002307","doi":"10.1007/s00158-009-0420-2","title":"Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions","year":2009,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":588,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Manitoba","funders":"","keywords":"Computer science; Black box; Curse of dimensionality; Mathematical optimization; Engineering optimization; Optimization problem; Industrial engineering; Management science; Data science; Machine learning; Artificial intelligence; Algorithm; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02148502526040724,"gpt":0.2637584163097177,"spread":0.2422733910493105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001948051,0.0003112298,0.0003168073,0.0002545456,0.0004675647,0.0001597692,0.000175188,0.00009127403,0.000007268524],"category_scores_gemma":[0.00005483567,0.0002615455,0.0000236159,0.0006886152,0.000130554,0.001549638,0.0001562164,0.0001227042,7.191084e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005213347,"about_ca_system_score_gemma":0.0001409783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006410554,"about_ca_topic_score_gemma":0.00002363598,"domain_scores_codex":[0.9981934,0.0001105464,0.0004254567,0.0006722097,0.0003352488,0.0002631071],"domain_scores_gemma":[0.9980581,0.0001406022,0.0002315088,0.0002242005,0.001181112,0.0001644674],"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.0001170332,0.00003284847,0.00007272045,0.00001437986,0.00002408725,0.000002074456,0.001247745,0.9957951,0.0001379713,0.001110593,0.000004252666,0.001441224],"study_design_scores_gemma":[0.001044423,0.0005895561,0.009208691,0.00005015023,0.00002411332,0.00002813842,0.0002392116,0.9873067,0.00006739855,0.001104042,8.379229e-8,0.0003374491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0204311,0.00007488667,0.9780495,0.0003480331,0.0001111613,0.0008218999,0.00003173358,0.0001138776,0.00001785885],"genre_scores_gemma":[0.4079709,0.00001960392,0.5917443,0.00003388555,0.00001523206,0.00001037092,0.000180909,0.00001210214,0.00001272189],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3875398,"threshold_uncertainty_score":0.9999837,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973412675","doi":"10.1115/1.1561044","title":"Adaptive Response Surface Method Using Inherited Latin Hypercube Design Points","year":2003,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":514,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Chonnam National University; Fonds National de la Recherche Luxembourg; University of Florida","keywords":"Latin hypercube sampling; Computation; Hypercube; Computer science; Set (abstract data type); Mathematical optimization; Optimal design; Mathematics; Algorithm; Parallel computing; Monte Carlo method; Statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1089029453653143,"gpt":0.331500225385195,"spread":0.2225972800198808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007400583,0.0002710711,0.0005093318,0.0002265287,0.0001628627,0.0001097882,0.0007169214,0.0001474754,0.00004458849],"category_scores_gemma":[0.003785008,0.0002391023,0.0001662746,0.0008835318,0.00003529699,0.0009297528,0.00009689294,0.0005190988,0.00001586584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003393913,"about_ca_system_score_gemma":0.0005206827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000204531,"about_ca_topic_score_gemma":9.887598e-8,"domain_scores_codex":[0.9916975,0.006040524,0.0007985281,0.0003903673,0.000674239,0.0003988163],"domain_scores_gemma":[0.9947435,0.002998423,0.0007005794,0.0003952556,0.0008529661,0.000309319],"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.001172206,0.0002208932,0.00000157683,0.000002684201,0.00008733384,0.0003581521,0.0002812979,0.8354132,0.1528046,0.004950094,0.0001271705,0.004580772],"study_design_scores_gemma":[0.001288644,0.0007691801,0.00001695452,0.0000523806,0.00002706998,0.0008114076,0.00007277677,0.8588385,0.1226803,0.01509532,0.00009076845,0.0002566652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007510709,0.0001164382,0.9980921,0.0002146398,0.0004258499,0.0003225953,0.000001335476,0.00005428789,0.00002167434],"genre_scores_gemma":[0.02937249,0.00001828457,0.9701764,0.0002968983,0.00003445809,0.000001789139,7.961957e-8,0.00003495085,0.00006466346],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03012424,"threshold_uncertainty_score":0.975031,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097746659","doi":"10.1007/s00158-005-0557-6","title":"Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation","year":2005,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":488,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Multi-objective optimization; Mathematical optimization; Pareto principle; Piecewise; Mathematics; Pareto analysis; Simple (philosophy); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02543854397231187,"gpt":0.3319876800363245,"spread":0.3065491360640126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003710757,0.0005336479,0.0005070178,0.000285385,0.001083624,0.0002330293,0.0003971247,0.0002490765,0.00003403179],"category_scores_gemma":[0.0001679918,0.0004902435,0.0001761307,0.0004402231,0.00006939617,0.002295548,0.0002500909,0.0001641749,0.000001870597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003041717,"about_ca_system_score_gemma":0.0001944012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003889537,"about_ca_topic_score_gemma":0.00007062587,"domain_scores_codex":[0.9969923,0.0002054399,0.0006605454,0.00130528,0.0002935625,0.0005428419],"domain_scores_gemma":[0.9974624,0.0004049173,0.0004575798,0.0004334181,0.0009525468,0.0002891585],"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.0001873706,0.00003508614,0.000009897087,0.00001972787,0.00006442588,6.206404e-7,0.002379977,0.9145596,0.0002418095,0.003310564,0.0001780241,0.07901291],"study_design_scores_gemma":[0.003913345,0.0003777001,0.00008605814,0.00002083986,0.000101183,0.00003270785,0.000265032,0.9902878,0.002128753,0.001914409,0.0002181609,0.0006539901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004693398,0.0002834783,0.993817,0.001588043,0.0007249114,0.003033876,0.0001187706,0.0003178004,0.00006920296],"genre_scores_gemma":[0.001535886,0.00007371042,0.9953021,0.0001832559,0.0009070681,0.0004869443,0.0006115126,0.00006776803,0.0008317154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07835892,"threshold_uncertainty_score":0.9997549,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012884505","doi":"10.1007/s00158-011-0666-3","title":"pyOpt: a Python-based object-oriented framework for nonlinear constrained optimization","year":2011,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":422,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Python (programming language); Computer science; Optimization problem; Mathematical optimization; Nonlinear programming; Object-oriented programming; Engineering optimization; Programming language; Theoretical computer science; Nonlinear system; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02009641153152643,"gpt":0.2790700468690601,"spread":0.2589736353375337,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001701562,0.0004231542,0.0003495238,0.0002593284,0.0007460951,0.0001114164,0.0003906135,0.0002360984,0.00006537169],"category_scores_gemma":[0.0002667666,0.0003894314,0.0001149911,0.0007200586,0.0002338578,0.001111242,0.0002150645,0.000201534,0.000002131852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008559123,"about_ca_system_score_gemma":0.0001327143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008535767,"about_ca_topic_score_gemma":0.000002585431,"domain_scores_codex":[0.9977438,0.00008835251,0.0005184889,0.0009043475,0.0002644504,0.000480533],"domain_scores_gemma":[0.9981375,0.0002121316,0.0003502848,0.0004884583,0.0005845935,0.000227055],"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.0001462587,0.00006105395,0.0001856732,0.00004466846,0.00002535206,0.000005209479,0.001490301,0.9816182,0.00003675792,0.01268982,0.000005160282,0.003691574],"study_design_scores_gemma":[0.001877249,0.0003044174,0.0004188902,0.00005117958,0.00004149434,0.00002337827,0.0002222567,0.9926271,0.0008162389,0.003096282,0.00001631633,0.0005051477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001004939,0.00006822775,0.9958187,0.0002555517,0.0008266184,0.001231859,0.00009038292,0.0005015112,0.0002021825],"genre_scores_gemma":[0.03772769,0.000031495,0.9614224,0.0001154846,0.000123537,0.0001289598,0.0003302276,0.00005190405,0.00006828449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03672276,"threshold_uncertainty_score":0.9998558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964281761","doi":"10.1016/j.artint.2013.10.003","title":"Algorithm runtime prediction: Methods & evaluation","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":384,"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":"Computer science; Parameterized complexity; Generalization; Range (aeronautics); Algorithm; Variety (cybernetics); Machine learning; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.08348968459179722,"gpt":0.3889034969418591,"spread":0.3054138123500618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001184904,0.0002127731,0.0001878255,0.0001866782,0.0002735624,0.0003213013,0.0007379566,0.000100397,0.001056012],"category_scores_gemma":[0.0006330753,0.0002125312,0.0000803121,0.0009723053,0.0001194554,0.001663271,0.0002261963,0.000201754,0.002801978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001784026,"about_ca_system_score_gemma":0.0001164241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008416187,"about_ca_topic_score_gemma":0.000009044423,"domain_scores_codex":[0.9974608,0.0003661382,0.0005443257,0.0006720205,0.0005770108,0.0003797175],"domain_scores_gemma":[0.9973858,0.0002582312,0.0001726527,0.0007593464,0.001265186,0.0001587749],"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.000001018361,0.00007014555,0.00000800626,0.000001503168,0.00001248437,6.297952e-7,0.0004829114,0.01903312,0.001320599,0.009583506,0.000145095,0.969341],"study_design_scores_gemma":[0.00002716182,0.0000367587,0.0001773276,0.000006955845,0.000008521979,0.0000107861,0.00007823665,0.8379694,0.02046714,0.1394547,0.001574186,0.0001888555],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009763319,0.0001127671,0.9948069,0.000794411,0.001333629,0.0007689967,0.000004485031,0.0003767938,0.001704357],"genre_scores_gemma":[0.006005083,0.00002228281,0.9926552,0.0003096788,0.0002083691,0.0002627957,0.00001407167,0.00001855101,0.0005040326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9691521,"threshold_uncertainty_score":0.9998572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1480330138","doi":"10.1613/jair.4806","title":"Bayesian Optimization in a Billion Dimensions via Random Embeddings","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":374,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bayesian optimization; Embedding; Computer science; Categorical variable; Curse of dimensionality; Solver; Bayesian probability; Artificial intelligence; Optimization problem; Mathematical optimization; Integer programming; Machine learning; Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07307959598059346,"gpt":0.3908340800060834,"spread":0.31775448402549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428349,0.0001380224,0.000277031,0.001407946,0.000191914,0.0001472164,0.0008460852,0.00009853821,0.0001023025],"category_scores_gemma":[0.002111295,0.00009285769,0.0001023252,0.002193552,0.0002055366,0.001515621,0.0002175529,0.0004424105,0.00005568787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003634111,"about_ca_system_score_gemma":0.0002552202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001983055,"about_ca_topic_score_gemma":0.00001914578,"domain_scores_codex":[0.9967365,0.0005124304,0.0009018873,0.0003307533,0.001010616,0.0005078327],"domain_scores_gemma":[0.9962897,0.001128117,0.0003029372,0.000339451,0.001717783,0.0002220708],"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.000255688,0.0003254128,0.0001031922,0.000005733094,0.00001691784,0.0001615057,0.001049142,0.5424291,0.01857056,0.006660887,0.00004707549,0.4303748],"study_design_scores_gemma":[0.0002698063,0.0002851624,0.000023443,0.0001657752,0.00000219592,0.00008555794,0.0002215547,0.9199374,0.04906081,0.02970387,0.0001013946,0.0001430549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001486479,0.00008448563,0.9953703,0.002303805,0.0003505851,0.0002565175,8.10027e-7,0.00002344383,0.0001236247],"genre_scores_gemma":[0.6037529,0.0004704751,0.3954897,0.00003349079,0.0001461191,0.000006876674,2.572945e-7,0.00001713059,0.00008312197],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6022664,"threshold_uncertainty_score":0.3786627,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980201624","doi":"10.1016/j.ejor.2007.12.014","title":"An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":363,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Travelling salesman problem; Mathematical optimization; Heuristics; Combinatorial optimization; 2-opt; Traveling purchaser problem; Vertex (graph theory); Mathematics; Multi-objective optimization; Bottleneck traveling salesman problem; Pareto principle; Constraint (computer-aided design); Computer science; Combinatorics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04206008863009993,"gpt":0.3738648753142147,"spread":0.3318047866841148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01492814,0.0001765566,0.0001913814,0.0003914631,0.0007112113,0.0004440792,0.001108603,0.00003462703,0.000006011826],"category_scores_gemma":[0.0005508286,0.0001208409,0.00005584349,0.001128583,0.0001059752,0.001090053,0.0001049645,0.0005120307,0.000009254066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002619879,"about_ca_system_score_gemma":0.000519883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004599754,"about_ca_topic_score_gemma":0.000006966969,"domain_scores_codex":[0.9960355,0.001220958,0.0006619585,0.0004551595,0.001204018,0.0004223991],"domain_scores_gemma":[0.9932691,0.0006651412,0.0003016389,0.0003549041,0.005140606,0.0002686247],"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.000212337,0.0001767554,0.00002817423,0.000009210233,0.00003494711,0.00001247093,0.002242816,0.9271317,0.003033038,0.02608404,0.00004688592,0.04098758],"study_design_scores_gemma":[0.002690071,0.003175122,0.001223171,0.0001077121,0.00001229931,0.0002494241,0.0007253129,0.9819117,0.005740713,0.001044837,0.002808039,0.0003116186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003513339,0.00001975306,0.99471,0.001582518,0.0001503182,0.001971449,0.000006757812,0.00003139704,0.001176505],"genre_scores_gemma":[0.165919,0.000005658586,0.8333071,0.0001225777,0.0004922317,0.0000539005,0.00001267677,0.00003723047,0.00004962219],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1655676,"threshold_uncertainty_score":0.5470134,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1871676304","doi":"","title":"Bayesian optimization in high dimensions via random embeddings","year":2013,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bayesian optimization; Embedding; Computer science; Categorical variable; Solver; Bayesian probability; Artificial intelligence; Optimization problem; Integer programming; Mathematical optimization; Machine learning; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.005049378076417137,"gpt":0.1907773810526467,"spread":0.1857280029762295,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001135647,0.0001685873,0.0002885211,0.0003705941,0.0001898076,0.00004500295,0.0006382253,0.00009800473,0.0003577023],"category_scores_gemma":[0.0000367038,0.0002062514,0.00007846171,0.0007933176,0.0001097244,0.001846663,0.0003784269,0.0001437575,0.00006825211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000134196,"about_ca_system_score_gemma":0.00004801201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006357462,"about_ca_topic_score_gemma":0.00006976183,"domain_scores_codex":[0.9987416,0.0000994376,0.0001873406,0.0004463155,0.0002503914,0.0002749006],"domain_scores_gemma":[0.9988166,0.0001023088,0.0002003873,0.0004441165,0.0003080796,0.000128484],"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.00005650748,0.0002456188,0.001189094,0.00002720327,0.00004392964,0.00005578077,0.004770526,0.9631003,0.0008838414,0.001774185,0.0005716009,0.02728146],"study_design_scores_gemma":[0.002799307,0.00006112404,0.00378117,0.00004401511,0.000008606205,0.000007649332,0.0005630889,0.9914271,0.0001639189,0.0007769536,0.0001242982,0.0002427941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008047475,0.0000170132,0.9894771,0.0007723423,0.0001772768,0.0004326791,0.000005205543,0.000134143,0.0009367754],"genre_scores_gemma":[0.4259001,0.00002087046,0.5734137,0.00009123537,0.00001026032,8.940657e-7,0.00001368672,0.00001085701,0.0005383654],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4178526,"threshold_uncertainty_score":0.8410689,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2808787830","doi":"10.1109/tcyb.2018.2842158","title":"Multidirectional Prediction Approach for Dynamic Multiobjective Optimization Problems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":241,"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 Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Multi-objective optimization; Particle swarm optimization; Mathematical optimization; Evolutionary algorithm; Population; Computer science; Set (abstract data type); Optimization problem; Pareto principle; Multi-swarm optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01507246840311829,"gpt":0.2555491429524204,"spread":0.2404766745493021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001964944,0.0003049944,0.0002161356,0.0003388353,0.0005970408,0.0001169015,0.0003819673,0.0001908634,0.00002640931],"category_scores_gemma":[0.00002912746,0.0003268805,0.0001411112,0.0007685686,0.0001920936,0.0006714681,0.000005167702,0.0002457518,0.00002456485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003765267,"about_ca_system_score_gemma":0.0001021249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000145142,"about_ca_topic_score_gemma":0.00002243759,"domain_scores_codex":[0.9979234,0.00008604055,0.000398231,0.0008257783,0.0003807233,0.0003858594],"domain_scores_gemma":[0.9981661,0.000166049,0.0001755268,0.0004908582,0.0008670032,0.0001344223],"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.00003998083,0.0004590969,0.000003202663,0.00001220377,0.00005290251,2.500318e-7,0.0006792755,0.9766106,0.0003849933,0.0002262379,0.00003292252,0.02149832],"study_design_scores_gemma":[0.001446262,0.0005018659,0.00008194282,0.00001839168,0.00003016795,0.00002119085,0.00005293632,0.9894587,0.007574208,0.0002188417,0.0002871109,0.0003083953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007139052,0.00001528125,0.9953471,0.00006692156,0.001508987,0.001387039,0.0001270766,0.0006393195,0.0008368828],"genre_scores_gemma":[0.1776446,0.00004254932,0.8204163,0.00008571438,0.0001148231,0.0005172943,0.00003362632,0.00004935336,0.001095794],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1775732,"threshold_uncertainty_score":0.9999183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165622730","doi":"10.1287/opre.1080.0685","title":"Percentile Optimization for Markov Decision Processes with Parameter Uncertainty","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; HEC Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Ambiguity; Computer science; Markov decision process; Mathematical optimization; Parametric statistics; Set (abstract data type); Percentile; Markov chain; Markov process; Process (computing); Decision process; Operations research; Machine learning; Mathematics; Management science; Statistics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.04191846451408229,"gpt":0.3783378437581784,"spread":0.3364193792440962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080008,0.0001343345,0.0001315017,0.0003115366,0.0008150827,0.000637746,0.0005792025,0.00006263731,0.00006974029],"category_scores_gemma":[0.001525164,0.0001068329,0.00002809073,0.00156458,0.00008147983,0.001289377,0.00008182591,0.0001700532,0.00001844263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001513055,"about_ca_system_score_gemma":0.0005057167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001381114,"about_ca_topic_score_gemma":0.00009712534,"domain_scores_codex":[0.9981301,0.000108311,0.0002112481,0.0005581715,0.0005900671,0.000402083],"domain_scores_gemma":[0.9961469,0.0005941756,0.00002205341,0.0005183817,0.002601885,0.000116617],"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.00004344757,0.0001342298,0.000009844848,0.000008037128,0.00000492838,0.000001886047,0.0002760475,0.9474351,0.00006982444,0.001682862,0.0002465305,0.05008722],"study_design_scores_gemma":[0.0006610031,0.0003938919,0.0001123646,0.00003798865,0.000002250795,0.000008856593,0.00008518197,0.996733,0.000571718,0.0005172674,0.0007244789,0.0001519624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001168085,0.00004772209,0.9958649,0.001069407,0.0000502003,0.001123519,0.00000992358,0.0001024805,0.0005637656],"genre_scores_gemma":[0.08008291,0.00008525523,0.9183091,0.0001434409,0.00004671732,0.0002713251,0.00004659555,0.00001401732,0.001000647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07891482,"threshold_uncertainty_score":0.626904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096649264","doi":"10.1007/s10514-009-9130-2","title":"A Bayesian exploration-exploitation approach for optimal online sensing and planning with a visually guided mobile robot","year":2009,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":222,"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":"Computer science; Mobile robot; Reinforcement learning; Motion planning; Bayesian optimization; Partially observable Markov decision process; Artificial intelligence; Robot; Differentiable function; Bayesian probability; Robotics; Machine learning; Mathematical optimization; Markov chain","retraction":null,"screen_n_in":null,"score":{"opus":0.03127060285093802,"gpt":0.306921433026712,"spread":0.275650830175774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001531297,0.000252504,0.0002628728,0.0001855912,0.0002787045,0.0002158408,0.0002169811,0.00007415325,8.327045e-7],"category_scores_gemma":[0.00005874713,0.0002428775,0.00003909985,0.0003801139,0.00004266488,0.001462346,0.00005498022,0.0001121749,9.748112e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001054213,"about_ca_system_score_gemma":0.0001179588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007191429,"about_ca_topic_score_gemma":0.000003122506,"domain_scores_codex":[0.9984436,0.00004443004,0.0003232832,0.0006535226,0.0001919155,0.0003432154],"domain_scores_gemma":[0.9989457,0.00008610758,0.0002080827,0.0003189916,0.0003171726,0.0001239505],"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.00002182379,0.0001157039,0.00001141813,0.000007539057,0.00001491705,0.000007856088,0.002767296,0.9417996,0.0004280052,0.0003818332,0.0000221437,0.05442185],"study_design_scores_gemma":[0.001118722,0.0005409755,0.0002862147,0.00002877671,0.00001268144,0.00006411085,0.0006310099,0.9960048,0.0006071895,0.0003446488,0.00003920106,0.0003216979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001360696,0.00007052509,0.9968054,0.000236535,0.0000639824,0.000960784,0.00000403618,0.0003557341,0.0001422613],"genre_scores_gemma":[0.1486699,0.000005138361,0.850703,0.000298204,0.00006698646,0.00006038702,0.00007261919,0.00002501688,0.00009877173],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1473092,"threshold_uncertainty_score":0.9904255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3203480234","doi":"10.1155/2021/8548639","title":"Social Network Search for Solving Engineering Optimization Problems","year":2021,"lang":"en","type":"article","venue":"Computational Intelligence and Neuroscience","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Popularity; Benchmark (surveying); Metaheuristic; Conversation; Field (mathematics); Imitation; Social network (sociolinguistics); Optimization algorithm; Optimization problem; Mathematical optimization; Artificial intelligence; Machine learning; Social media; Algorithm; Mathematics; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.05464896600811137,"gpt":0.3121515330919351,"spread":0.2575025670838237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001978008,0.0001241682,0.0001182446,0.00007479899,0.0004957608,0.0002980655,0.0003308202,0.00003687691,0.000002771612],"category_scores_gemma":[0.0001649142,0.00013857,0.00003915991,0.0008915372,0.00008958267,0.000717053,0.0002324387,0.0001055774,0.000001789822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003249344,"about_ca_system_score_gemma":0.0001082261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.310603e-7,"about_ca_topic_score_gemma":3.161859e-7,"domain_scores_codex":[0.9986157,0.00002680723,0.0002192735,0.0005556672,0.0002721551,0.0003104167],"domain_scores_gemma":[0.9989972,0.000286782,0.00006354443,0.0001152767,0.0004562607,0.00008092449],"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.000001219638,0.00002101485,0.0000343663,0.00001242557,0.000001404656,0.000003697852,0.0002194381,0.9491465,0.0002224133,0.04531916,0.00002013782,0.004998209],"study_design_scores_gemma":[0.00007096037,0.00003503877,0.0002683334,0.00001537875,0.000001702645,0.00003678294,0.00001571891,0.9930306,0.002138857,0.004043243,0.0001929389,0.0001504419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001201427,0.000124261,0.9985071,0.0005768682,0.000326409,0.0002005455,0.000002634346,0.0001039478,0.00003808871],"genre_scores_gemma":[0.2362393,0.00005387384,0.7629427,0.0005377045,0.0001039358,0.0000312176,0.000008838762,0.00001193031,0.00007053772],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2361191,"threshold_uncertainty_score":0.5650722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088744342","doi":"10.1007/s00158-006-0061-7","title":"An adaptive approach to constraint aggregation using adjoint sensitivity analysis","year":2006,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":201,"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":"","keywords":"Constraint (computer-aided design); Sensitivity (control systems); Mathematical optimization; Key (lock); Minification; Computer science; Function (biology); Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01564829907526832,"gpt":0.270565997613664,"spread":0.2549176985383956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001978823,0.0002797343,0.0003032224,0.0004102505,0.0005662208,0.00017718,0.0001651621,0.00009426112,0.000004667062],"category_scores_gemma":[0.00002203123,0.0002588768,0.000079251,0.001401297,0.0001175597,0.001455973,0.0001976443,0.0001129341,9.081137e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001445734,"about_ca_system_score_gemma":0.00004536806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001644708,"about_ca_topic_score_gemma":0.00003663152,"domain_scores_codex":[0.9980897,0.0001840763,0.0003365646,0.0008248288,0.0002634927,0.0003013628],"domain_scores_gemma":[0.9988678,0.00004431012,0.0001964544,0.0003771075,0.0003405163,0.0001738756],"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.00002504759,0.00004378044,0.0005745515,0.000005413999,0.0000388724,0.000004959535,0.0005627148,0.9893987,0.0009435277,0.004640964,7.125531e-7,0.003760815],"study_design_scores_gemma":[0.0003888783,0.00009057848,0.01641406,0.00000722732,0.0001052808,0.00005278708,0.0002716566,0.9811743,0.0005025234,0.0006395694,5.015593e-7,0.0003526699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08088415,0.00001990318,0.9180068,0.00005692278,0.0001238812,0.0004688375,0.00002997986,0.0001844614,0.0002250897],"genre_scores_gemma":[0.4885723,0.000001773103,0.511236,0.00001529761,0.00004824673,0.00000728764,0.00009827042,0.00000871578,0.00001215177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4076882,"threshold_uncertainty_score":0.9999864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W74931915","doi":"10.1007/978-3-642-21434-9_3","title":"Automated Algorithm Configuration and Parameter Tuning","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":196,"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":"Computer science; Algorithm; Set (abstract data type); Selection (genetic algorithm); Parameter space; Mathematical optimization; Data mining; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02456515553784827,"gpt":0.2496453930371361,"spread":0.2250802374992878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000104126,0.0003658795,0.0003264979,0.0002306851,0.0001188763,0.0001588247,0.000359743,0.0002847002,0.0003112272],"category_scores_gemma":[0.00003109904,0.0003472947,0.0000608317,0.00005419334,0.0001089044,0.0006446335,0.0002280769,0.0002546225,0.0001754547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006364093,"about_ca_system_score_gemma":0.00006132792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001158957,"about_ca_topic_score_gemma":0.000002220577,"domain_scores_codex":[0.9984872,0.00002158424,0.0003371772,0.0006927968,0.0002365374,0.0002246513],"domain_scores_gemma":[0.9987043,0.0001114976,0.000263011,0.0005144686,0.0002757623,0.0001309656],"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.000002839885,0.00001654167,9.899534e-7,0.00001309706,0.00008400032,0.00004869701,0.0003814148,0.0001540948,0.00002906909,0.4205797,0.0006334552,0.5780561],"study_design_scores_gemma":[0.0003365434,0.00007391385,0.00002133901,0.0000535889,0.00001736261,0.00006056791,0.000003800017,0.9555199,0.0002194843,0.02565853,0.01748904,0.0005459894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.118821e-7,0.00008732658,0.6876894,0.00003502407,0.0002190131,0.0002272415,0.000005374543,0.001003932,0.3107326],"genre_scores_gemma":[0.00005113535,0.0001150112,0.7312527,0.0002458657,0.00004306448,0.00001151878,0.00002722404,0.00004054037,0.2682129],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9553657,"threshold_uncertainty_score":0.9998979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997995971","doi":"10.1115/1.4001597","title":"Metamodeling for High Dimensional Simulation-Based Design Problems","year":2010,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metamodeling; Curse of dimensionality; Black box; Computer science; Radial basis function; Engineering design process; Mathematical optimization; Function (biology); Process (computing); Nonlinear system; Algorithm; Engineering; Machine learning; Artificial intelligence; Artificial neural network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0512817169227265,"gpt":0.2965239383016135,"spread":0.245242221378887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002138971,0.0001860757,0.0003351564,0.0002018056,0.0001603801,0.00009979407,0.000663714,0.0001364291,0.00002586566],"category_scores_gemma":[0.001743771,0.0001504236,0.0001653307,0.0003005385,0.00002557581,0.0006656981,0.00005201832,0.0004009469,0.000005882171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006020212,"about_ca_system_score_gemma":0.000299958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001075954,"about_ca_topic_score_gemma":4.199569e-7,"domain_scores_codex":[0.9979844,0.0002112579,0.0006825842,0.0002918922,0.0005583192,0.0002715089],"domain_scores_gemma":[0.9945517,0.003162097,0.0005806749,0.0002920787,0.001207132,0.0002063159],"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.00008238159,0.0001244547,2.926492e-7,0.000004396367,0.00002716794,0.000006493101,0.00002101883,0.9615808,0.02561492,0.006075974,0.00003603062,0.006426099],"study_design_scores_gemma":[0.001472542,0.0004471319,0.000002670995,0.00002339614,0.00002601388,0.00001665314,0.000001427102,0.918486,0.02966002,0.04963163,0.00006611882,0.0001663976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001136138,0.00002610465,0.9978022,0.0005122339,0.0009568549,0.0005332107,0.000001823401,0.00005193176,0.000002053486],"genre_scores_gemma":[0.2912561,0.000001261214,0.708324,0.0002426569,0.0001266337,0.00001488834,6.60536e-7,0.00001804888,0.00001572556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2911425,"threshold_uncertainty_score":0.6134096,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977715424","doi":"10.1198/004017006000000228","title":"Variable Selection for Gaussian Process Models in Computer Experiments","year":2006,"lang":"en","type":"article","venue":"Technometrics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Los Alamos National Laboratory; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Frequentist inference; Computer science; Computer experiment; Process (computing); Gaussian process; Selection (genetic algorithm); Variable (mathematics); Bayesian probability; Machine learning; Gaussian; Data mining; Artificial intelligence; Algorithm; Bayesian inference; Simulation; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02013986786762383,"gpt":0.2821203503597466,"spread":0.2619804824921228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001714888,0.00013819,0.0001548179,0.001253009,0.00009303854,0.00008655318,0.0004504697,0.00009634448,0.000002752255],"category_scores_gemma":[0.00003856621,0.0001475928,0.00002697536,0.006548614,0.00001895506,0.0008364788,0.00008996695,0.0001030759,0.000003281807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002386112,"about_ca_system_score_gemma":0.00004981155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003034848,"about_ca_topic_score_gemma":0.000003016572,"domain_scores_codex":[0.9987929,0.000009963838,0.0002505566,0.0004309278,0.0002169936,0.0002986598],"domain_scores_gemma":[0.99937,0.00005694338,0.0001072453,0.0002388988,0.0001913481,0.00003555013],"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.000004177518,0.0002837398,0.0004984944,0.00001775064,0.000003687411,9.532232e-7,0.00006645357,0.8445214,0.0001356522,0.1338378,0.0000952327,0.02053467],"study_design_scores_gemma":[0.0005781932,0.00005719232,0.0001234647,0.000008232011,0.000001283336,0.000003429894,0.000006009091,0.915687,0.003313133,0.07987656,0.0001779946,0.0001674917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003852903,0.00007281743,0.997586,0.00003702585,0.0001404349,0.000527929,0.000003534927,0.0004214122,0.0008255144],"genre_scores_gemma":[0.1571972,0.000002081846,0.842419,0.00004227887,0.00004265079,0.0001610283,0.00000717675,0.00001594124,0.0001126756],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1568119,"threshold_uncertainty_score":0.6018658,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889272453","doi":"10.1039/c8sc02239a","title":"Chimera: enabling hierarchy based multi-objective optimization for self-driving laboratories","year":2018,"lang":"en","type":"article","venue":"Chemical Science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto; Canadian Institute for Advanced Research","funders":"Tata Sons; FAS Division of Science, Harvard University; Harvard University","keywords":"Chimera (genetics); Computer science; Interpretability; A priori and a posteriori; Multi-objective optimization; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01339126336610078,"gpt":0.2846620514620578,"spread":0.2712707880959571,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005523143,0.000227385,0.0001997133,0.0002216994,0.0007586118,0.000341494,0.001225204,0.00008401699,0.00001765825],"category_scores_gemma":[0.001687657,0.0002165852,0.00005522349,0.00316102,0.0008047121,0.001816726,0.0003557857,0.0001452504,0.00001038699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003674529,"about_ca_system_score_gemma":0.0005533721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003065263,"about_ca_topic_score_gemma":0.000001318691,"domain_scores_codex":[0.9975287,0.00003355005,0.0002786318,0.00101804,0.0004981526,0.0006428827],"domain_scores_gemma":[0.9971504,0.0002621935,0.0001696009,0.0004593294,0.001697817,0.0002606927],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007115817,0.001048382,0.00129192,0.00007730538,0.00005143416,0.000008405434,0.00576337,0.1101672,0.8261968,0.0238845,0.0001541529,0.03128527],"study_design_scores_gemma":[0.0004795784,0.00004737205,0.00004956407,0.00001500047,0.000003252915,0.00000181668,0.00002479038,0.6665193,0.3321093,0.0001590789,0.000385124,0.0002058409],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001757414,0.00002642765,0.996126,0.000191906,0.0005111722,0.0004578517,0.000005594417,0.0005204869,0.0004031325],"genre_scores_gemma":[0.1968819,0.000003993386,0.8025752,0.0002471721,0.0001752654,0.00007083868,0.000003744234,0.00001616555,0.00002576545],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5563521,"threshold_uncertainty_score":0.8832089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4283692374","doi":"10.1016/j.cma.2022.115223","title":"An effective multi-objective artificial hummingbird algorithm with dynamic elimination-based crowding distance for solving engineering design problems","year":2022,"lang":"en","type":"article","venue":"Computer Methods in Applied Mechanics and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":149,"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; Sorting; Benchmark (surveying); Computer science; Convergence (economics); Multi-objective optimization; Pareto principle; Algorithm; Hummingbird; Search-based software engineering; Metaheuristic; Population; Mathematics; Software; Software design; Software development","retraction":null,"screen_n_in":null,"score":{"opus":0.01611159263480726,"gpt":0.2848786785389575,"spread":0.2687670859041503,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00157351,0.0004024009,0.0004219168,0.0005098931,0.0003511128,0.0001861664,0.0005055654,0.0000789508,9.322815e-7],"category_scores_gemma":[0.00005555437,0.0004564394,0.00005262387,0.0008843871,0.00001254432,0.0003069586,0.0002420881,0.000435267,1.571313e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000498452,"about_ca_system_score_gemma":0.00005328309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002855654,"about_ca_topic_score_gemma":0.000001776162,"domain_scores_codex":[0.9977652,0.0001096817,0.0003840419,0.0009482748,0.0002485474,0.0005442576],"domain_scores_gemma":[0.9982787,0.0009380889,0.0001639308,0.0003821974,0.0001098308,0.0001272932],"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.0000162876,0.00007409776,4.784784e-7,0.00004988618,0.00001992893,0.000005144315,0.000715026,0.7486404,0.01111385,0.01354151,1.244777e-7,0.2258232],"study_design_scores_gemma":[0.001119588,0.0003253479,0.00003438636,0.00005563695,0.000013269,0.00001135188,0.0000837896,0.9905066,0.005973464,0.00126902,0.00004284007,0.0005646448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004457434,0.00009969966,0.9971126,0.00001409973,0.000513548,0.001804438,0.0000100087,0.000399674,0.000001345944],"genre_scores_gemma":[0.04712197,0.000003817773,0.9508275,0.00003416296,0.00004929352,0.001861386,0.00001207873,0.0000884703,0.000001272352],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2418662,"threshold_uncertainty_score":0.9997888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626235566","doi":"10.1007/s00521-017-3049-x","title":"Multi-objective sine-cosine algorithm (MO-SCA) for multi-objective engineering design problems","year":2017,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":145,"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":"Sorting; Sine; Benchmark (surveying); Trigonometric functions; Algorithm; Multi-objective optimization; Mathematical optimization; Set (abstract data type); Mathematics; Pareto principle; Computer science; Discrete cosine transform; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04358581292389558,"gpt":0.3086182583295261,"spread":0.2650324454056305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003101698,0.0003790222,0.0003503394,0.0001616565,0.001799685,0.0005355645,0.0009436812,0.0001153345,6.049575e-7],"category_scores_gemma":[0.0001961628,0.00038799,0.0001027165,0.0002938045,0.0001417678,0.0006858995,0.0004636695,0.0003006563,0.000007800081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001044153,"about_ca_system_score_gemma":0.00005170826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003600413,"about_ca_topic_score_gemma":0.000004247843,"domain_scores_codex":[0.9978232,0.00005525826,0.0003790581,0.001026899,0.0001921557,0.0005234653],"domain_scores_gemma":[0.9977338,0.0003766891,0.0004099989,0.0007660239,0.0005220848,0.0001913749],"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.00001219278,0.0004415679,0.0001938074,0.00007187863,0.00009276934,0.00000393623,0.001288357,0.4942181,0.005715275,0.002860974,0.00004431498,0.4950568],"study_design_scores_gemma":[0.001550766,0.00009363986,0.004041982,0.00004434383,0.00001732595,0.00003281179,0.00003897483,0.9911937,0.001867719,0.0002691424,0.0004179919,0.0004316521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002305342,0.0001431229,0.9963683,0.0002011708,0.0001841381,0.002286546,0.00003462496,0.0005233025,0.00002822504],"genre_scores_gemma":[0.101241,0.00001595944,0.897692,0.00008601473,0.0002130808,0.0005569246,0.0000136159,0.00004782328,0.0001335926],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4969755,"threshold_uncertainty_score":0.9998572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160331134","doi":"10.3390/s150717572","title":"Wireless Sensor Network Optimization: Multi-Objective Paradigm","year":2015,"lang":"en","type":"review","venue":"Sensors","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless sensor network; Optimization problem; Computer science; Software deployment; Key distribution in wireless sensor networks; Wireless network; Wireless; Distributed computing; Mathematical optimization; Computer network; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05381203925768556,"gpt":0.3300224179290673,"spread":0.2762103786713818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005633479,0.001153493,0.002532793,0.0004100965,0.0003481208,0.0003096892,0.001640681,0.0006698832,0.00003074592],"category_scores_gemma":[0.0001897928,0.00105553,0.0005880664,0.002587549,0.0001963078,0.0005900934,0.0006132393,0.0008778241,0.0004485387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007632491,"about_ca_system_score_gemma":0.000806782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001153859,"about_ca_topic_score_gemma":0.00000443852,"domain_scores_codex":[0.9944378,0.0008859755,0.001113811,0.001790594,0.0007346869,0.00103715],"domain_scores_gemma":[0.9955641,0.0004378197,0.001094603,0.001773044,0.0006297685,0.0005006602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002762733,0.00007316317,4.113003e-7,0.0004548749,0.0001546101,0.0001056555,0.0002048338,0.6257678,6.752546e-9,0.000934087,0.0003681832,0.3719336],"study_design_scores_gemma":[0.0004321142,0.00004216462,3.322963e-7,0.001250293,0.0001415984,0.0002026401,0.00002221239,0.4774556,4.228068e-7,0.00007855416,0.5194396,0.0009344199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[3.240749e-8,0.4726758,0.5239341,0.00002538432,0.001154964,0.001036944,0.00002986889,0.0004877555,0.0006550932],"genre_scores_gemma":[1.157503e-7,0.5690269,0.4287076,0.00005379487,0.0004552764,0.0001034881,0.00008149396,0.000120717,0.001450601],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.5190714,"threshold_uncertainty_score":0.9991895,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020821169","doi":"10.1016/j.envsoft.2011.09.010","title":"Numerical assessment of metamodelling strategies in computationally intensive optimization","year":2011,"lang":"en","type":"article","venue":"Environmental Modelling & Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":139,"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":"Metamodeling; Computer science; Mathematical optimization; Optimization problem; Emulation; Kriging; Function (biology); Machine learning; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02969264194579163,"gpt":0.2555625978735644,"spread":0.2258699559277728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001390544,0.0002082805,0.0002663302,0.0001656189,0.00007327574,0.00003238086,0.0003863851,0.00007018042,0.00004539761],"category_scores_gemma":[0.00001313648,0.0002236439,0.00007186813,0.000225817,0.00009051333,0.001026378,0.0001327158,0.000190961,0.000005613436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001819471,"about_ca_system_score_gemma":0.00006394096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003585017,"about_ca_topic_score_gemma":6.372604e-7,"domain_scores_codex":[0.9983857,0.00007966497,0.0004598241,0.0004840472,0.0003568729,0.0002339489],"domain_scores_gemma":[0.999246,0.00009854058,0.0002330779,0.0002832268,0.00006891147,0.00007024573],"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.000006670843,0.0001684538,0.001747335,0.000006975131,0.00001669419,0.000008392676,0.001539915,0.9933149,0.00002142121,0.002085813,3.580747e-7,0.001083108],"study_design_scores_gemma":[0.0003789113,0.00006745938,0.001608474,0.00002664475,0.000006937586,0.000005729014,0.0003528583,0.9931415,0.0002714933,0.003923598,0.000001742075,0.0002146573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003104599,0.00008108815,0.9962049,0.00001243308,0.0001003342,0.0002424787,0.000007137069,0.00009440367,0.0001525878],"genre_scores_gemma":[0.4671539,0.00003361629,0.5327172,0.00003747458,0.000005395902,0.00001276965,0.00001981671,0.00001342018,0.000006384597],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4640493,"threshold_uncertainty_score":0.9119935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4242376211","doi":"10.13052/remn.17.103-126","title":"A comparative evaluation of genetic and gradient-based algorithms applied to aerodynamic optimization","year":2008,"lang":"en","type":"article","venue":"European Journal of Computational Mechanics","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":138,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Convergence (economics); Mathematical optimization; Aerodynamics; Context (archaeology); Computation; Genetic algorithm; Algorithm; Gradient method; Multi-objective optimization; Meta-optimization; Pareto principle; Mathematics; Optimization problem; Computer science; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03800032736349541,"gpt":0.2784580856916667,"spread":0.2404577583281713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065168,0.000164877,0.0002894527,0.0003916617,0.0001299911,0.00003296267,0.0003778831,0.00001943945,0.000007523212],"category_scores_gemma":[0.0001130487,0.0001656419,0.00005853648,0.0005792709,0.0000410751,0.0002560974,0.00008933667,0.0001257522,0.000005744033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001115459,"about_ca_system_score_gemma":0.0002483277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.762467e-7,"about_ca_topic_score_gemma":2.828731e-7,"domain_scores_codex":[0.9974958,0.0004934332,0.0006705904,0.000254607,0.0009429554,0.0001425617],"domain_scores_gemma":[0.9968174,0.0001553465,0.0007171619,0.0001657277,0.001992749,0.0001516329],"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.00002556321,0.00008522612,0.000005713519,0.000004247847,0.00002864219,0.00001566203,0.0007852287,0.987936,0.000158113,0.001526825,0.00001717694,0.009411564],"study_design_scores_gemma":[0.001743778,0.0003444452,0.002780015,0.00003126799,0.00002737749,0.0001523193,0.00005060558,0.9929173,0.0002314381,0.001558822,0.00001119158,0.0001514364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01603998,0.00008866819,0.9830499,0.00009852746,0.0002257896,0.0003205723,0.000004809928,0.00002365867,0.0001480415],"genre_scores_gemma":[0.4723267,0.000005904719,0.5275487,0.00007603964,0.00002461478,0.000001926607,0.000004095942,0.00001029336,0.000001696622],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4562867,"threshold_uncertainty_score":0.6754681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969784127","doi":"10.1007/s11081-009-9082-6","title":"Benchmarking multidisciplinary design optimization algorithms","year":2009,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":134,"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":"","keywords":"Benchmarking; Multidisciplinary design optimization; Computer science; Modular design; Python (programming language); Multidisciplinary approach; Algorithm; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0119162158720246,"gpt":0.2317326145440032,"spread":0.2198163986719786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002022744,0.0002404359,0.0001853324,0.0002621149,0.0002108419,0.0001959469,0.0002526699,0.00009634271,0.00002103204],"category_scores_gemma":[0.00006936035,0.0002609727,0.00003666697,0.0006555382,0.00001772413,0.001221482,0.00009478175,0.0001329546,0.000002789116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007515358,"about_ca_system_score_gemma":0.00002690946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001064704,"about_ca_topic_score_gemma":5.226245e-8,"domain_scores_codex":[0.9987094,0.00003593902,0.000275841,0.0004708925,0.000201604,0.0003063594],"domain_scores_gemma":[0.999265,0.00007337108,0.00009341603,0.0002828677,0.0001341394,0.0001511865],"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.000002746717,0.00002925517,0.000009650037,0.000004408961,0.000006548466,0.000006370304,0.000224758,0.9857853,0.00008896067,0.0008530788,0.00001250887,0.01297643],"study_design_scores_gemma":[0.000467901,0.00008441225,0.0002820342,0.00002914847,0.000005741778,0.00003039789,0.000013274,0.9984981,0.0002001604,0.00003916914,0.00003966595,0.0003099483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001784264,0.0001230806,0.9982699,0.0002552694,0.0002825751,0.0002703375,0.00000108903,0.0005312251,0.0002487033],"genre_scores_gemma":[0.007978588,0.0002422978,0.9914678,0.00009880951,0.00008761445,0.00001646563,0.00001922717,0.00002278887,0.00006636477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01271286,"threshold_uncertainty_score":0.9999843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2076091564","doi":"10.1016/j.compstruct.2012.03.021","title":"Surrogate-based multi-objective optimization of a composite laminate with curvilinear fibers","year":2012,"lang":"en","type":"article","venue":"Composite Structures","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Curvilinear coordinates; Buckling; Stiffness; Isotropy; Structural engineering; Materials science; Fiber; Composite number; Boundary value problem; Perpendicular; Composite material; Mathematics; Engineering; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01220347788099204,"gpt":0.2585924993968429,"spread":0.2463890215158509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001592374,0.0003750247,0.0004086266,0.0003019855,0.000218962,0.00008224588,0.0006546359,0.0001100175,0.00002234247],"category_scores_gemma":[0.00003601696,0.0003209181,0.00009680752,0.0008532876,0.0002390236,0.000943938,0.0001834048,0.0002289707,0.000005441287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191391,"about_ca_system_score_gemma":0.0000787731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003764987,"about_ca_topic_score_gemma":0.00000568569,"domain_scores_codex":[0.9979845,0.0002004677,0.0003775485,0.0005056563,0.0004307734,0.0005010995],"domain_scores_gemma":[0.9980613,0.0001828872,0.0003992398,0.0006470861,0.0005384741,0.0001710329],"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.0001005707,0.0001671818,0.005827865,0.00003900785,0.0000699876,0.000005918125,0.001053971,0.9854384,0.003826434,0.001083134,0.00000927306,0.00237826],"study_design_scores_gemma":[0.002337536,0.0001552947,0.02229014,0.00005553327,0.00003704145,0.00003269346,0.00004795205,0.9006567,0.07373714,0.00008369776,0.00009242387,0.0004738172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01595809,0.0003153053,0.9822707,0.00007105693,0.0003420416,0.0004822476,0.00003136073,0.0002481027,0.0002810631],"genre_scores_gemma":[0.4397229,0.000005070256,0.5600477,0.00008824017,0.00002788311,0.00001220265,0.00003796006,0.00002658083,0.00003139145],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4237648,"threshold_uncertainty_score":0.9999243,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169003314","doi":"10.5555/1921427.1921443","title":"A Bayesian interactive optimization approach to procedural animation design","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Animation; Bayesian optimization; Variety (cybernetics); Artificial intelligence; Human–computer interaction; Task (project management); Domain (mathematical analysis); Domain knowledge; Machine learning; Bayesian probability; Graphics; Computer graphics; Computer graphics (images)","retraction":null,"screen_n_in":null,"score":{"opus":0.01425942401552141,"gpt":0.2629978905771921,"spread":0.2487384665616707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000182235,0.0001640537,0.0001255784,0.0002120471,0.0001311467,0.000211579,0.0004951638,0.00006738988,0.00003804089],"category_scores_gemma":[0.0002631571,0.0001507739,0.00003108285,0.0007594773,0.00002335392,0.001749544,0.000142624,0.0001869661,0.00003416033],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006790742,"about_ca_system_score_gemma":0.00007533011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005861022,"about_ca_topic_score_gemma":0.0000028777,"domain_scores_codex":[0.9987828,0.00005694175,0.0002077679,0.0005010276,0.0002198833,0.0002316468],"domain_scores_gemma":[0.9989695,0.00006829749,0.00009858661,0.0003639856,0.0003508696,0.0001487734],"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.00001154092,0.0001169591,0.000007613809,0.000003249692,0.000006453579,6.402847e-7,0.001093108,0.9795613,0.001414631,0.01002735,0.000189641,0.007567537],"study_design_scores_gemma":[0.0002574463,0.00005913342,0.00007162301,0.000003769976,0.000002186669,0.00002538369,0.00007384794,0.99401,0.00490064,0.0003268799,0.00006672717,0.0002023349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002164675,9.534954e-7,0.9855209,0.0004526832,0.0002573057,0.0007630255,7.362507e-7,0.0003932295,0.01258952],"genre_scores_gemma":[0.05781023,5.893736e-7,0.9409344,0.0005627746,0.00004889131,0.0001259905,0.000006586693,0.00001698124,0.0004935138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05778858,"threshold_uncertainty_score":0.6148382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080927183","doi":"10.1145/2808234","title":"A Review and Taxonomy of Interactive Optimization Methods in Operations Research","year":2015,"lang":"en","type":"review","venue":"ACM Transactions on Interactive Intelligent Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Optimization problem; Multi-objective optimization; Process (computing); Perspective (graphical); Test functions for optimization; Basis (linear algebra); Engineering optimization; Artificial intelligence; Machine learning; Management science; Multi-swarm optimization; Mathematics; Engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2519919103655676,"gpt":0.502770982196378,"spread":0.2507790718308103,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002800132,0.0007015783,0.002540712,0.002345047,0.0001844394,0.0002092652,0.001702046,0.0003452213,0.00006687015],"category_scores_gemma":[0.001229631,0.0006290315,0.0003539411,0.002877982,0.0002080013,0.001496749,0.000170171,0.001836833,0.00006090812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001676195,"about_ca_system_score_gemma":0.0006698626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003486439,"about_ca_topic_score_gemma":0.00003962456,"domain_scores_codex":[0.9913846,0.004223596,0.002036294,0.001331137,0.0005393781,0.0004849493],"domain_scores_gemma":[0.9921542,0.003067801,0.0006392901,0.00173667,0.002167664,0.0002343116],"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":[0.00001533258,0.0004231946,1.0762e-7,0.006885343,0.000333075,0.00000726301,0.0006577578,0.1542461,6.365681e-7,0.0002764877,0.0000747166,0.8370799],"study_design_scores_gemma":[0.0004285884,0.0005397346,1.399497e-7,0.08130419,0.0004906212,0.0002714775,0.001064319,0.2180997,0.00008288979,0.00009874971,0.6966072,0.001012473],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[9.746781e-9,0.4762115,0.5198059,0.00003867426,0.0005468424,0.003083988,0.00005088529,0.00004388369,0.0002183108],"genre_scores_gemma":[0.000004605376,0.6873575,0.309041,0.00003260817,0.00002894928,0.003158737,0.00003066338,0.00005607897,0.0002898104],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.8360675,"threshold_uncertainty_score":0.9996161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084165293","doi":"10.1162/evco.2010.18.1.18105","title":"Strength Pareto Particle Swarm Optimization and Hybrid EA-PSO for Multi-Objective Optimization","year":2010,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Particle swarm optimization; Evolutionary algorithm; Mathematical optimization; Pareto principle; Multi-swarm optimization; Convergence (economics); Imperialist competitive algorithm; Multi-objective optimization; Computer science; Metaheuristic; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01579169677716093,"gpt":0.2768926140270181,"spread":0.2611009172498572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002668636,0.0002872378,0.0002324822,0.000204797,0.0005726088,0.0001774531,0.0002887402,0.0001104889,0.00001423683],"category_scores_gemma":[0.0003514225,0.0003226809,0.00007174881,0.0005497517,0.0001337101,0.001877922,0.0001597409,0.0002205408,0.00000953096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499491,"about_ca_system_score_gemma":0.0001470898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001504783,"about_ca_topic_score_gemma":0.00001225267,"domain_scores_codex":[0.9979458,0.0001120448,0.0004447569,0.0007999396,0.0003186546,0.0003787593],"domain_scores_gemma":[0.9981132,0.0002891363,0.0002979272,0.0003171945,0.0008023201,0.000180189],"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.00002386605,0.0001920075,0.0003072751,0.00001169378,0.0000215363,0.000002152741,0.000308235,0.9873229,0.0002141294,0.004065083,0.0001156514,0.007415522],"study_design_scores_gemma":[0.001820532,0.0001559819,0.002771425,0.00001228228,0.00001738613,0.00004308869,0.00006685068,0.9925848,0.0008925755,0.001172678,0.00009326395,0.000369104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006141757,0.00009438154,0.9909244,0.0003655588,0.0008696435,0.001029777,0.00004218265,0.0004693581,0.00006291154],"genre_scores_gemma":[0.2819073,0.00002170283,0.7174283,0.00009642571,0.0001145513,0.000131976,0.0002036962,0.00002922336,0.00006687657],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2757655,"threshold_uncertainty_score":0.9999225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966864823","doi":"10.1115/1.1904639","title":"An Efficient Pareto Set Identification Approach for Multiobjective Optimization on Black-Box Functions","year":2004,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Pareto principle; Robustness (evolution); Multi-objective optimization; Black box; Computer science; Computation; Set (abstract data type); Identification (biology); Engineering design process; Algorithm; Mathematics; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0375184653111403,"gpt":0.297536076953842,"spread":0.2600176116427018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001189239,0.0002005562,0.0002722065,0.0003051561,0.0002387017,0.0001661143,0.0006013787,0.0001296758,0.000004824944],"category_scores_gemma":[0.0005689273,0.0001776848,0.0001562416,0.0005695037,0.00004211985,0.0007524366,0.00003585307,0.0002521225,0.00000928203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004515722,"about_ca_system_score_gemma":0.0001901905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001403212,"about_ca_topic_score_gemma":2.729892e-7,"domain_scores_codex":[0.997861,0.0002502573,0.0006561583,0.0004439561,0.0005329117,0.0002556797],"domain_scores_gemma":[0.9973494,0.0002479148,0.0006712927,0.000419012,0.001100564,0.000211754],"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.0001431577,0.0006675447,2.825713e-7,0.000005228733,0.00003098282,0.00000330529,0.000341569,0.9874284,0.001876054,0.007237511,0.0000407832,0.002225199],"study_design_scores_gemma":[0.00195554,0.001162128,0.00002280393,0.00002320045,0.00003128649,0.00004211061,0.0002183149,0.9788583,0.01479758,0.002686603,0.00001147285,0.0001906458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001361989,0.00001253136,0.9982172,0.0002100217,0.000518581,0.0007859695,0.00001044581,0.00008065772,0.00002835896],"genre_scores_gemma":[0.2196312,0.000008848314,0.7800241,0.0001121542,0.0001275406,0.00003981615,0.00001157558,0.00002171778,0.00002304643],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.219495,"threshold_uncertainty_score":0.7245775,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4378446702","doi":"10.1016/j.advengsoft.2023.103571","title":"SMT 2.0: A Surrogate Modeling Toolbox with a focus on hierarchical and mixed variables Gaussian processes","year":2023,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Office National d'études et de Recherches Aérospatiales; HORIZON EUROPE Framework Programme; University of California, San Diego; Glenn Research Center; European Commission; Polytechnique Montréal; National Aeronautics and Space Administration","keywords":"Computer science; Kriging; Surrogate model; Toolbox; Python (programming language); MIT License; Data mining; Machine learning; Software; Artificial intelligence; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0080770724748144,"gpt":0.2316760830810085,"spread":0.2235990106061941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001359186,0.0002390042,0.0002289891,0.0003228543,0.00008591978,0.00008054657,0.0003255117,0.00005746353,9.947076e-7],"category_scores_gemma":[0.0005503623,0.000213809,0.00001748111,0.001532228,0.00003532827,0.001057764,0.0001114214,0.0002380898,0.000004973016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005953595,"about_ca_system_score_gemma":0.00006196083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005705611,"about_ca_topic_score_gemma":0.00002311024,"domain_scores_codex":[0.9985512,0.00002111744,0.000205446,0.0005571788,0.0002484729,0.0004165303],"domain_scores_gemma":[0.999065,0.0004124135,0.0000465763,0.0002912911,0.00008492824,0.00009977748],"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.00001269185,0.0000204385,0.0004062721,0.0001189882,0.000006645847,0.00005337639,0.0003144558,0.9753525,0.000008763766,0.002277995,0.00000101326,0.0214269],"study_design_scores_gemma":[0.0006021693,0.00009930351,0.0003266736,0.0003377523,0.000002804503,0.0000206745,0.00003540042,0.9947668,0.0002681892,0.003026322,0.0001969614,0.0003169218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003954896,0.0005709153,0.9939801,0.0001194927,0.000154055,0.0002002356,0.00000671727,0.0009621026,0.00005154105],"genre_scores_gemma":[0.3476638,0.0004004267,0.651691,0.00002662711,0.00003318313,0.0001109113,0.000006671988,0.00003926405,0.00002819689],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3437089,"threshold_uncertainty_score":0.8718876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292512861","doi":"10.1007/s41019-022-00193-5","title":"Dimensionality Reduction in Surrogate Modeling: A Review of Combined Methods","year":2022,"lang":"en","type":"review","venue":"Data Science and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Surrogate model; Dimensionality reduction; Curse of dimensionality; Computer science; Uncertainty quantification; Reduction (mathematics); Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1561659719154234,"gpt":0.4220003777894886,"spread":0.2658344058740651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004566518,0.0001988997,0.00074347,0.0004043675,0.00009510049,0.00004068912,0.001823653,0.00003803099,0.000006311624],"category_scores_gemma":[0.001195671,0.0001837983,0.00004194101,0.002962818,0.00007560166,0.001529855,0.002122661,0.0002772656,6.277223e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001657953,"about_ca_system_score_gemma":0.0003992485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000121668,"about_ca_topic_score_gemma":1.626364e-7,"domain_scores_codex":[0.997844,0.0001193155,0.0005403595,0.0008019376,0.0004632409,0.0002311646],"domain_scores_gemma":[0.9982416,0.000146761,0.000192007,0.001229403,0.000111611,0.00007863948],"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":[4.321496e-7,0.00002299721,4.135522e-8,0.01286721,0.000007333738,0.000002925765,0.00002650431,0.01350208,0.000006110146,0.001424738,0.00001140598,0.9721282],"study_design_scores_gemma":[0.00005372821,0.000009819757,3.01241e-7,0.008015121,0.00001997394,0.00003376438,0.000003782509,0.8195848,0.000001229624,0.0000223969,0.1720854,0.0001696565],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[1.045451e-7,0.5995379,0.3999264,0.00001300916,0.0002305395,0.0002260809,0.00002381637,0.00002864189,0.00001349078],"genre_scores_gemma":[3.980572e-7,0.6631464,0.336727,0.000008227668,0.000006746959,0.00002504337,0.00007694728,0.000007222803,0.000002007569],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9719586,"threshold_uncertainty_score":0.7495077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1692713333","doi":"10.1109/icpr.2002.1044794","title":"Feature selection using multi-objective genetic algorithms for handwritten digit recognition","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Feature selection; NIST; Artificial intelligence; Genetic algorithm; Novelty; Pattern recognition (psychology); Selection (genetic algorithm); Feature (linguistics); Generalization; Handwriting recognition; Data mining; Machine learning; Artificial neural network; Feature extraction; Speech recognition; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04481181056939632,"gpt":0.297182231668238,"spread":0.2523704210988417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001562961,0.0002779431,0.000231388,0.0002318338,0.0003843745,0.0002212574,0.0002598937,0.0001620091,0.00001914888],"category_scores_gemma":[0.0002822087,0.0002751664,0.0001160685,0.0008540729,0.00004476958,0.00106508,0.00005357144,0.0001733508,0.00002290697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002805562,"about_ca_system_score_gemma":0.0001342339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001611811,"about_ca_topic_score_gemma":0.00001942933,"domain_scores_codex":[0.9982124,0.0001090661,0.0002267787,0.0007710279,0.0002287785,0.0004519511],"domain_scores_gemma":[0.9985496,0.0001272229,0.000164749,0.0002818976,0.0007439362,0.0001325973],"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.00009544554,0.001321079,0.002134684,0.0001015006,0.000393856,0.00002962669,0.002088932,0.1574316,0.01765558,0.004178569,0.001026726,0.8135424],"study_design_scores_gemma":[0.001839576,0.0001421185,0.0006185324,0.00001975768,0.0000218055,0.0001311114,0.0000952897,0.9484023,0.04448912,0.002160988,0.001601314,0.0004781316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008114615,0.00006693524,0.9966692,0.0000920923,0.0004960912,0.0009628097,0.00001417607,0.0003598966,0.00052728],"genre_scores_gemma":[0.006823519,0.0000166957,0.9910755,0.0002393561,0.00009483338,0.0001244075,0.00001493132,0.00004018466,0.001570581],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8130643,"threshold_uncertainty_score":0.9999701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2017226599","doi":"10.1093/biomet/asn064","title":"Construction of orthogonal and nearly orthogonal Latin hypercubes","year":2009,"lang":"en","type":"article","venue":"Biometrika","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypercube; Mathematics; Latin hypercube sampling; Library science; Combinatorics; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01157170578851459,"gpt":0.2410396318267071,"spread":0.2294679260381925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438566,0.0001152604,0.0001681493,0.0006024466,0.00007624653,0.0000526237,0.0002034466,0.00006259458,0.00001883369],"category_scores_gemma":[0.000139608,0.000110422,0.00003987747,0.002048233,0.0001248724,0.0004606788,0.00006667635,0.00007465718,0.000007084783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002465855,"about_ca_system_score_gemma":0.00005324788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003354696,"about_ca_topic_score_gemma":7.246634e-7,"domain_scores_codex":[0.9989963,0.00003468676,0.0002346623,0.0003076088,0.0002615952,0.0001651719],"domain_scores_gemma":[0.9992916,0.00008796874,0.0001249698,0.0002168446,0.0001933823,0.00008522723],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002215905,0.0001400188,0.01171421,0.00001009247,0.00002466744,0.000009464619,0.0002423973,0.0003594007,0.01155115,0.07763699,0.00003846665,0.898251],"study_design_scores_gemma":[0.002927095,0.001077397,0.7891611,0.00005653569,0.00002498854,0.0003078147,0.0001366251,0.1594781,0.02517643,0.01762043,0.003170704,0.0008627482],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1298251,0.0002899448,0.868283,0.00026226,0.0002029154,0.0001299885,0.00001292212,0.0001006177,0.0008931896],"genre_scores_gemma":[0.431949,0.00004371748,0.5678203,0.00007187229,0.00003465069,0.000001622031,0.000004026294,0.00000432584,0.00007048308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8973882,"threshold_uncertainty_score":0.450288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070890570","doi":"10.1007/s11081-007-9032-0","title":"Quality assessment of coarse models and surrogates for space mapping optimization","year":2007,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Space mapping; Computer science; Convergence (economics); Mathematical optimization; Quality (philosophy); Space (punctuation); Similarity (geometry); Surrogate model; Data mining; Algorithm; Mathematics; Machine learning; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03116142398799977,"gpt":0.2983725983824184,"spread":0.2672111743944186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106785,0.0001364875,0.0001878755,0.0001888467,0.00008295749,0.00006035004,0.00009879284,0.00006233202,0.000002377032],"category_scores_gemma":[0.00009090812,0.000151131,0.00002558803,0.0003155207,0.0000255092,0.0007170672,0.00007528165,0.00005728037,4.148207e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004329241,"about_ca_system_score_gemma":0.00002064651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000470246,"about_ca_topic_score_gemma":0.000001003536,"domain_scores_codex":[0.9990796,0.00001584499,0.0003065086,0.0002768685,0.0001340484,0.000187126],"domain_scores_gemma":[0.9991975,0.000193519,0.000136914,0.0001602395,0.0002244546,0.00008731549],"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.00000256771,0.00001675513,0.0001286451,0.00004923377,0.00001028008,2.570347e-7,0.0002368,0.9814324,0.0002430112,0.01635624,0.00000127624,0.001522469],"study_design_scores_gemma":[0.0005807936,0.0000228791,0.0004804785,0.00002574671,0.000003859699,0.000003527606,0.00008069903,0.9982299,0.0003090134,0.00007787722,0.000023169,0.0001620185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003719687,0.00006814069,0.9987042,0.00008004079,0.0001155826,0.0002886357,0.000004637855,0.000122094,0.0002446944],"genre_scores_gemma":[0.08456199,0.0001377251,0.915193,0.00001805113,0.00001573287,0.00001258238,0.00001477327,0.00001577161,0.00003036135],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08419002,"threshold_uncertainty_score":0.6162941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010014459","doi":"10.1080/03052150903386674","title":"Trends, features, and tests of common and recently introduced global optimization methods","year":2010,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Global optimization; Engineering optimization; Test functions for optimization; Multidisciplinary design optimization; Computer science; Benchmark (surveying); Optimization problem; Metaheuristic; Mathematical optimization; Metamodeling; Continuous optimization; Multi-swarm optimization; Multidisciplinary approach; Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.00588880764381769,"gpt":0.2808619479518784,"spread":0.2749731403080606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000265127,0.0001987451,0.0002288939,0.0002109026,0.00007562964,0.00009685253,0.0002112884,0.0001266246,0.000009803195],"category_scores_gemma":[0.0003710946,0.0002123551,0.00002439042,0.0008471513,0.00004683541,0.0006538028,0.0001559961,0.0001888033,2.226726e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004040151,"about_ca_system_score_gemma":0.00002120493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001088965,"about_ca_topic_score_gemma":0.000004634973,"domain_scores_codex":[0.9989266,0.000054644,0.0002689346,0.0004056733,0.0001523219,0.0001917993],"domain_scores_gemma":[0.9991066,0.0001105836,0.0001488017,0.0003518466,0.0001722824,0.0001098927],"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.000004210651,0.00002804848,0.0001374619,0.00001312161,0.0000113696,7.447164e-7,0.00009965425,0.9575661,0.0009777087,0.00294953,0.00002295704,0.03818913],"study_design_scores_gemma":[0.0004528735,0.0000396914,0.004339144,0.0000144898,0.00001088023,0.0000504395,0.000004986535,0.9937024,0.001039297,0.00004755505,0.00009948092,0.0001987846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004833205,0.0002102371,0.9979916,0.00027166,0.0004987653,0.0001476713,0.000006818818,0.0002219173,0.0001680369],"genre_scores_gemma":[0.01881871,0.0001248984,0.9808741,0.00003045556,0.00005132694,0.00001121589,0.00003244658,0.00002028206,0.00003660357],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03799034,"threshold_uncertainty_score":0.8659589,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3098133464","doi":"","title":"Efficient Emulators of Computer Experiments Using Compactly Supported Correlation Functions, With An Application to Cosmology","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Correlation; Computer science; Correlation function (quantum field theory); Gaussian; Gaussian process; Function (biology); Computer experiment; Product (mathematics); Algorithm; Dimension (graph theory); Simulation; Mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03160110112162959,"gpt":0.2862074674335189,"spread":0.2546063663118893,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001001363,0.0001435285,0.0001804933,0.0002209432,0.0000993715,0.00001740965,0.0002625052,0.0000512723,0.00003089648],"category_scores_gemma":[0.000005088144,0.0001274371,0.00002299729,0.0005822671,0.00005396073,0.0002585994,0.00009059061,0.00005818322,0.00002120871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009473818,"about_ca_system_score_gemma":0.0000494684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001151143,"about_ca_topic_score_gemma":0.000006237318,"domain_scores_codex":[0.998843,0.00006241399,0.0002804345,0.0004195824,0.0002059584,0.0001885693],"domain_scores_gemma":[0.9988467,0.00002368769,0.0001904447,0.000474795,0.0003267293,0.0001376076],"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.00005580327,0.00040442,0.004583616,0.00000254313,0.00001978868,0.00000207676,0.00176082,0.9830009,0.001706971,0.003579467,0.00001083041,0.00487281],"study_design_scores_gemma":[0.0004808001,0.0003847597,0.01272415,0.000005937851,0.000007026284,0.00002173464,0.000112321,0.9808718,0.005167252,0.00005194962,0.00001569202,0.0001565477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1637407,0.000002339187,0.8352632,0.000007359063,0.0001647124,0.0004420808,0.000001886425,0.0001293247,0.0002483711],"genre_scores_gemma":[0.5088035,5.554558e-8,0.4910782,0.00006547773,0.000008708706,0.00001082935,0.000007760971,0.000007833602,0.00001767834],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3450628,"threshold_uncertainty_score":0.5196736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966918386","doi":"10.1007/s00158-010-0529-3","title":"A comparative study of metamodeling methods considering sample quality merits","year":2010,"lang":"en","type":"article","venue":"Structural and Multidisciplinary Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"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; Western Canada Research Grid","keywords":"Metamodeling; Kriging; Computer science; Robustness (evolution); Artificial neural network; Sample (material); Sample size determination; Data mining; Machine learning; Artificial intelligence; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05472640559811635,"gpt":0.4063961412182225,"spread":0.3516697356201062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000405239,0.0002395355,0.0004506501,0.000152155,0.000427261,0.00007194859,0.0002912511,0.00007218288,0.00001618233],"category_scores_gemma":[0.0002176521,0.0002067228,0.0000477947,0.0004365164,0.000130603,0.0009890718,0.0004518136,0.0002390658,3.069375e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001847687,"about_ca_system_score_gemma":0.00003872206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009220703,"about_ca_topic_score_gemma":0.00007230197,"domain_scores_codex":[0.9981707,0.0002866984,0.0005375084,0.000567425,0.0002229512,0.0002146554],"domain_scores_gemma":[0.9983086,0.0004368063,0.0003413567,0.000405926,0.0003967851,0.0001105107],"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.00002880644,0.00008532001,0.00105066,0.00002043452,0.00004649171,0.00000116602,0.01147411,0.9686086,0.00853663,0.003339215,3.462898e-7,0.006808219],"study_design_scores_gemma":[0.001022742,0.00014056,0.005917926,0.000006337417,0.00002782401,0.00001362789,0.002070571,0.9852927,0.002964833,0.002287235,0.000001907828,0.0002537331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3152169,0.00002960264,0.6838413,0.00003554848,0.0003239118,0.0004193703,0.000008883988,0.00008417074,0.00004030831],"genre_scores_gemma":[0.4634658,0.000004898043,0.536472,0.000004516256,0.00001703585,0.0000143628,0.000009125617,0.00000665707,0.000005631517],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1482488,"threshold_uncertainty_score":0.8429909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3197491224","doi":"10.1109/tnnls.2021.3105937","title":"Multi-Objective Neural Evolutionary Algorithm for Combinatorial Optimization Problems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Knapsack problem; Artificial neural network; Evolutionary algorithm; Combinatorial optimization; Travelling salesman problem; Scalability; Mathematical optimization; Artificial intelligence; Heuristics; Optimization problem; Inference; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01462026558779462,"gpt":0.2434615643741891,"spread":0.2288412987863944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002481697,0.0003242008,0.0003622254,0.0001261954,0.001054596,0.0003169266,0.0002250366,0.0001925744,0.000005631961],"category_scores_gemma":[0.00003077714,0.0003344973,0.0001437862,0.0006719811,0.00007481824,0.0007503292,0.000009826422,0.0006834563,0.000001812163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001313184,"about_ca_system_score_gemma":0.0000580686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002992484,"about_ca_topic_score_gemma":0.000003108203,"domain_scores_codex":[0.9975255,0.0004922311,0.0004318844,0.0008178383,0.0002800818,0.0004525087],"domain_scores_gemma":[0.9982856,0.0004595559,0.0002229256,0.0002962753,0.0005672774,0.0001683776],"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.00001639487,0.0001447989,0.00000993372,0.00001958675,0.00004621428,0.00001045369,0.0001812927,0.9622833,0.00002913295,0.00007922138,0.00001865426,0.03716097],"study_design_scores_gemma":[0.001950528,0.0003104699,0.00004217038,0.00005564432,0.00002592258,0.000141178,0.0001623273,0.9966399,0.00004622307,0.0000117083,0.0002569175,0.0003570276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00009560787,0.0007583652,0.9923946,0.0001017278,0.00537396,0.000855884,0.00001492315,0.0003871035,0.00001783158],"genre_scores_gemma":[0.5403805,0.0002275042,0.4568432,0.0001244935,0.0004988008,0.0005213249,0.00004650667,0.00008639349,0.001271205],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5402849,"threshold_uncertainty_score":0.9999107,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126489459","doi":"10.1016/j.inffus.2008.11.003","title":"Overfitting cautious selection of classifier ensembles with genetic algorithms","year":2008,"lang":"en","type":"article","venue":"Information Fusion","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Overfitting; Computer science; Artificial intelligence; Machine learning; Classifier (UML); Ensemble learning; Selection (genetic algorithm); Random subspace method; Data mining; Pattern recognition (psychology); Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.01127499382037043,"gpt":0.2182655320542314,"spread":0.206990538233861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009606965,0.0001315442,0.000136848,0.0002458727,0.000260111,0.00003797929,0.0002047646,0.00006927561,0.00002021028],"category_scores_gemma":[0.00005240028,0.0001147151,0.00003262744,0.0007057596,0.00005579067,0.002186847,0.00008391718,0.0001030051,0.00003451602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008870278,"about_ca_system_score_gemma":0.0001161839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003252694,"about_ca_topic_score_gemma":0.000003908369,"domain_scores_codex":[0.9988366,0.00003402755,0.0003901611,0.0001527789,0.0004050377,0.0001813417],"domain_scores_gemma":[0.9987955,0.00004527117,0.0003629583,0.0002218882,0.0005149395,0.00005940512],"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.0000918993,0.0001915294,0.007625027,0.00008925005,0.00005407768,0.00001745901,0.01292161,0.4887199,0.004655548,0.003685941,0.0008046618,0.4811431],"study_design_scores_gemma":[0.0008792017,0.0001703651,0.02145105,0.00003086053,0.000004338598,0.0002554666,0.00009941643,0.9627889,0.01183703,0.00007870654,0.002201473,0.0002031435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03508334,0.000013634,0.9623412,0.00005296661,0.0001619958,0.0002224379,0.000002647756,0.000177194,0.001944609],"genre_scores_gemma":[0.4019483,0.00005661231,0.5976739,0.0001390794,0.00003044265,0.00001542892,0.00001198551,0.000007438896,0.0001168427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4809399,"threshold_uncertainty_score":0.4677948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118311688","doi":"10.1017/s0890060401151024","title":"Kriging as a surrogate fitness landscape in evolutionary optimization","year":2001,"lang":"en","type":"article","venue":"Artificial intelligence for engineering design analysis and manufacturing","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Institut de Recherche Robert-Sauvé en Santé et en Sécurité du Travail","keywords":"Kriging; Fitness landscape; Fitness approximation; Mathematical optimization; Surrogate model; Interpolation (computer graphics); Evolutionary algorithm; Fitness function; Computer science; Process (computing); Function (biology); Black box; Engineering design process; Mathematics; Genetic algorithm; Machine learning; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02283994912642328,"gpt":0.2641246377525363,"spread":0.241284688626113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003250752,0.0001865515,0.0002482425,0.0007605444,0.0001249579,0.0001517216,0.0002429075,0.00006108774,0.0000348884],"category_scores_gemma":[0.0001046384,0.0001975662,0.00009331579,0.0009433417,0.00001920705,0.0005991183,0.0000669506,0.00009853746,0.000004561287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005598293,"about_ca_system_score_gemma":0.00002065264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004833482,"about_ca_topic_score_gemma":0.00001717968,"domain_scores_codex":[0.9986752,0.00002983502,0.00036264,0.0004585096,0.0001483498,0.0003254854],"domain_scores_gemma":[0.9992915,0.0002415401,0.00008771371,0.0002224765,0.00007075759,0.00008599687],"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.00001404219,0.0000262109,0.00009405747,0.00000660285,0.00005926596,0.00001035124,0.0001892675,0.9740255,0.0000954788,0.002769894,8.160657e-7,0.02270853],"study_design_scores_gemma":[0.00005569517,0.00003090029,0.0002201106,0.00001318594,0.00004056461,0.000008331632,0.00007320486,0.9834166,0.01396668,0.0018919,0.00005479871,0.0002280285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003957447,0.00008063394,0.9953195,0.00009042834,0.0001118927,0.0002638158,0.000001310713,0.0001423699,0.00003262508],"genre_scores_gemma":[0.5640389,0.0001077361,0.4357126,0.00001799233,0.00002890914,0.00004684359,0.000008856444,0.00001202927,0.00002614922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5600814,"threshold_uncertainty_score":0.8056518,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2832550360","doi":"10.1080/10095020.2018.1489576","title":"An improved knowledge-informed NSGA-II for multi-objective land allocation (MOLA)","year":2018,"lang":"en","type":"article","venue":"Geo-spatial Information Science","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":86,"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":"Sorting; Multi-objective optimization; Computer science; Mathematical optimization; Context (archaeology); Pareto principle; Urban sprawl; Compromise; Grid; Operations research; Land use; Geography; Mathematics; Engineering; Algorithm; Civil engineering; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.02453521187212099,"gpt":0.3364120948461253,"spread":0.3118768829740043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001209186,0.0002773566,0.0002214,0.0006774841,0.001729534,0.0006792205,0.001606144,0.0001189232,0.00001686154],"category_scores_gemma":[0.001237771,0.0002614432,0.00006481312,0.001951212,0.0005994394,0.01951084,0.0004110712,0.0001478278,0.0001586725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004062274,"about_ca_system_score_gemma":0.001133013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002465022,"about_ca_topic_score_gemma":0.0005206271,"domain_scores_codex":[0.9976102,0.00004685721,0.0006477069,0.0005403258,0.0004864585,0.0006684809],"domain_scores_gemma":[0.9945189,0.0001209048,0.0005020841,0.0008067287,0.003746592,0.0003047983],"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.0001807344,0.0004620776,0.00043372,0.00006324115,0.00003187466,3.380306e-7,0.06021032,0.01626711,0.008083048,0.01340706,0.0002326023,0.9006279],"study_design_scores_gemma":[0.001529976,0.0006318672,0.004549707,0.00001455861,0.000004767294,0.000007422951,0.0002783514,0.9724334,0.01609292,0.0002579495,0.003834527,0.0003645409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002709364,0.000006458833,0.9925149,0.0001418729,0.001306742,0.001194697,0.00002687139,0.0003833752,0.00171569],"genre_scores_gemma":[0.50617,0.000006030533,0.4928225,0.0004527254,0.0001798302,0.000188136,0.00004980453,0.00001050384,0.0001204742],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9561663,"threshold_uncertainty_score":0.9999838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113955139","doi":"10.1145/1569901.1569940","title":"An experimental investigation of model-based parameter optimisation","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Gaussian process; Process (computing); Key (lock); Model parameter; Gaussian network model; Machine learning; Gaussian; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02873990815601129,"gpt":0.3002304423346162,"spread":0.2714905341786049,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008268357,0.00009182771,0.00009051424,0.00009806873,0.00004297871,0.00003738982,0.000258833,0.00003943064,0.00001129066],"category_scores_gemma":[0.00001824446,0.00008874831,0.00002825517,0.0002217545,0.00003796167,0.001010984,0.0000140617,0.00003920492,0.000003082731],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005079355,"about_ca_system_score_gemma":0.00005248493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002629748,"about_ca_topic_score_gemma":2.566231e-7,"domain_scores_codex":[0.9992331,0.00003964623,0.0001810669,0.0002554386,0.0001837229,0.0001070576],"domain_scores_gemma":[0.9993438,0.00002588951,0.00009292911,0.0003435426,0.0001176809,0.00007620182],"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.00000441623,0.00007909071,0.00004147762,7.584217e-7,0.00000105513,2.859732e-7,0.0003935613,0.9348626,0.05164261,0.007464304,0.000009496406,0.005500413],"study_design_scores_gemma":[0.0002345793,0.0001251255,0.000257578,0.000002227594,7.568256e-7,4.461065e-7,0.00001373472,0.6600654,0.3371249,0.002103918,7.082907e-7,0.00007057565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03482585,0.000007775265,0.9642434,0.0001610891,0.00003708037,0.0001465761,6.39186e-7,0.0001455507,0.0004320243],"genre_scores_gemma":[0.4947814,2.41071e-7,0.5048022,0.0003833325,0.000004642395,0.000004276732,0.000004729452,0.00000251322,0.00001663229],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4599555,"threshold_uncertainty_score":0.3619051,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3028365645","doi":"10.1016/j.swevo.2020.100713","title":"Surrogate-assisted grey wolf optimization for high-dimensional, computationally expensive black-box problems","year":2020,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Surrogate model; Robustness (evolution); Global optimization; Computation; Optimization problem; Local search (optimization); Mathematical optimization; Artificial intelligence; Radial basis function; Algorithm; Data mining; Machine learning; Mathematics; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.02333119363072437,"gpt":0.251606041909398,"spread":0.2282748482786736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001532055,0.000307186,0.0003102518,0.0001850018,0.0004752396,0.0001480799,0.0002605894,0.0001179044,0.00001350987],"category_scores_gemma":[0.0001805241,0.0003353047,0.0000800431,0.0006980703,0.0001486821,0.001278994,0.0001884675,0.0001375061,0.00002663743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001452576,"about_ca_system_score_gemma":0.0001977353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001482002,"about_ca_topic_score_gemma":0.000002190713,"domain_scores_codex":[0.9977047,0.0001296053,0.0005263506,0.0008565721,0.0004542416,0.0003284722],"domain_scores_gemma":[0.9975061,0.0003624798,0.0003372814,0.0001635651,0.001391758,0.0002387616],"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.00005384576,0.00009740802,0.00006327798,0.00004884403,0.00003990008,0.000004812357,0.0007471008,0.9867685,0.0001132051,0.005432278,0.001420074,0.005210706],"study_design_scores_gemma":[0.002076591,0.0002816783,0.003775815,0.00003292329,0.00001882488,0.00002675733,0.00007874255,0.9849353,0.00009670603,0.008160059,0.0001391902,0.0003774494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004910249,0.0002096629,0.9881639,0.004723406,0.0003791896,0.001084954,0.0000458725,0.000425365,0.00005740046],"genre_scores_gemma":[0.340871,0.00002197052,0.6572386,0.0009834897,0.0001200399,0.00006794659,0.000633045,0.0000279031,0.00003601409],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3359607,"threshold_uncertainty_score":0.9999099,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111188993","doi":"10.1109/tmtt.2006.890524","title":"Space-Mapping Optimization With Adaptive Surrogate Model","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Microwave Theory and Techniques","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Space mapping; Extrapolation; Surrogate model; Mathematical optimization; Space (punctuation); Computer science; Point (geometry); Algorithm; Optimization problem; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01308114340396057,"gpt":0.2424982530062474,"spread":0.2294171096022868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006803243,0.0002312313,0.0001749595,0.0003342291,0.0003039177,0.00006442919,0.0002135308,0.0001031817,0.000007260547],"category_scores_gemma":[0.000005319227,0.0002087979,0.00004684059,0.0004671047,0.000167232,0.0006717391,0.000005058101,0.0002554705,0.000002602961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000868488,"about_ca_system_score_gemma":0.00004192031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003387385,"about_ca_topic_score_gemma":0.000008357913,"domain_scores_codex":[0.9988208,0.0001033207,0.0002045685,0.0004483893,0.0001473983,0.0002755483],"domain_scores_gemma":[0.9990799,0.0002077959,0.0001067477,0.0003215655,0.0001865715,0.00009742801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003895861,0.0002029647,0.000001172015,0.000012159,0.00006427621,0.00002266842,0.001576487,0.7689534,0.05162901,0.05640154,0.000006332625,0.1207404],"study_design_scores_gemma":[0.0003325323,0.0001950023,9.899632e-7,0.0000581634,0.00001315472,0.00005096322,0.0001519468,0.2432708,0.7467603,0.008854457,0.00002733164,0.0002843454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005991961,0.00002683296,0.996173,0.00006022346,0.00005303627,0.000392843,0.000007175717,0.0006913961,0.001996257],"genre_scores_gemma":[0.3619927,0.00006096076,0.6374923,0.0001273971,0.000008630013,0.00002302645,8.969153e-7,0.00001900597,0.0002750602],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6951313,"threshold_uncertainty_score":0.8514532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}