{"meta":{"query_hash":"531a2dd68840","filters":{"topic":"Metaheuristic Optimization Algorithms Research"},"cohort_total":762,"direct_labels_cover":0,"predictions_cover":762,"exported":762,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/531a2dd68840","api":"https://metacan.xera.ac/api/v1/cohort?topic=Metaheuristic+Optimization+Algorithms+Research"},"results":[{"id":"W1134540949","doi":"","title":"Investigating the Application of Opposition-Based Ideas to Ant Algorithms","year":2007,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Artificial intelligence; Ant colony optimization algorithms; Computer science; Machine learning; Opposition (politics); Ant colony; Algorithm; Mathematical optimization; Mathematics","score_opus":0.017446497090912904,"score_gpt":0.26927330726046056,"score_spread":0.25182681016954767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1134540949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12527432,0.0025007064,0.77049524,0.0028064335,0.00037797223,0.00019642248,0.00003301499,0.00013144803,0.09818455],"genre_scores_gemma":[0.87631583,0.0010288872,0.113816746,0.000304485,0.00012059354,0.0001746342,0.00003535766,0.00006777858,0.008135718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985549,0.0009445938,0.00003131305,0.000075822,0.0002978272,0.00009553187],"domain_scores_gemma":[0.99373806,0.00522432,0.0002786204,0.00016952644,0.00045622225,0.00013323857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482455,0.0004130845,0.0005172493,0.00054443924,0.00049658614,0.0016292724,0.0009347746,0.0010481043,0.0029245564],"category_scores_gemma":[0.013017708,0.0002960666,0.00066266896,0.0005280919,0.0011817687,0.0012573099,0.00145855,0.0013505175,0.00035872086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012792576,0.000103712686,0.0019310421,0.00020907994,0.000078941695,0.00017810547,0.00046217206,0.48658147,0.0020948024,0.452426,0.0016975845,0.054109167],"study_design_scores_gemma":[0.000020406886,0.00008351006,0.00020694856,0.000029731737,0.000010282052,0.00004676116,0.00009104195,0.91422623,0.00029491913,0.081930615,0.003052046,0.0000075191247],"about_ca_topic_score_codex":0.001153326,"about_ca_topic_score_gemma":0.00087581476,"teacher_disagreement_score":0.0029245564,"about_ca_system_score_codex":0.00087874336,"about_ca_system_score_gemma":0.00064109126,"threshold_uncertainty_score":0.013128638},"labels":[],"label_agreement":null},{"id":"W116939436","doi":"10.1007/978-3-642-37198-1_19","title":"Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape Measures","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Carleton University; University of Toronto","funders":"","keywords":"Crossover; Computer science; Fitness function; Genetic algorithm; Representation (politics); Cluster analysis; Operator (biology); Fitness landscape; Smoothness; Predictability; Vehicle routing problem; Mathematical optimization; Routing (electronic design automation); Algorithm; Data mining; Artificial intelligence; Machine learning; Mathematics","score_opus":0.020595764676756556,"score_gpt":0.23648365873075455,"score_spread":0.215887894053998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116939436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488708,0.00064311805,0.04694053,0.00022290349,0.000032015723,0.0000309368,0.00017878153,0.00023592633,0.0028450768],"genre_scores_gemma":[0.97624993,0.00022036728,0.022621324,0.000023800414,0.000009662651,0.00002027051,0.00029556986,0.000043254066,0.0005158129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964094,0.0001466374,0.000016560263,0.000060883616,0.00008897062,0.00004589022],"domain_scores_gemma":[0.99555355,0.0036584272,0.00018784688,0.00020060812,0.0003299117,0.0000695743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015329615,0.0006557373,0.00054489553,0.0011079288,0.00024406823,0.000948812,0.00072701805,0.0016110105,0.00069832883],"category_scores_gemma":[0.007487441,0.00022290912,0.00052044337,0.0014575031,0.00041628905,0.00097073644,0.0002889751,0.0008033913,0.00022169143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088583314,0.00007896432,0.004590736,0.000033538206,0.00004175263,0.000022497385,0.000018800747,0.9691619,0.0011673432,0.0009124707,0.0004335908,0.023449825],"study_design_scores_gemma":[0.0000047655967,0.000051079704,0.0015923675,0.0000036329093,0.000005530182,0.000007958998,0.000009515758,0.9970306,0.00066449365,0.0005781488,0.000047887203,0.000004019822],"about_ca_topic_score_codex":0.0055324803,"about_ca_topic_score_gemma":0.0034281618,"teacher_disagreement_score":0.0055324803,"about_ca_system_score_codex":0.00082981883,"about_ca_system_score_gemma":0.00032796274,"threshold_uncertainty_score":0.011000514},"labels":[],"label_agreement":null},{"id":"W117128401","doi":"","title":"Parallel implementation of an ant colony optimization metaheuristic with OpenMP","year":2001,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Metaheuristic; Computer science; Parallel metaheuristic; Ant colony optimization algorithms; Parallel computing; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Graphics; Algorithm; Routing (electronic design automation); Embedded system; Meta-optimization; Mathematics","score_opus":0.021434303378045014,"score_gpt":0.2869342218692247,"score_spread":0.26549991849117965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117128401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18971242,0.00053275516,0.74175286,0.00048955914,0.0005738923,0.0003003623,0.00034980307,0.012412874,0.05387542],"genre_scores_gemma":[0.4069619,0.00014706928,0.5808154,0.00010368025,0.00005895084,0.0002383469,0.00042980435,0.00079027715,0.010454641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995714,0.00008165283,0.000023712955,0.00006270943,0.00018241508,0.00007815688],"domain_scores_gemma":[0.9991573,0.000270598,0.000044808654,0.00015839317,0.00030498576,0.00006383114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054940354,0.0006301849,0.00073583925,0.00059508823,0.00087318127,0.001063976,0.0018702379,0.00088080595,0.008824253],"category_scores_gemma":[0.0017846581,0.00045480923,0.0005076569,0.00090288697,0.00036040685,0.00075255457,0.00078586885,0.001033331,0.0013946933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012341514,0.0005832543,0.002283261,0.0003416022,0.000168037,0.0003924581,0.0002782016,0.49776503,0.03009312,0.016640672,0.012147588,0.43807268],"study_design_scores_gemma":[0.00011420883,0.000095468924,0.00028960808,0.000008052406,0.000026000725,0.000044789103,0.000029400428,0.9809168,0.0104121715,0.003172076,0.0048801443,0.0000113531905],"about_ca_topic_score_codex":0.004396857,"about_ca_topic_score_gemma":0.0050867773,"teacher_disagreement_score":0.008824253,"about_ca_system_score_codex":0.0005574769,"about_ca_system_score_gemma":0.00097627734,"threshold_uncertainty_score":0.029520094},"labels":[],"label_agreement":null},{"id":"W118921981","doi":"","title":"Topological order planner for POMDPs","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Domain (mathematical analysis); Computer science; Exploit; Partially observable Markov decision process; Topology (electrical circuits); Space (punctuation); Planner; Focus (optics); Mathematical optimization; Point (geometry); Order (exchange); Mathematics; Artificial intelligence; Markov chain; Combinatorics; Geometry","score_opus":0.03528534749597181,"score_gpt":0.33101782895301934,"score_spread":0.29573248145704756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118921981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024844367,0.00054162246,0.9288844,0.00055483857,0.00010995923,0.00033936466,0.0013422696,0.0014622482,0.041921005],"genre_scores_gemma":[0.61822337,0.00079632184,0.35029423,0.00015519498,0.00006462811,0.0007614715,0.0024607996,0.00043348628,0.026810486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995415,0.00012879718,0.00002564558,0.00007586848,0.00013754878,0.00009071724],"domain_scores_gemma":[0.9991731,0.00051574,0.00008663291,0.000052391748,0.00008203201,0.00009004781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064593577,0.0009435874,0.0008320834,0.00090728723,0.00055333425,0.0014189855,0.00088037504,0.0008195247,0.011845528],"category_scores_gemma":[0.0023535173,0.0004072255,0.00072072784,0.0009844139,0.0008853695,0.0015949483,0.0013432027,0.001257025,0.0009985861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014943816,0.000059898088,0.00021221141,0.0002454363,0.000022340248,0.000079934944,0.00010039158,0.8469637,0.0005498086,0.10820673,0.00475355,0.03865657],"study_design_scores_gemma":[0.00007132878,0.000073437215,0.00009993663,0.000029956327,0.000013203158,0.000026234688,0.00006219337,0.8891399,0.0004454507,0.10375311,0.0062701665,0.000015103319],"about_ca_topic_score_codex":0.0091827195,"about_ca_topic_score_gemma":0.013439081,"teacher_disagreement_score":0.011845528,"about_ca_system_score_codex":0.0019017109,"about_ca_system_score_gemma":0.0023167634,"threshold_uncertainty_score":0.039627254},"labels":[],"label_agreement":null},{"id":"W129316467","doi":"10.1007/978-3-642-30353-1_37","title":"A Multiagent System to Solve JSSP Using a Multi-Population Cultural Algorithm","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Population; Multi-agent system; Convergence (economics); Scheduling (production processes); Artificial intelligence; Distributed computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.05702662813677803,"score_gpt":0.32145490471459465,"score_spread":0.26442827657781665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129316467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029215666,0.00019406348,0.9624163,0.000165533,0.00014266651,0.00011743489,0.000022546765,0.00048169156,0.0072440677],"genre_scores_gemma":[0.3241229,0.00016323436,0.67004937,0.0001416761,0.00006508004,0.0004180659,0.00007066758,0.00008546505,0.004883525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997595,0.00008386971,0.00001689048,0.000042910953,0.00007170774,0.000025081159],"domain_scores_gemma":[0.99963987,0.00014959558,0.000026657703,0.000040426705,0.00010762385,0.000035761535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006381621,0.0005944791,0.0007095409,0.00044536742,0.0008835685,0.0008384914,0.0014747587,0.0013890278,0.0027324203],"category_scores_gemma":[0.0015017871,0.00029922384,0.0006995938,0.00046706284,0.00046733892,0.000636884,0.0011439812,0.0010871285,0.00043009254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007390623,0.0001939658,0.0006439196,0.00012623232,0.00010400019,0.00024001037,0.00024574518,0.8315067,0.010532964,0.018159684,0.0020928518,0.13608],"study_design_scores_gemma":[0.000019439656,0.00004439211,0.000071261886,0.000006731884,0.000014850376,0.000025135585,0.000017897808,0.99665415,0.00082516926,0.0014531728,0.0008617404,0.000006111939],"about_ca_topic_score_codex":0.0034783562,"about_ca_topic_score_gemma":0.0035279451,"teacher_disagreement_score":0.0034783562,"about_ca_system_score_codex":0.00041011642,"about_ca_system_score_gemma":0.0007882152,"threshold_uncertainty_score":0.009140849},"labels":[],"label_agreement":null},{"id":"W133409354","doi":"10.1007/978-3-642-37959-8_8","title":"Scheduling Using Multiple Swarm Particle Optimization with Memetic Features on Graphics Processing Units","year":2013,"lang":"en","type":"book-chapter","venue":"Natural computing series","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Particle swarm optimization; Memetic algorithm; Graphics; Scheduling (production processes); Multi-swarm optimization; Mathematical optimization; Computer graphics (images); Parallel computing; Artificial intelligence; Algorithm; Local search (optimization); Mathematics","score_opus":0.0388667624364467,"score_gpt":0.27135341513722666,"score_spread":0.23248665270077995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133409354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042290647,0.0010465992,0.9346832,0.00031705585,0.00054297526,0.00007890187,0.000060210506,0.0012367343,0.01974367],"genre_scores_gemma":[0.57205576,0.0004232968,0.41627654,0.00015777153,0.00015254498,0.00018420872,0.00011000183,0.00032975833,0.010310051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986064,0.000043458866,0.000006428794,0.000022863329,0.00004788803,0.00001861994],"domain_scores_gemma":[0.99981433,0.00008366165,0.000013994605,0.000029572324,0.0000420613,0.000016487851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024816243,0.00056113687,0.0006306388,0.00038427397,0.0005734215,0.00077418785,0.001211258,0.0006303723,0.0035751604],"category_scores_gemma":[0.00063479727,0.00032500672,0.0004493604,0.00090103666,0.00030019533,0.0005163793,0.0005443492,0.0007701405,0.00052387954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002423771,0.00007603769,0.00027494456,0.00008414856,0.000046651618,0.00009481481,0.00006229177,0.84787697,0.00791475,0.013961705,0.006912429,0.12245293],"study_design_scores_gemma":[0.00001266769,0.000024486008,0.00005058945,0.000002162512,0.000004895595,0.000006900604,0.0000059220542,0.99549747,0.0008565807,0.0023893828,0.0011455886,0.0000033471704],"about_ca_topic_score_codex":0.0034052413,"about_ca_topic_score_gemma":0.004052992,"teacher_disagreement_score":0.0035751604,"about_ca_system_score_codex":0.0007507392,"about_ca_system_score_gemma":0.00058026944,"threshold_uncertainty_score":0.01196003},"labels":[],"label_agreement":null},{"id":"W136384337","doi":"","title":"A Kohonen-like decomposition method for the traveling salesman problem—KNIES_DECOMPOSE","year":2000,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Travelling salesman problem; Euclidean geometry; Partition (number theory); 2-opt; Heuristic; Self-organizing map; Computer science; Mathematical optimization; Bottleneck traveling salesman problem; Decomposition; Artificial neural network; Traveling purchaser problem; Euclidean distance; Mathematics; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.11076987322655765,"score_gpt":0.37623869320672243,"score_spread":0.2654688199801648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136384337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042358693,0.00025988012,0.9916825,0.00009520912,0.000073510186,0.000049997918,0.000042807307,0.00019557605,0.0033645888],"genre_scores_gemma":[0.11568244,0.00045922433,0.8778563,0.00012532735,0.000052553678,0.00016356402,0.00018853233,0.00010745476,0.0053644544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997615,0.000055650296,0.000014324628,0.000037498772,0.00010092114,0.000030122492],"domain_scores_gemma":[0.99984384,0.000054711985,0.0000134131715,0.000016250615,0.00005703939,0.000014565178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045798492,0.0006343627,0.00055563403,0.00052622746,0.0005030161,0.00070909405,0.00091610075,0.0007893227,0.0026062129],"category_scores_gemma":[0.0007915565,0.00034356274,0.0008642771,0.0007225371,0.0003647446,0.0011853747,0.0008861945,0.00086684787,0.00058926607],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010642907,0.00010464472,0.00052746764,0.00027709917,0.000122066216,0.00009947735,0.0001546152,0.5951224,0.008311996,0.043048102,0.0056994115,0.3464263],"study_design_scores_gemma":[0.000012862391,0.000028195798,0.00010501326,0.000012229681,0.000013087564,0.00003987808,0.000033507073,0.9837896,0.0013993894,0.009125496,0.00542805,0.000012666698],"about_ca_topic_score_codex":0.0053497427,"about_ca_topic_score_gemma":0.0068113077,"teacher_disagreement_score":0.0053497427,"about_ca_system_score_codex":0.00042610613,"about_ca_system_score_gemma":0.00087418157,"threshold_uncertainty_score":0.010637224},"labels":[],"label_agreement":null},{"id":"W141825768","doi":"10.1007/978-3-540-95974-8_4","title":"Ant Colony Optimization for Option Pricing","year":2009,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Mathematical optimization; Binomial options pricing model; Dynamic pricing; Valuation of options; Heuristic; Optimization problem; Finance; Algorithm; Mathematics; Economics","score_opus":0.15000555853926176,"score_gpt":0.4058184447291009,"score_spread":0.2558128861898391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141825768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074803587,0.04774338,0.56943786,0.004005315,0.0032282374,0.00008159534,0.00010124767,0.0004772097,0.36744472],"genre_scores_gemma":[0.24273124,0.037694894,0.3024418,0.00089972216,0.0019395534,0.00022671859,0.0002555657,0.0007783525,0.4130322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997322,0.00006557184,0.000007861064,0.000021023217,0.00016210176,0.000011246727],"domain_scores_gemma":[0.9997876,0.00011327779,0.000010693689,0.000026462842,0.00005150761,0.000010475079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032076062,0.0008344432,0.0006952089,0.00050359423,0.00035340356,0.0013678194,0.0008925654,0.0013298183,0.009960404],"category_scores_gemma":[0.0011432398,0.00032797336,0.0003991204,0.0014551682,0.0008640766,0.0014439066,0.0005276436,0.0024695084,0.002689911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030468784,0.00007006013,0.000085035754,0.00023388414,0.000036179852,0.000109059234,0.000104169114,0.11844339,0.0015745359,0.59392965,0.052192196,0.23319133],"study_design_scores_gemma":[0.000020511228,0.000031916243,0.00013530688,0.0001089511,0.000016464755,0.00016477914,0.000035120695,0.3435121,0.0007972082,0.5350688,0.120087296,0.000021582226],"about_ca_topic_score_codex":0.0010543002,"about_ca_topic_score_gemma":0.0014753451,"teacher_disagreement_score":0.009960404,"about_ca_system_score_codex":0.0006411661,"about_ca_system_score_gemma":0.00043682053,"threshold_uncertainty_score":0.033320904},"labels":[],"label_agreement":null},{"id":"W1485070158","doi":"10.1007/978-3-642-16493-4_10","title":"Diversity Analysis of Opposition-Based Differential Evolution—An Experimental Study","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Ode; Differential evolution; Opposition (politics); Computer science; Diversification (marketing strategy); Convergence (economics); Mathematical optimization; Diversity (politics); Applied mathematics; Mathematics; Algorithm; Sociology; Political science","score_opus":0.02656602512742368,"score_gpt":0.2934900456550681,"score_spread":0.2669240205276444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485070158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93468136,0.00048092235,0.055030618,0.00007691777,0.000048581715,0.00008249115,0.00014494639,0.00013256578,0.009321581],"genre_scores_gemma":[0.9798997,0.00010190227,0.018608013,0.000011661029,0.000008014889,0.000029898814,0.0001379023,0.000033113596,0.0011696883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929225,0.00026822413,0.00003077841,0.000070207934,0.0002764731,0.00006210417],"domain_scores_gemma":[0.99533683,0.0033804302,0.00020469584,0.00035482174,0.0006272363,0.00009602881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013141412,0.00034811688,0.0006137201,0.0010379886,0.0004622677,0.00063072477,0.0006887833,0.0005187822,0.0015251508],"category_scores_gemma":[0.004280086,0.000120823475,0.00035561607,0.0011166423,0.00047123455,0.0006208837,0.00050847384,0.0004490675,0.00015942019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036626635,0.0026903446,0.009276314,0.00077882566,0.00023756069,0.00034598183,0.00058125885,0.49155003,0.197286,0.015590308,0.0019689824,0.2760318],"study_design_scores_gemma":[0.000101051686,0.0018194761,0.004360924,0.000020674483,0.00005756011,0.00023834466,0.00014494367,0.9513022,0.038216013,0.0027742386,0.0009343718,0.000030195419],"about_ca_topic_score_codex":0.00071238016,"about_ca_topic_score_gemma":0.0004608141,"teacher_disagreement_score":0.0015251508,"about_ca_system_score_codex":0.00038812347,"about_ca_system_score_gemma":0.0002018704,"threshold_uncertainty_score":0.006949961},"labels":[],"label_agreement":null},{"id":"W1485502543","doi":"10.1007/s10898-016-0467-8","title":"Geodesic and contour optimization using conformal mapping","year":2016,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","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":"Geodesic; Mathematics; Local optimum; Conformal map; Curse of dimensionality; Differentiable function; Function (biology); Jump; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.02831613189250692,"score_gpt":0.28467594396953333,"score_spread":0.2563598120770264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485502543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015501205,0.0004023616,0.97515714,0.00032098818,0.00013797777,0.000051086892,0.000045161098,0.0001044232,0.00827976],"genre_scores_gemma":[0.45059785,0.00079776446,0.53369683,0.00021691639,0.00020930452,0.00027179156,0.00018366046,0.0004360638,0.013589698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997069,0.00012166772,0.00001002515,0.000049052458,0.00009099065,0.000021290467],"domain_scores_gemma":[0.9989905,0.0006790853,0.00007044095,0.00008568384,0.00012836247,0.000045989742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010369637,0.00078570633,0.0010196116,0.0012793605,0.00051735155,0.0012891042,0.0010900685,0.002061101,0.0030655349],"category_scores_gemma":[0.0048288186,0.00067268003,0.0009932895,0.001127898,0.0013848579,0.0014138073,0.0016630872,0.0014256462,0.0003678381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033570654,0.000028277063,0.0002835723,0.00006958741,0.000028420322,0.00003949679,0.00007473782,0.83056813,0.0010891923,0.13532363,0.0013704908,0.031090867],"study_design_scores_gemma":[0.0000058848796,0.000007555333,0.00003259572,0.00000424312,0.0000029389662,0.0000073563237,0.0000061290248,0.97952443,0.00010522801,0.01965964,0.0006398802,0.000004143291],"about_ca_topic_score_codex":0.005050537,"about_ca_topic_score_gemma":0.0032513335,"teacher_disagreement_score":0.005050537,"about_ca_system_score_codex":0.0011673538,"about_ca_system_score_gemma":0.001007764,"threshold_uncertainty_score":0.010255218},"labels":[],"label_agreement":null},{"id":"W1488040414","doi":"10.1007/978-3-642-13059-5_20","title":"The Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Ant colony optimization algorithms; Visibility; Computer science; Path (computing); Solver; Mathematical optimization; Algorithm; Integer programming; Search algorithm; Object (grammar); Motion planning; Artificial intelligence; Mathematics; Robot","score_opus":0.02427545259411336,"score_gpt":0.29298416388863086,"score_spread":0.2687087112945175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488040414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043392167,0.001142317,0.97807366,0.0002535783,0.00020930757,0.000059556587,0.000100248115,0.0007352893,0.015086876],"genre_scores_gemma":[0.11083743,0.0018830036,0.85980105,0.00012787242,0.00015955209,0.00015497285,0.00033247357,0.0006402707,0.026063278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966943,0.0000562381,0.000010902586,0.000051204886,0.00018157119,0.000030672676],"domain_scores_gemma":[0.99974483,0.00011363996,0.000022709271,0.000030419042,0.00006520786,0.00002319165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339805,0.0008932269,0.0010547824,0.0006265545,0.0005179205,0.0012670634,0.0014766298,0.0013949203,0.005887785],"category_scores_gemma":[0.0014941442,0.00037417677,0.00062523165,0.0013223252,0.000644506,0.0018230737,0.0011296468,0.0015260682,0.0015857181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015824451,0.000097277734,0.00028867446,0.0002994177,0.00006509701,0.00012235374,0.000095119496,0.39917988,0.0064738216,0.08917618,0.025727423,0.47831652],"study_design_scores_gemma":[0.000047446272,0.000058021393,0.00013451156,0.000028748185,0.000021238942,0.00015803061,0.000022254402,0.9243533,0.0023803883,0.042322382,0.030450843,0.000022828823],"about_ca_topic_score_codex":0.0026034527,"about_ca_topic_score_gemma":0.003266111,"teacher_disagreement_score":0.005887785,"about_ca_system_score_codex":0.00044792367,"about_ca_system_score_gemma":0.0012287345,"threshold_uncertainty_score":0.019696593},"labels":[],"label_agreement":null},{"id":"W1490136960","doi":"10.1007/978-3-540-78761-7_60","title":"Cumulative Step Length Adaptation for Evolution Strategies Using Negative Recombination Weights","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Adaptation (eye); Recombination; Algorithm; Biology; Genetics; Neuroscience","score_opus":0.05761800603408946,"score_gpt":0.30842489990165806,"score_spread":0.2508068938675686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490136960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015808925,0.00041229784,0.979214,0.00007864986,0.00009822581,0.0000533989,0.000012202579,0.00026584254,0.00405642],"genre_scores_gemma":[0.5152355,0.00041242718,0.47316614,0.000193667,0.00011864791,0.00034030274,0.000086113876,0.00033459402,0.0101125045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961,0.00011815622,0.000023813815,0.0000722863,0.00013993033,0.000035856254],"domain_scores_gemma":[0.9981705,0.001130778,0.000121771176,0.00016527036,0.00034453184,0.00006728153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014359041,0.0006584395,0.00076937873,0.00074614555,0.00037545775,0.0007480016,0.001806424,0.0012627045,0.0030328424],"category_scores_gemma":[0.005607196,0.00035550402,0.00046809085,0.0007559914,0.00055304926,0.0010794186,0.00097145716,0.0013345095,0.0005784985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013493752,0.00018022193,0.0005483859,0.00012988539,0.00006460637,0.00006539973,0.0001369471,0.67550313,0.011660376,0.025352655,0.0018375776,0.28438595],"study_design_scores_gemma":[0.000011894417,0.000034065455,0.00010049807,0.00000953692,0.000011357311,0.000022729846,0.000005291214,0.99551445,0.0009324202,0.0026674382,0.00068340317,0.000006952046],"about_ca_topic_score_codex":0.0013631216,"about_ca_topic_score_gemma":0.0017558167,"teacher_disagreement_score":0.0030328424,"about_ca_system_score_codex":0.00067532033,"about_ca_system_score_gemma":0.00056079414,"threshold_uncertainty_score":0.010145843},"labels":[],"label_agreement":null},{"id":"W1491708267","doi":"10.1007/3-540-45034-3_70","title":"Using Local Information to Guide Ant Based Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Travelling salesman problem; Computer science; Ant colony optimization algorithms; Ant colony; Mathematical optimization; Artificial intelligence; ANT; Local search (optimization); Local optimum; Theoretical computer science; Mathematics; Algorithm; Computer network","score_opus":0.061170187621450635,"score_gpt":0.3404723376348202,"score_spread":0.27930215001336955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491708267","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014574176,0.00039868912,0.9683723,0.00013621169,0.00013676514,0.000081463644,0.000040212446,0.0016638526,0.014596402],"genre_scores_gemma":[0.33763444,0.00040890748,0.6476932,0.00023819378,0.000097187236,0.00021546903,0.00018116008,0.00079897436,0.012732354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995766,0.000117117364,0.000021557693,0.00006143108,0.00018728622,0.000035938552],"domain_scores_gemma":[0.99875295,0.00062728906,0.000105898755,0.00017500126,0.0002841066,0.000054824923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008983903,0.00090575585,0.0010974386,0.0011059801,0.0006852585,0.0012079299,0.0015271548,0.0013154666,0.004501708],"category_scores_gemma":[0.0041902945,0.0006718647,0.00045872963,0.0010565846,0.0006529497,0.0015122758,0.0012788915,0.0011867998,0.001669181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025765365,0.00014501646,0.0007915885,0.00017563567,0.000075111595,0.00014148149,0.00023845524,0.6059524,0.009825966,0.024375996,0.0077254786,0.3502952],"study_design_scores_gemma":[0.000024658433,0.000046019497,0.00009293614,0.000017540411,0.000015918784,0.000036201156,0.000014551973,0.99012053,0.0018349171,0.005738794,0.0020470303,0.000010925575],"about_ca_topic_score_codex":0.0029256395,"about_ca_topic_score_gemma":0.0059189447,"teacher_disagreement_score":0.004501708,"about_ca_system_score_codex":0.0004705382,"about_ca_system_score_gemma":0.0006676049,"threshold_uncertainty_score":0.01505971},"labels":[],"label_agreement":null},{"id":"W1493450895","doi":"10.1007/3-540-47922-8_15","title":"Genetic Algorithms for Continuous Problems","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Crossover; Computer science; Encoding (memory); Algorithm; Bit array; String (physics); Decoding methods; Floating point; Range (aeronautics); Genetic algorithm; Chromosome; Point (geometry); Theoretical computer science; Mathematics; Artificial intelligence; Type (biology); Machine learning","score_opus":0.03575385609887436,"score_gpt":0.2751730455615375,"score_spread":0.23941918946266313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493450895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024800587,0.019695966,0.91320235,0.0008834239,0.0012194203,0.000055342574,0.00010009574,0.000658606,0.061704792],"genre_scores_gemma":[0.118739545,0.022715375,0.7530944,0.00075828785,0.0013342258,0.00045617006,0.0005595691,0.0006742779,0.10166817],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961793,0.00010842049,0.000012822126,0.00004978961,0.00018859575,0.000022367112],"domain_scores_gemma":[0.9996921,0.00018134619,0.000013602273,0.000055058168,0.000046075926,0.000011779355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043937084,0.0011316156,0.0010747096,0.00070069375,0.00036842682,0.0013807584,0.0011957063,0.0016468775,0.010635147],"category_scores_gemma":[0.0015903399,0.00045864173,0.0007073285,0.002108314,0.0010728325,0.0010704043,0.00094912713,0.002446117,0.0038844526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037581987,0.00006545913,0.00012144927,0.00045264597,0.00008346847,0.00010686975,0.00012621164,0.2210509,0.0020538452,0.33962685,0.03349755,0.40277705],"study_design_scores_gemma":[0.000056715915,0.000061220104,0.00023757316,0.00019228632,0.00003986914,0.00017984567,0.00004542681,0.39485556,0.0012264679,0.47268233,0.13039413,0.00002858063],"about_ca_topic_score_codex":0.0013813028,"about_ca_topic_score_gemma":0.00121996,"teacher_disagreement_score":0.010635147,"about_ca_system_score_codex":0.0006482148,"about_ca_system_score_gemma":0.0005870966,"threshold_uncertainty_score":0.035578072},"labels":[],"label_agreement":null},{"id":"W1495151533","doi":"","title":"Genetic Weighted K-means for Large-Scale Clustering Problems.","year":2005,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Crossover; Cluster analysis; Genetic algorithm; Computer science; Operator (biology); Selection (genetic algorithm); Mutation; Algorithm; Mathematics; Artificial intelligence; Machine learning; Genetics; Biology","score_opus":0.022238352882183142,"score_gpt":0.27861319892262676,"score_spread":0.25637484604044364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495151533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017565134,0.0008750488,0.9957047,0.00016159861,0.00006486555,0.000058851092,0.000029403875,0.00024708873,0.001101865],"genre_scores_gemma":[0.05364528,0.0008749479,0.9420879,0.00015270375,0.0001103957,0.00027954162,0.00022683245,0.00012999447,0.0024923247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998898,0.0004333659,0.000049349055,0.00020547799,0.00035794702,0.000055850312],"domain_scores_gemma":[0.9991947,0.00039445484,0.00009855664,0.000103758386,0.00017292381,0.00003559433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015753072,0.0013283803,0.0012493243,0.0012824574,0.001074427,0.0009589677,0.0020701785,0.0020790545,0.0017352138],"category_scores_gemma":[0.0038553854,0.0004592094,0.0010093868,0.002464058,0.00092749536,0.0014289219,0.0010363306,0.0017688021,0.0013591179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055552147,0.00006221634,0.0005037849,0.00029879028,0.00025946207,0.00009175261,0.00010979654,0.7333466,0.002906762,0.038954016,0.0069010607,0.21651013],"study_design_scores_gemma":[0.000019384917,0.000032395223,0.00022416188,0.00003140083,0.000034802957,0.00007258251,0.000036990892,0.9392052,0.0011948274,0.050090387,0.009033255,0.000024529385],"about_ca_topic_score_codex":0.006791026,"about_ca_topic_score_gemma":0.010245947,"teacher_disagreement_score":0.006791026,"about_ca_system_score_codex":0.0013259219,"about_ca_system_score_gemma":0.001886849,"threshold_uncertainty_score":0.013503015},"labels":[],"label_agreement":null},{"id":"W1501269181","doi":"10.1109/cec.2015.7257044","title":"Evaluating landscape characteristics of dynamic benchmark functions","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Dynamism; Benchmark (surveying); Representation (politics); Computer science; Modal; Work (physics); Geography; Engineering; Cartography","score_opus":0.08016350475788461,"score_gpt":0.3685295591600608,"score_spread":0.2883660544021762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1501269181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8739986,0.0006523358,0.11269616,0.00016948671,0.0000341405,0.000119193304,0.00077455497,0.00050804403,0.011047459],"genre_scores_gemma":[0.9765425,0.00015382502,0.021447431,0.000018846975,0.000006457367,0.00007320872,0.0009344622,0.000088586705,0.0007347539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999549,0.00014813778,0.000021652411,0.000055358007,0.00014823614,0.00007761544],"domain_scores_gemma":[0.99707544,0.0019299438,0.00022226029,0.0002107988,0.00046649866,0.00009508263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012604808,0.0006494271,0.00050398154,0.0024277938,0.00030213545,0.0010370852,0.00049647444,0.0005541022,0.0018205557],"category_scores_gemma":[0.007316528,0.0001368046,0.0004476415,0.0014789798,0.00030865776,0.00094447064,0.0004564238,0.00043510352,0.00013335668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026604824,0.00015774298,0.008266927,0.00016961774,0.00009556889,0.00012613855,0.00007288158,0.9126644,0.010436311,0.0067188037,0.001243127,0.059782475],"study_design_scores_gemma":[0.000012658075,0.00021491564,0.0066509764,0.00001596317,0.000020791884,0.00005780626,0.00007982849,0.9845142,0.0044254,0.0030921905,0.0008984043,0.000016870988],"about_ca_topic_score_codex":0.002795464,"about_ca_topic_score_gemma":0.0017086106,"teacher_disagreement_score":0.002795464,"about_ca_system_score_codex":0.0008102784,"about_ca_system_score_gemma":0.00033376782,"threshold_uncertainty_score":0.006666124},"labels":[],"label_agreement":null},{"id":"W1502618581","doi":"10.1109/mwsym.2015.7167073","title":"Parallel gradient-based local search accelerating particle swarm optimization for training microwave neural network models","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Particle swarm optimization; Artificial neural network; Computer science; Message Passing Interface; Microwave; Multi-swarm optimization; Local search (optimization); Process (computing); Algorithm; Speedup; Mathematical optimization; Parallel computing; Message passing; Artificial intelligence; Mathematics","score_opus":0.20561438215051492,"score_gpt":0.3283289173993272,"score_spread":0.12271453524881226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502618581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010602407,0.0001531348,0.9866377,0.00008179505,0.000022679074,0.000021050002,0.000011802262,0.00043971182,0.0020297621],"genre_scores_gemma":[0.5529297,0.0003166414,0.44115603,0.000073485666,0.00006015569,0.00023882493,0.000090001835,0.00020612591,0.0049289973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998735,0.000040483534,0.0000050891485,0.000015032244,0.0000547515,0.000011105095],"domain_scores_gemma":[0.99979,0.00010092797,0.000027545686,0.000023824077,0.00004964384,0.000008049944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053651823,0.00055155053,0.0005197057,0.00030728336,0.00032847901,0.0003616047,0.0007620568,0.00047225828,0.001200906],"category_scores_gemma":[0.0010875656,0.0003112122,0.00035688165,0.000399388,0.00034102477,0.00055499066,0.00041728135,0.0006802551,0.00029819176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030159086,0.000016940463,0.00022914904,0.00003014882,0.000018454859,0.00002432144,0.000029274264,0.9490446,0.0022430688,0.0038214605,0.000585926,0.043926496],"study_design_scores_gemma":[0.0000025890436,0.000006498881,0.000025968491,9.169659e-7,0.0000014352182,0.0000027789365,0.0000011833467,0.9989644,0.0003157551,0.00048414536,0.00019333043,9.801294e-7],"about_ca_topic_score_codex":0.003499115,"about_ca_topic_score_gemma":0.004160043,"teacher_disagreement_score":0.003499115,"about_ca_system_score_codex":0.00038150663,"about_ca_system_score_gemma":0.00054327806,"threshold_uncertainty_score":0.006957531},"labels":[],"label_agreement":null},{"id":"W1510216528","doi":"10.1007/11546245_4","title":"A Taxonomy of Cooperative Search Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Computer science; Implementation; Search algorithm; Incremental heuristic search; Heuristic; Taxonomy (biology); Best-first search; Meta heuristic; Theoretical computer science; Algorithm; Beam search; Artificial intelligence","score_opus":0.04515293231171504,"score_gpt":0.29364136654187756,"score_spread":0.2484884342301625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510216528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036687641,0.047279336,0.847934,0.0015660821,0.00036857722,0.00044216067,0.00027818486,0.000668253,0.09779463],"genre_scores_gemma":[0.075624555,0.056050237,0.8388968,0.0009578623,0.00060337083,0.0014089926,0.00086045556,0.00024945283,0.02534832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977476,0.00065692945,0.00021815472,0.00032669204,0.00088247063,0.00016818203],"domain_scores_gemma":[0.99809164,0.000985906,0.000127444,0.00033881248,0.00034814246,0.00010800899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019690627,0.0015101554,0.0014848616,0.0035347994,0.0015545868,0.0059176036,0.0040996973,0.0028129353,0.007745393],"category_scores_gemma":[0.005187114,0.0010479045,0.0012984384,0.009422967,0.0021637958,0.005746374,0.0027522906,0.0032594102,0.0033742497],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023155231,0.000106021114,0.00040160568,0.00068293314,0.000040403123,0.00009784455,0.00039556436,0.014272344,0.0005301751,0.7572265,0.010184796,0.21603857],"study_design_scores_gemma":[0.000034105422,0.00011730546,0.0003350443,0.0005299846,0.000038567385,0.0006943305,0.00023802534,0.06799917,0.00056787755,0.7406002,0.18880302,0.000042239226],"about_ca_topic_score_codex":0.0016864818,"about_ca_topic_score_gemma":0.0013160319,"teacher_disagreement_score":0.007745393,"about_ca_system_score_codex":0.001455178,"about_ca_system_score_gemma":0.0016344463,"threshold_uncertainty_score":0.025910914},"labels":[],"label_agreement":null},{"id":"W1520561082","doi":"","title":"Towards a Guided Cooperative Search","year":2010,"lang":"en","type":"article","venue":"reroDoc Digital Library","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Thread (computing); Metaheuristic; Computer science; Beam search; Robustness (evolution); Bidirectional search; Mathematical optimization; Search algorithm; Theoretical computer science; Algorithm; Best-first search; Mathematics; Programming language","score_opus":0.025233261105302027,"score_gpt":0.2798107181671884,"score_spread":0.25457745706188634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520561082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064663542,0.00016341849,0.9888033,0.0002408602,0.000025791172,0.000057116307,0.000011009398,0.00017098515,0.004061207],"genre_scores_gemma":[0.28381124,0.00035704824,0.709727,0.00038843436,0.00006874422,0.00051361136,0.000068427,0.00011657465,0.004948839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835384,0.0007113459,0.000058793034,0.00030308298,0.00042770215,0.00014529146],"domain_scores_gemma":[0.9985164,0.00063623174,0.00015540309,0.00036748513,0.00022305814,0.00010140432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026054124,0.0008962239,0.0010063171,0.00081815186,0.0008570652,0.0017809813,0.0027995317,0.0022197415,0.0026396022],"category_scores_gemma":[0.0051153526,0.0006051239,0.00094801595,0.00075405027,0.0020900131,0.0020599293,0.0036655662,0.0017807465,0.0006800386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010871399,0.00015007725,0.0005789308,0.00021419725,0.00014441846,0.00022818442,0.00064001605,0.57805896,0.0065982095,0.32753226,0.0023713694,0.08337468],"study_design_scores_gemma":[0.000057099445,0.0001110737,0.00008208202,0.000027560818,0.000024356345,0.000066635424,0.000057516118,0.882293,0.001005687,0.11021703,0.006042383,0.000015587331],"about_ca_topic_score_codex":0.0019765245,"about_ca_topic_score_gemma":0.001461709,"teacher_disagreement_score":0.0027995317,"about_ca_system_score_codex":0.0008491206,"about_ca_system_score_gemma":0.0018493278,"threshold_uncertainty_score":0.013778865},"labels":[],"label_agreement":null},{"id":"W1522384369","doi":"10.1109/icec.1995.487445","title":"A fitness scaling method based on a span measure","year":2002,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Scaling; Life span; Computer science; Span (engineering); Invariant (physics); Scale invariance; Transformation (genetics); Measure (data warehouse); Population; Scaling law; Artificial intelligence; Statistical physics; Theoretical computer science; Algorithm; Mathematics; Statistics; Data mining; Engineering; Physics; Geometry","score_opus":0.06681664661226051,"score_gpt":0.31897107459344504,"score_spread":0.25215442798118454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522384369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016780417,0.00042297147,0.97501445,0.000108074404,0.00013566663,0.000073527925,0.00003126361,0.0003781004,0.0070555275],"genre_scores_gemma":[0.34664738,0.00061058515,0.6425593,0.00018211755,0.00025861262,0.00036616632,0.00015515248,0.00036204344,0.00885861],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993844,0.00015500658,0.000030062925,0.00011921046,0.00028595875,0.000025398707],"domain_scores_gemma":[0.99925834,0.0003195888,0.00007796686,0.00011487906,0.00018544389,0.000043635253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073205604,0.00046559502,0.0004166581,0.0009862939,0.00039342325,0.0005911483,0.00043788215,0.00044144728,0.0034926976],"category_scores_gemma":[0.0027971566,0.00012935954,0.00043818087,0.00069685164,0.0004948548,0.0010597294,0.00065307977,0.000586155,0.0006615294],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010381894,0.0001241543,0.0017795543,0.00015731048,0.000084994994,0.00010230162,0.00028951798,0.06691638,0.058555733,0.06458575,0.0033079807,0.80399245],"study_design_scores_gemma":[0.000093712835,0.001129892,0.0057951543,0.00008452905,0.0001228041,0.0011719207,0.00013773146,0.8506799,0.039005313,0.047517523,0.0541397,0.000121794284],"about_ca_topic_score_codex":0.00043289407,"about_ca_topic_score_gemma":0.0003561346,"teacher_disagreement_score":0.0034926976,"about_ca_system_score_codex":0.00033657686,"about_ca_system_score_gemma":0.00033077147,"threshold_uncertainty_score":0.011684179},"labels":[],"label_agreement":null},{"id":"W1523796837","doi":"10.1007/978-3-642-11842-5_73","title":"A Hybrid Particle Swarm Optimization Algorithm Based on Space Transformation Search and a Modified Velocity Model","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Multi-swarm optimization; Computer science; Mathematical optimization; Transformation (genetics); Local optimum; Metaheuristic; Algorithm; Mathematics","score_opus":0.026336877777956808,"score_gpt":0.2683005472629652,"score_spread":0.2419636694850084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523796837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008213335,0.00023354564,0.9859848,0.000088521265,0.00022901382,0.00006642974,0.000026947351,0.0003162061,0.004841124],"genre_scores_gemma":[0.28087398,0.00038493372,0.70622563,0.00016116741,0.00017763721,0.000539894,0.0001928274,0.00017394357,0.011270022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997305,0.00006133791,0.000015331316,0.000047186146,0.00012612923,0.000019454506],"domain_scores_gemma":[0.9997421,0.00008992388,0.000023707236,0.00003282349,0.00009045595,0.000021039832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005540396,0.0007488596,0.0013007666,0.0006133298,0.00058150716,0.0009921934,0.0015398837,0.0017306587,0.0026531655],"category_scores_gemma":[0.0009307957,0.00043456277,0.0007553275,0.0011766982,0.00045620586,0.0011529536,0.00096221303,0.0008034586,0.00074570236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014991501,0.00012815696,0.0004517984,0.00012631528,0.00010826949,0.00011109915,0.00007707644,0.79207885,0.006385512,0.023200465,0.0032046349,0.17397791],"study_design_scores_gemma":[0.000020260908,0.000029677069,0.00005611421,0.0000028261684,0.000008992326,0.000016362372,0.0000030406477,0.99777263,0.00033202954,0.00079471065,0.00095713424,0.0000062479353],"about_ca_topic_score_codex":0.0038478186,"about_ca_topic_score_gemma":0.0029928018,"teacher_disagreement_score":0.0038478186,"about_ca_system_score_codex":0.0004207629,"about_ca_system_score_gemma":0.0006455871,"threshold_uncertainty_score":0.008875668},"labels":[],"label_agreement":null},{"id":"W1524160437","doi":"10.1007/978-3-642-01085-9_17","title":"PSO_Bounds: A New Hybridization Technique of PSO and EDAs","year":2009,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"EDAS; Estimation of distribution algorithm; Particle swarm optimization; Benchmark (surveying); Mathematical optimization; Computer science; Population; Artificial intelligence; Mathematics; Geography; Medicine","score_opus":0.1090581124548539,"score_gpt":0.3856699672446664,"score_spread":0.2766118547898125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524160437","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015185458,0.0012721784,0.985637,0.00023031681,0.00041934772,0.000035936537,0.000052627787,0.0012407923,0.009593149],"genre_scores_gemma":[0.07210506,0.0019807322,0.90824705,0.00044076733,0.00042051132,0.00019452101,0.00034450504,0.00094139687,0.015325515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989133,0.00019307178,0.000067970184,0.00014230656,0.000620996,0.00006235154],"domain_scores_gemma":[0.9991726,0.00038563818,0.00006276511,0.00012009603,0.00020874728,0.000050011415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010456777,0.0010562137,0.0015897093,0.0013148116,0.00050979946,0.0019613963,0.0021309564,0.0015290638,0.007467921],"category_scores_gemma":[0.0032409502,0.0006851364,0.0010448925,0.002169383,0.00060630625,0.0021349916,0.0020531367,0.0029023725,0.0032400417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024488854,0.00017708057,0.00048053297,0.00043739713,0.00020780317,0.00013733562,0.00009096742,0.20287119,0.011650995,0.06479563,0.018748919,0.70015734],"study_design_scores_gemma":[0.000049116177,0.00009893461,0.00026717645,0.00006464708,0.000056410285,0.0001713702,0.000017183896,0.927181,0.0052143806,0.0175423,0.049294114,0.000043465454],"about_ca_topic_score_codex":0.0018220588,"about_ca_topic_score_gemma":0.0019409105,"teacher_disagreement_score":0.007467921,"about_ca_system_score_codex":0.0005282668,"about_ca_system_score_gemma":0.0008471616,"threshold_uncertainty_score":0.02498269},"labels":[],"label_agreement":null},{"id":"W1529419995","doi":"10.1109/cec.2005.1555019","title":"Evolution Strategies with Adaptively Rescaled Mutation Vectors","year":2005,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mutation; Computer science; Artificial intelligence; Biology; Genetics","score_opus":0.015755516664548438,"score_gpt":0.263580395690554,"score_spread":0.24782487902600558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529419995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051713075,0.00042889715,0.94387096,0.00016902776,0.00008291223,0.00020058574,0.000028781875,0.0005641619,0.0029415637],"genre_scores_gemma":[0.55982375,0.0003297881,0.43600914,0.00021036126,0.0000413556,0.00050109555,0.00007851246,0.00013633516,0.0028695967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991486,0.00035175576,0.000097326025,0.00015810627,0.0001874876,0.000056745735],"domain_scores_gemma":[0.99788755,0.001153617,0.00026295616,0.00031125938,0.00032029505,0.00006424696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017315346,0.0007640706,0.0008215028,0.0010247924,0.00026309883,0.0007087272,0.0013448341,0.0011969906,0.0016817774],"category_scores_gemma":[0.008855437,0.00033848698,0.00050543103,0.0006881403,0.00073440035,0.0014273104,0.00089812547,0.000904998,0.00050016685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001316472,0.00016079622,0.0014210382,0.00012915584,0.00014609979,0.0002547356,0.00028352355,0.7274329,0.028073337,0.044645447,0.0012910425,0.19603017],"study_design_scores_gemma":[0.00006341992,0.00017748363,0.00020449563,0.000017032618,0.000030327898,0.00010401554,0.000018259187,0.9836826,0.0047828173,0.009234789,0.0016599951,0.000024692854],"about_ca_topic_score_codex":0.0007492351,"about_ca_topic_score_gemma":0.0006729609,"teacher_disagreement_score":0.0017315346,"about_ca_system_score_codex":0.00050238887,"about_ca_system_score_gemma":0.0004284516,"threshold_uncertainty_score":0.0091573},"labels":[],"label_agreement":null},{"id":"W1531223525","doi":"10.1007/3-540-45105-6_11","title":"Revisiting Elitism in Ant Colony Optimization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Travelling salesman problem; Ant colony optimization algorithms; Mathematical optimization; Computer science; Ant colony; Extremal optimization; Artificial intelligence; Metaheuristic; Mathematics; Meta-optimization","score_opus":0.02164736604405561,"score_gpt":0.2762496322912347,"score_spread":0.25460226624717913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531223525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009803157,0.02824006,0.86327136,0.0072997687,0.003675125,0.000066634355,0.000055573182,0.00024814915,0.0873401],"genre_scores_gemma":[0.45908335,0.03771,0.4420137,0.0045991875,0.006285393,0.0002771321,0.000109496854,0.0010249787,0.048896715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975223,0.0010772556,0.0001259097,0.00024636788,0.0008969637,0.0001311223],"domain_scores_gemma":[0.99480045,0.0039223037,0.0002375847,0.00034968596,0.0006190174,0.000071040544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00398603,0.0013859886,0.0013174841,0.001110962,0.0012146583,0.003620304,0.0034110977,0.002333669,0.004179506],"category_scores_gemma":[0.017739108,0.0006936226,0.0009871264,0.0023693736,0.0048592016,0.006702597,0.0027848724,0.006127092,0.0015809513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071462615,0.00011562913,0.0005737138,0.00063214294,0.00007115849,0.0001624317,0.0006134441,0.1191176,0.00084994634,0.68227714,0.009174157,0.18634117],"study_design_scores_gemma":[0.000042301468,0.0000659223,0.00022952644,0.0003306888,0.000039505372,0.00012468881,0.00016169775,0.17839946,0.0010310346,0.77949744,0.040043544,0.000034226567],"about_ca_topic_score_codex":0.0021564933,"about_ca_topic_score_gemma":0.0029998033,"teacher_disagreement_score":0.004179506,"about_ca_system_score_codex":0.0015619961,"about_ca_system_score_gemma":0.0013082151,"threshold_uncertainty_score":0.021080375},"labels":[],"label_agreement":null},{"id":"W1551741615","doi":"10.1007/3-540-45724-0_28","title":"Using Genetic Algorithms to Optimize ACS-TSP","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Genetic algorithm; Ant colony optimization algorithms; Algorithm; Variable (mathematics); Ant colony; Travelling salesman problem; Population-based incremental learning; Mathematical optimization; Machine learning; Mathematics","score_opus":0.05726925925110299,"score_gpt":0.3053369914652968,"score_spread":0.24806773221419381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551741615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093366526,0.0014747146,0.8525985,0.0004114477,0.0003651386,0.00014530723,0.000095261916,0.0013635778,0.05017962],"genre_scores_gemma":[0.46770686,0.0007009792,0.5212255,0.00017194297,0.0001024291,0.00016466416,0.00016067065,0.00035756128,0.009409347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997707,0.000066022905,0.000008145905,0.000024369234,0.00010242742,0.00002838887],"domain_scores_gemma":[0.999734,0.00013368404,0.000026187305,0.000030316305,0.000065212625,0.000010611943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005188548,0.0006442076,0.0006188561,0.0007765912,0.00039385425,0.00083925953,0.00088491704,0.0010828417,0.002403787],"category_scores_gemma":[0.0017567731,0.00036673236,0.00054758,0.0015287459,0.00046558862,0.00073621905,0.00046566647,0.00082358776,0.00045827992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004641194,0.000053221647,0.0002506944,0.00006064028,0.00003461944,0.0000466115,0.000031794676,0.9047716,0.0030045812,0.0134448875,0.0015827958,0.0766722],"study_design_scores_gemma":[0.00001533384,0.000032734883,0.00007870391,0.000006482697,0.000016494438,0.000017580085,0.000008889776,0.99169296,0.00097146246,0.005367676,0.001788009,0.0000036260467],"about_ca_topic_score_codex":0.0039298353,"about_ca_topic_score_gemma":0.0051105907,"teacher_disagreement_score":0.0039298353,"about_ca_system_score_codex":0.0006399524,"about_ca_system_score_gemma":0.0007828138,"threshold_uncertainty_score":0.008041501},"labels":[],"label_agreement":null},{"id":"W1552110283","doi":"10.1007/978-3-642-13495-1_8","title":"A New Particle Swarm Optimization Algorithm and Its Numerical Analysis","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Position (finance); Metaheuristic; Computer science; Mathematical optimization; Current (fluid); Algorithm; Swarm behaviour; Derivative-free optimization; Imperialist competitive algorithm; Particle (ecology); Mathematics; Physics","score_opus":0.018230710757319944,"score_gpt":0.2749722324822797,"score_spread":0.25674152172495973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552110283","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033567278,0.00083071366,0.98957026,0.00016894203,0.00030262888,0.000036839097,0.000023738448,0.00012470268,0.005585462],"genre_scores_gemma":[0.13923503,0.002231136,0.8389801,0.00021597653,0.00046677075,0.00035280324,0.00015540251,0.00025781844,0.018104918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962664,0.00009804573,0.000018408075,0.00003921663,0.00020160913,0.000016143124],"domain_scores_gemma":[0.9990416,0.00054741884,0.00005360882,0.00008222077,0.00024820332,0.000026887501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010002981,0.0007813367,0.0008275006,0.00082458544,0.0005350604,0.0012097642,0.00095594866,0.0018571492,0.0038272094],"category_scores_gemma":[0.003538947,0.00041590672,0.0007484829,0.0015028163,0.00084526476,0.0018750546,0.00090666115,0.001474687,0.0008958827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001109199,0.000077026976,0.0006513044,0.0002812024,0.00007242055,0.00016148372,0.00012301776,0.6607338,0.0033774052,0.14418635,0.007588129,0.18263686],"study_design_scores_gemma":[0.000005675847,0.000015801708,0.00006790986,0.0000059919803,0.000005705702,0.00003753036,0.0000041104904,0.9909156,0.0002414219,0.006656823,0.002037965,0.0000054297134],"about_ca_topic_score_codex":0.0017403506,"about_ca_topic_score_gemma":0.0011060644,"teacher_disagreement_score":0.0038272094,"about_ca_system_score_codex":0.0004227069,"about_ca_system_score_gemma":0.0005228865,"threshold_uncertainty_score":0.012803316},"labels":[],"label_agreement":null},{"id":"W1556372911","doi":"10.1007/978-3-540-72393-6_31","title":"Comparative Studies of Fuzzy Genetic Algorithms","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"China Scholarship Council","keywords":"Crossover; Computer science; Fuzzy logic; Quality control and genetic algorithms; Genetic algorithm; Algorithm; Mutation; Artificial intelligence; Data mining; Machine learning; Meta-optimization","score_opus":0.09541663711369208,"score_gpt":0.36418204513654645,"score_spread":0.26876540802285437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556372911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64168686,0.08426737,0.11955755,0.001431938,0.00042413248,0.00022863576,0.00049878884,0.0002591791,0.15164554],"genre_scores_gemma":[0.9513605,0.008265787,0.036697567,0.00006686893,0.000074952375,0.000047486497,0.00022305398,0.000044538192,0.003219224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767524,0.0011735529,0.000075072334,0.0001283574,0.00084522576,0.00010261435],"domain_scores_gemma":[0.98449254,0.01280588,0.00030069175,0.00051546673,0.001751876,0.00013359732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004814966,0.00067138084,0.00085038337,0.003964401,0.0006745299,0.002154771,0.0015013688,0.0011449396,0.0042993594],"category_scores_gemma":[0.020581778,0.00016502327,0.00058835273,0.0052962424,0.0007947948,0.0018460213,0.0005765873,0.0005404889,0.00028287398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024391674,0.00059975364,0.009412442,0.0017060676,0.00068651617,0.00019221562,0.00065191614,0.26821008,0.0027861188,0.16226146,0.004514552,0.5465397],"study_design_scores_gemma":[0.00035115777,0.0026916293,0.024385534,0.0010121748,0.0013146176,0.00066593185,0.002487019,0.80830413,0.013114577,0.119079605,0.026471006,0.00012262895],"about_ca_topic_score_codex":0.0044440613,"about_ca_topic_score_gemma":0.0036892076,"teacher_disagreement_score":0.004814966,"about_ca_system_score_codex":0.0018518048,"about_ca_system_score_gemma":0.0007687924,"threshold_uncertainty_score":0.025464296},"labels":[],"label_agreement":null},{"id":"W1561620206","doi":"10.1007/978-3-642-13059-5_19","title":"Automatic Parameter Settings for the PROAFTN Classifier Using Hybrid Particle Swarm Optimization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Computer science; Metaheuristic; Classifier (UML); Artificial intelligence; Machine learning; Mathematical optimization; Data mining; Mathematics","score_opus":0.03951532335552556,"score_gpt":0.2955625530182069,"score_spread":0.25604722966268134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561620206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018186495,0.0005024247,0.9733459,0.00024257449,0.00023560034,0.00019619809,0.00013989935,0.0032063697,0.0039445227],"genre_scores_gemma":[0.28806555,0.0002718339,0.7046282,0.00029764115,0.000111796224,0.0004790052,0.00069971493,0.0007145101,0.0047317594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930143,0.0001396243,0.000061168605,0.00018822149,0.00022997029,0.00007967253],"domain_scores_gemma":[0.9988298,0.00046413293,0.00008644397,0.00012575963,0.0004533398,0.00004062605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021029485,0.0013562049,0.0015050382,0.0011924119,0.00094019104,0.002218506,0.0017825884,0.002103312,0.0046726414],"category_scores_gemma":[0.006465073,0.00074849324,0.00064044085,0.0007720285,0.00042982286,0.0018273375,0.0012269077,0.002244354,0.0027322748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038088328,0.00015752304,0.0014533261,0.00015140467,0.000057101908,0.000074137475,0.000091707996,0.1415279,0.01295955,0.0034544119,0.010140401,0.82955176],"study_design_scores_gemma":[0.000021337579,0.000024975654,0.00028637119,0.000018536271,0.000011939268,0.000028366838,0.00001602844,0.9927598,0.0039164834,0.0014817581,0.0014254728,0.000008939387],"about_ca_topic_score_codex":0.00414814,"about_ca_topic_score_gemma":0.005203354,"teacher_disagreement_score":0.0046726414,"about_ca_system_score_codex":0.0009588201,"about_ca_system_score_gemma":0.0012417944,"threshold_uncertainty_score":0.015631557},"labels":[],"label_agreement":null},{"id":"W1562612762","doi":"","title":"A New Dimension Division Scheme for Heterogeneous Multi-Population Cultural Algorithm","year":2014,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Dimension (graph theory); Benchmark (surveying); Division (mathematics); Schema (genetic algorithms); Computer science; Population; Convergence (economics); Algorithm; Division algorithm; Mathematical optimization; Mathematics; Theoretical computer science; Machine learning; Arithmetic; Combinatorics","score_opus":0.07994331202295402,"score_gpt":0.39861437697497754,"score_spread":0.3186710649520235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562612762","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025533844,0.0002969703,0.96858126,0.00015528785,0.0000809834,0.00011915137,0.00006063966,0.00029255726,0.004879253],"genre_scores_gemma":[0.27637503,0.00021991447,0.7193812,0.00024685924,0.000056941382,0.00044975168,0.00024076436,0.00008793756,0.0029415449],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926764,0.00025624293,0.00005067983,0.00011780223,0.00023512893,0.00007250037],"domain_scores_gemma":[0.99922705,0.00021002929,0.000073003146,0.00019480541,0.00022874189,0.00006637067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010927307,0.000512058,0.0005724268,0.0008226,0.00064923306,0.0010727374,0.0012928193,0.0007954555,0.0021804941],"category_scores_gemma":[0.0028912893,0.0001970976,0.0005816033,0.0010033236,0.0006243748,0.0014095684,0.0014524596,0.0012739659,0.00047960092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019644889,0.00021583408,0.0028740247,0.00012242715,0.00010795856,0.00010970417,0.0004433187,0.38863912,0.02544612,0.06754454,0.005436705,0.5088638],"study_design_scores_gemma":[0.00006174619,0.0001285732,0.0005464596,0.000023776915,0.000026762364,0.000127173,0.00007238681,0.97050595,0.0054902285,0.013053993,0.009934344,0.000028651784],"about_ca_topic_score_codex":0.0015168382,"about_ca_topic_score_gemma":0.0015081464,"teacher_disagreement_score":0.0021804941,"about_ca_system_score_codex":0.0006752872,"about_ca_system_score_gemma":0.0008791396,"threshold_uncertainty_score":0.007294476},"labels":[],"label_agreement":null},{"id":"W1563997662","doi":"10.1007/11513575_12","title":"Optimal Weighted Recombination","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Recombination; Computer science; Truncation (statistics); Selection (genetic algorithm); Mathematical optimization; Algorithm; Adaptation (eye); Mathematics; Artificial intelligence; Physics; Genetics; Machine learning; Biology; Gene","score_opus":0.02024485215873753,"score_gpt":0.27399965642453433,"score_spread":0.2537548042657968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563997662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009809604,0.001899777,0.8564956,0.00030966857,0.0004996594,0.000100866135,0.00017533766,0.00067320414,0.13003623],"genre_scores_gemma":[0.23448001,0.0018795605,0.56912434,0.00045400663,0.00028992843,0.0003010845,0.00089545676,0.0012238497,0.19135185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994862,0.00012417127,0.00001485847,0.00013328533,0.00017682646,0.00006458412],"domain_scores_gemma":[0.99973875,0.0000772102,0.000021388054,0.000084926774,0.000054831118,0.000022903314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006953756,0.00083440426,0.000987306,0.0009476267,0.0007083522,0.0015232387,0.0014124446,0.0012906262,0.027928641],"category_scores_gemma":[0.0016476389,0.00046862548,0.0008092321,0.0011321607,0.0006738087,0.0014931756,0.0017008367,0.0014540504,0.005946679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002112915,0.00016869677,0.00020496463,0.0002756268,0.00008794262,0.000091592665,0.00010438307,0.08642157,0.01612505,0.44300538,0.02923318,0.42407042],"study_design_scores_gemma":[0.00007764794,0.00014479841,0.00041431808,0.00013434516,0.000083317274,0.00042756475,0.00006394751,0.4782429,0.015118039,0.39815193,0.10709481,0.000046401885],"about_ca_topic_score_codex":0.00034654833,"about_ca_topic_score_gemma":0.0004782061,"teacher_disagreement_score":0.027928641,"about_ca_system_score_codex":0.000553854,"about_ca_system_score_gemma":0.00050468725,"threshold_uncertainty_score":0.09343064},"labels":[],"label_agreement":null},{"id":"W1568790063","doi":"10.1007/3-540-32391-0_103","title":"Multiple Cooperating Swarms for Non-Linear Function Optimization","year":2007,"lang":"en","type":"book-chapter","venue":"Advances in soft computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Particle swarm optimization; Swarm behaviour; Mathematical optimization; Synchronization (alternating current); Function (biology); Computer science; Mathematics; Computer network; Biology","score_opus":0.03660101500167154,"score_gpt":0.32551047250892634,"score_spread":0.28890945750725483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568790063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010703464,0.0033293432,0.9696777,0.00018864404,0.00029675668,0.000032652093,0.000014295025,0.0002185156,0.015538606],"genre_scores_gemma":[0.36460125,0.0030172174,0.5965978,0.00019417008,0.0003657494,0.00027438675,0.000110332374,0.00022720102,0.03461202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998373,0.000057104655,0.000008264088,0.000020866504,0.00006540616,0.000011057434],"domain_scores_gemma":[0.99980956,0.00011823494,0.000011775483,0.000027230497,0.000024221245,0.000009000498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037518438,0.00070175197,0.0008158618,0.00028498354,0.00034160985,0.0005577052,0.000978902,0.000937554,0.0028238397],"category_scores_gemma":[0.00073040766,0.00032358916,0.00047504395,0.0006189358,0.0004477591,0.0007033833,0.00087339885,0.0010887639,0.0006938094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006350645,0.000085965774,0.0002159566,0.00020472212,0.00009361615,0.00014724882,0.00013155755,0.64514416,0.010152498,0.06546222,0.0073126643,0.27098593],"study_design_scores_gemma":[0.0000105693525,0.00003904339,0.00006569495,0.000011747304,0.000010141576,0.00006487375,0.000011361233,0.9757289,0.00084696827,0.018564122,0.0046402286,0.0000064341807],"about_ca_topic_score_codex":0.0003290843,"about_ca_topic_score_gemma":0.00059622765,"teacher_disagreement_score":0.0028238397,"about_ca_system_score_codex":0.00021525256,"about_ca_system_score_gemma":0.00015505849,"threshold_uncertainty_score":0.009446681},"labels":[],"label_agreement":null},{"id":"W1576789214","doi":"10.1109/cec.2015.7257038","title":"A class of representations for evolving graphs","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Maximization; Benchmark (surveying); Representation (politics); Generative model; Mathematics; Function (biology); Graph; Enhanced Data Rates for GSM Evolution; Combinatorics; Parametrization (atmospheric modeling); Mathematical optimization; Theoretical computer science; Computer science; Discrete mathematics; Artificial intelligence; Generative grammar","score_opus":0.08648537132976239,"score_gpt":0.36113437954305805,"score_spread":0.27464900821329563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576789214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033649355,0.0003501284,0.95752573,0.00042003047,0.00004901259,0.00010397837,0.00030682894,0.00048784597,0.007107045],"genre_scores_gemma":[0.5950189,0.0009231106,0.39148512,0.00039728323,0.000110254674,0.000712091,0.001407777,0.0004945638,0.0094509395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990984,0.00031436238,0.00005460205,0.00020075914,0.00025718164,0.00007479761],"domain_scores_gemma":[0.9968765,0.0017144838,0.00036080356,0.00065473357,0.0002783722,0.00011513743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013361163,0.0006858302,0.0005699171,0.0010104578,0.00048551205,0.0016496764,0.0014597914,0.0015145895,0.0036693874],"category_scores_gemma":[0.0116560375,0.00028244714,0.0009948835,0.0012682708,0.0010179781,0.0034982236,0.0012551718,0.00200816,0.0006280204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007725539,0.000081418395,0.001046888,0.0001575798,0.00003364895,0.0001004871,0.00021201363,0.38968876,0.004102588,0.48260254,0.0037128131,0.1181839],"study_design_scores_gemma":[0.000019722864,0.00011622599,0.0003860398,0.000044299144,0.000014872244,0.00016315213,0.000060578175,0.7250301,0.001513643,0.26429814,0.008329424,0.000023793446],"about_ca_topic_score_codex":0.0010022036,"about_ca_topic_score_gemma":0.00074781664,"teacher_disagreement_score":0.0036693874,"about_ca_system_score_codex":0.0012824574,"about_ca_system_score_gemma":0.00062614767,"threshold_uncertainty_score":0.012275279},"labels":[],"label_agreement":null},{"id":"W1580329799","doi":"10.1109/cec.2015.7256970","title":"Leaders and followers &amp;#x2014; A new metaheuristic to avoid the bias of accumulated information","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Metaheuristic; Particle swarm optimization; Differential evolution; Modal; Computer science; Mathematical optimization; Identification (biology); Random search; Range (aeronautics); Local search (optimization); Artificial intelligence; Algorithm; Mathematics; Engineering","score_opus":0.21876350847403217,"score_gpt":0.35251166408431184,"score_spread":0.13374815561027967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580329799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05776056,0.00031237004,0.93666625,0.00043973062,0.000105899955,0.000103426864,0.000035963705,0.0002917994,0.0042839553],"genre_scores_gemma":[0.59274906,0.00020718103,0.39962846,0.00036987683,0.000083814826,0.00035414225,0.00007853576,0.00007884208,0.006450064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996654,0.00011432377,0.000014416245,0.0000530139,0.00012238731,0.00003046458],"domain_scores_gemma":[0.9993104,0.00033531792,0.000112007656,0.00007973542,0.00012264513,0.000039863546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090087444,0.00037488315,0.0004257709,0.0006251789,0.00038595247,0.00061433023,0.00088547077,0.0008146771,0.0009368378],"category_scores_gemma":[0.0019505416,0.0002120517,0.00045939218,0.0003746822,0.0005359583,0.000731503,0.0006987346,0.00071677996,0.00015620666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018248499,0.0002119782,0.0025608595,0.0001493279,0.0002022606,0.00020688219,0.00032819086,0.6695481,0.028136697,0.073764354,0.0042551393,0.22045377],"study_design_scores_gemma":[0.00005113414,0.00012235143,0.00019243955,0.000011214718,0.000022264474,0.00005326219,0.000017035702,0.987007,0.0034052646,0.006352032,0.00275719,0.000008739339],"about_ca_topic_score_codex":0.001030035,"about_ca_topic_score_gemma":0.0016610752,"teacher_disagreement_score":0.001030035,"about_ca_system_score_codex":0.000441961,"about_ca_system_score_gemma":0.00087512156,"threshold_uncertainty_score":0.004764378},"labels":[],"label_agreement":null},{"id":"W1581676142","doi":"10.1007/978-3-540-75396-4_13","title":"On the Design of Large-scale Cellular Mobile Networks Using Multi-population Memetic Algorithms","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Memetic algorithm; Heuristic; Mathematical optimization; Computer science; Population; Convergence (economics); Scale (ratio); Local search (optimization); Combinatorial optimization; Algorithm; Mathematics","score_opus":0.18861212868658073,"score_gpt":0.384034373441075,"score_spread":0.19542224475449427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581676142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010597718,0.000976673,0.9737551,0.0002755463,0.00010232365,0.00006042251,0.000022827855,0.0001749232,0.014034481],"genre_scores_gemma":[0.62715346,0.002346293,0.35586166,0.0003256154,0.00017148125,0.00046594327,0.00008074987,0.00019139805,0.013403428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985695,0.000058070378,0.000005565059,0.000022848773,0.000040689556,0.000015807424],"domain_scores_gemma":[0.99962234,0.00026831194,0.000023607321,0.00002205112,0.000050904113,0.000012829669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005674087,0.0006891178,0.00072722696,0.00048018183,0.00056845887,0.0011297716,0.0011354657,0.0010965745,0.0024538087],"category_scores_gemma":[0.001812356,0.00041946772,0.00056720595,0.00064014917,0.0007766012,0.00091854186,0.000870793,0.00078614743,0.00034391668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015054182,0.000012787289,0.000079704776,0.000042996595,0.000019822233,0.000032584332,0.000033210654,0.96046287,0.00097463874,0.016457967,0.0010691371,0.0207992],"study_design_scores_gemma":[0.0000065044824,0.000011875704,0.000023570403,0.000006787214,0.000005951143,0.000012509864,0.000006851481,0.99122006,0.0002586663,0.0073199375,0.001124316,0.00000304126],"about_ca_topic_score_codex":0.0020999617,"about_ca_topic_score_gemma":0.002460617,"teacher_disagreement_score":0.0024538087,"about_ca_system_score_codex":0.0006550858,"about_ca_system_score_gemma":0.000503142,"threshold_uncertainty_score":0.008208811},"labels":[],"label_agreement":null},{"id":"W1583203589","doi":"10.3233/his-140198","title":"Recentering and restarting a genetic algorithm using a generative representation for an ordered gene problem1","year":2014,"lang":"en","type":"article","venue":"International Journal of Hybrid Intelligent Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Brock University","keywords":"Generative grammar; Computer science; Representation (politics); Genetic algorithm; Artificial intelligence; Generative model; Algorithm; Theoretical computer science; Machine learning","score_opus":0.07319674962700776,"score_gpt":0.3568253381792253,"score_spread":0.2836285885522175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583203589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11437113,0.00035500468,0.8757101,0.00036864053,0.000102530365,0.00017091075,0.000038257516,0.00051787926,0.008365524],"genre_scores_gemma":[0.55911016,0.00025413051,0.43454808,0.00017726117,0.000050276758,0.00019382428,0.00013546339,0.00019964213,0.005331137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999315,0.0003206055,0.000027528898,0.000087578475,0.00016848142,0.00008078879],"domain_scores_gemma":[0.99750865,0.0017201107,0.00014266836,0.0002965741,0.0002474618,0.000084519976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002120962,0.0010012878,0.0008071839,0.0009944069,0.0008899655,0.001090632,0.0020817441,0.0021116734,0.0019753953],"category_scores_gemma":[0.0050712214,0.0004468096,0.0012510539,0.0010426944,0.0017891617,0.001001793,0.001001323,0.001665132,0.0003208475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006180338,0.0000774888,0.0006085125,0.000031271007,0.000026004529,0.00010842302,0.00013635356,0.9317619,0.0025945685,0.02402957,0.0005207622,0.04004326],"study_design_scores_gemma":[0.000016273178,0.00006055186,0.000081449194,0.0000062339686,0.000011430604,0.000032269818,0.000013978636,0.9928589,0.0010395638,0.005098395,0.00077030616,0.000010663237],"about_ca_topic_score_codex":0.005918967,"about_ca_topic_score_gemma":0.006005272,"teacher_disagreement_score":0.005918967,"about_ca_system_score_codex":0.001208937,"about_ca_system_score_gemma":0.0010439159,"threshold_uncertainty_score":0.011769056},"labels":[],"label_agreement":null},{"id":"W1588619826","doi":"10.1007/978-3-540-70829-2_7","title":"Improving the Exploration Ability of Ant-Based Algorithms","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ant colony optimization algorithms; Travelling salesman problem; Opposition (politics); Mathematical optimization; Computer science; Algorithm; Local optimum; Artificial intelligence; Mathematics","score_opus":0.18745058216046437,"score_gpt":0.37816971902844815,"score_spread":0.19071913686798378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1588619826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13934746,0.0092212865,0.7560345,0.00087157014,0.0004917459,0.000088544526,0.00008435902,0.0019514288,0.091909155],"genre_scores_gemma":[0.71326804,0.0046045366,0.25928205,0.00028058776,0.00021520922,0.000076830765,0.00014398091,0.00051154825,0.021617183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997472,0.00006155081,0.000011502162,0.000027706825,0.0001242525,0.00002769137],"domain_scores_gemma":[0.9991941,0.0004981896,0.000037807105,0.00009279174,0.00015108341,0.00002613854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040660874,0.0005684467,0.0005106805,0.00042230898,0.00028995372,0.00088939205,0.00072381936,0.0007255642,0.0035963422],"category_scores_gemma":[0.0023036036,0.00022676493,0.0003077915,0.0007957049,0.00038909927,0.0014352669,0.0007846446,0.00096929376,0.00095485355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020313387,0.00015784246,0.0006810043,0.00039945167,0.000072313866,0.000096595795,0.00022712693,0.3455079,0.029282317,0.052246645,0.006960903,0.5641648],"study_design_scores_gemma":[0.000041438056,0.00015216517,0.00033867217,0.00003969655,0.000045812398,0.00015180194,0.000031293257,0.9507891,0.011377252,0.026015228,0.011002446,0.000015070417],"about_ca_topic_score_codex":0.0006051657,"about_ca_topic_score_gemma":0.0007683515,"teacher_disagreement_score":0.0035963422,"about_ca_system_score_codex":0.00017932181,"about_ca_system_score_gemma":0.00030821818,"threshold_uncertainty_score":0.012030959},"labels":[],"label_agreement":null},{"id":"W1592436817","doi":"10.1609/aaai.v24i1.7555","title":"Single-Frontier Bidirectional Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Frontier; Node (physics); Computer science; Tree (set theory); Shortest path problem; Path (computing); Task (project management); Current (fluid); Search algorithm; Range (aeronautics); Bidirectional search; Mathematical optimization; Algorithm; Theoretical computer science; Incremental heuristic search; Mathematics; Beam search; Engineering; Graph; Computer network; Geography","score_opus":0.09925960070521146,"score_gpt":0.3189109092959158,"score_spread":0.21965130859070436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592436817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023850359,0.0008491463,0.9511526,0.00033482802,0.000089463516,0.00011379235,0.00015419761,0.0011091407,0.022346362],"genre_scores_gemma":[0.38393933,0.00075529004,0.60055596,0.00030442252,0.000043483113,0.0003433906,0.00041696418,0.00036149414,0.013279695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950516,0.00012816432,0.000021457763,0.00009594295,0.00017407455,0.00007525731],"domain_scores_gemma":[0.9993444,0.00028773028,0.000049248985,0.00013628812,0.00013082784,0.000051500636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083953515,0.0007482116,0.00095385837,0.00075615646,0.0007213569,0.0011728191,0.0013885101,0.0010952705,0.008919152],"category_scores_gemma":[0.002531376,0.0003994971,0.0006537931,0.00094873516,0.0008302124,0.0018971052,0.0020024364,0.00091667345,0.0017643706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042106552,0.00017070783,0.0017019092,0.0004773464,0.00009892719,0.00018869793,0.00031628154,0.27503562,0.0122086955,0.18807827,0.009847488,0.51145494],"study_design_scores_gemma":[0.00009313229,0.00020063041,0.0002824511,0.00007752767,0.00004192296,0.00021261445,0.00013248915,0.85661125,0.0044496823,0.11589178,0.02197375,0.00003277989],"about_ca_topic_score_codex":0.0021876425,"about_ca_topic_score_gemma":0.003057305,"teacher_disagreement_score":0.008919152,"about_ca_system_score_codex":0.0005564611,"about_ca_system_score_gemma":0.0014437952,"threshold_uncertainty_score":0.029837549},"labels":[],"label_agreement":null},{"id":"W1605171964","doi":"","title":"Adapting heterogeneous ensembles with particle swarm optimization for video face recognition","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Particle swarm optimization; Machine learning; Facial recognition system; Biometrics; Artificial neural network; Hyperparameter; Process (computing); Matching (statistics); Pattern recognition (psychology)","score_opus":0.06262017676944999,"score_gpt":0.28945245454091584,"score_spread":0.22683227777146586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605171964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0474621,0.0005799266,0.9491832,0.00021047161,0.00010151385,0.000053440246,0.00003035516,0.0001941981,0.0021847277],"genre_scores_gemma":[0.8534644,0.00039793356,0.14305905,0.00015966358,0.00008955991,0.00020020438,0.00014977764,0.00004667562,0.0024327058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999744,0.00008012081,0.000013461256,0.00006407202,0.00006147401,0.00003682973],"domain_scores_gemma":[0.9993591,0.00036544606,0.000073511146,0.00004114422,0.0001241698,0.000036667298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008841458,0.0010751786,0.0011506742,0.00048505227,0.00037411685,0.0008450517,0.0009846076,0.0009910841,0.00075267436],"category_scores_gemma":[0.0023029451,0.00047335544,0.00084435556,0.00038784771,0.00056796847,0.0005815551,0.00095274526,0.0008665122,0.00017592228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025420919,0.000023642511,0.0004068612,0.000017251565,0.000027775133,0.000021571861,0.000024926738,0.98336375,0.0007383087,0.0015905988,0.00026045248,0.013499552],"study_design_scores_gemma":[0.0000015664448,0.0000065321283,0.000029917745,8.42486e-7,0.0000014445568,0.0000012523805,0.0000017666921,0.9995988,0.000054105574,0.00025645865,0.000046248242,0.0000010519561],"about_ca_topic_score_codex":0.007044747,"about_ca_topic_score_gemma":0.0038954015,"teacher_disagreement_score":0.007044747,"about_ca_system_score_codex":0.0006374561,"about_ca_system_score_gemma":0.00069474295,"threshold_uncertainty_score":0.014007449},"labels":[],"label_agreement":null},{"id":"W1611901023","doi":"10.1609/aaai.v25i1.7823","title":"The Compressed Differential Heuristic","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Uncompressed video; Heuristic; Computer science; Differential (mechanical device); Compression (physics); State (computer science); Algorithm; Computer engineering; Parallel computing; Computer hardware; Artificial intelligence; Materials science; Engineering","score_opus":0.13452609741838098,"score_gpt":0.3040097206926812,"score_spread":0.1694836232743002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611901023","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078435004,0.002122658,0.87969077,0.0010128262,0.00044825752,0.00052500353,0.00058134156,0.0017315132,0.035452582],"genre_scores_gemma":[0.62653244,0.00092641445,0.35937834,0.00071081077,0.00015418934,0.0005539991,0.0008507827,0.00022744003,0.0106657315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999313,0.0001825353,0.000036121124,0.000092114395,0.0002785455,0.00009772945],"domain_scores_gemma":[0.9986865,0.00079880434,0.00008876454,0.00020083392,0.00016224245,0.00006273218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007327645,0.00070712896,0.0009476123,0.0011526803,0.00048219453,0.0009183664,0.0019092943,0.0010906787,0.0077261482],"category_scores_gemma":[0.003907805,0.00035461108,0.0005013059,0.0011579385,0.0008936045,0.0017189851,0.0017871718,0.0009913179,0.00060221605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050751894,0.00025380062,0.0009213051,0.0004525989,0.00008376207,0.0003759541,0.00020894867,0.55153674,0.005272427,0.059622653,0.009315427,0.3714489],"study_design_scores_gemma":[0.00015616069,0.0002180728,0.00027773526,0.00007130941,0.000042796764,0.00020705794,0.000061874205,0.9558531,0.004124237,0.029930808,0.00902728,0.00002952871],"about_ca_topic_score_codex":0.003034002,"about_ca_topic_score_gemma":0.0028320341,"teacher_disagreement_score":0.0077261482,"about_ca_system_score_codex":0.0011018709,"about_ca_system_score_gemma":0.0017119504,"threshold_uncertainty_score":0.0258466},"labels":[],"label_agreement":null},{"id":"W1676876603","doi":"10.1109/ipdpsw.2015.92","title":"Differential Evolution on a GPGPU: The Influence of Parameters on Speedup and the Quality of Solutions","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Speedup; Computer science; Benchmark (surveying); Crossover; Differential evolution; Curse of dimensionality; Population; Parallel computing; Dimension (graph theory); Quality (philosophy); Function (biology); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Physics","score_opus":0.10246706759718062,"score_gpt":0.34245878983816525,"score_spread":0.23999172224098464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1676876603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7236023,0.0018567821,0.2572455,0.0006010916,0.00009110902,0.00014222173,0.00012566966,0.0006599329,0.015675485],"genre_scores_gemma":[0.9205873,0.00071081717,0.07719116,0.000058943308,0.000012478721,0.00009543677,0.00010024941,0.00009498405,0.0011487181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994746,0.00020184065,0.000021840513,0.00006808014,0.0001855555,0.000048173217],"domain_scores_gemma":[0.9980818,0.0014521994,0.00010282156,0.00014453912,0.00018486343,0.000033763103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011204979,0.00048737234,0.0005868498,0.00048086164,0.000306803,0.00078840717,0.00047134171,0.00055093,0.0015064806],"category_scores_gemma":[0.0064577386,0.00021954355,0.00035561554,0.0008804007,0.00062585645,0.0007741433,0.0005046733,0.0007089627,0.00022015563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054337387,0.00019531314,0.007001257,0.000572402,0.00013235224,0.0003479825,0.00031145583,0.68563867,0.097831585,0.018369317,0.0013160387,0.18774028],"study_design_scores_gemma":[0.000069747366,0.0005845369,0.00691648,0.000042970467,0.00006208098,0.0001720444,0.000070419264,0.9387773,0.04190831,0.0070694946,0.004302232,0.000024390873],"about_ca_topic_score_codex":0.0014746898,"about_ca_topic_score_gemma":0.000775173,"teacher_disagreement_score":0.0015064806,"about_ca_system_score_codex":0.0007014477,"about_ca_system_score_gemma":0.00036902248,"threshold_uncertainty_score":0.0059257746},"labels":[],"label_agreement":null},{"id":"W1690153029","doi":"10.1109/cec.2004.1330836","title":"An analysis of evolutionary gradient search","year":2004,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Evolutionary computation; Evolutionary algorithm; Evolution strategy; Random search; Computer science; Function (biology); Human-based evolutionary computation; Evolutionary programming; Genetic algorithm; Gradient method; CMA-ES; Mathematical optimization; Mathematics; Artificial intelligence; Interactive evolutionary computation; Algorithm; Evolutionary biology; Biology","score_opus":0.02695156518853415,"score_gpt":0.3192879974002241,"score_spread":0.29233643221169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1690153029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007966949,0.0066167377,0.92612684,0.0011998544,0.00019204197,0.00006927312,0.000058525387,0.00016941666,0.057600264],"genre_scores_gemma":[0.6733501,0.011553035,0.27715176,0.00081221823,0.0005725347,0.00049430894,0.00022662342,0.0004669698,0.035372443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908936,0.00036462274,0.00003088288,0.000095811905,0.00034676175,0.000072714196],"domain_scores_gemma":[0.998292,0.0011621977,0.00011797996,0.00007453665,0.0003020586,0.000051227504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016674822,0.0008652976,0.000888443,0.0011627764,0.00056379323,0.0015925051,0.000950451,0.0012917258,0.0059202155],"category_scores_gemma":[0.011622357,0.000408472,0.0006026122,0.001462841,0.0013685192,0.0020652441,0.0013758007,0.0013429641,0.0010231381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035388253,0.000019047358,0.00066541316,0.00014261085,0.000057952748,0.00010573821,0.0001188365,0.2670844,0.00061409944,0.6530859,0.0034074353,0.07466324],"study_design_scores_gemma":[0.000011524076,0.000040347804,0.0004888011,0.00007350198,0.000020868085,0.00012192583,0.00003115646,0.7390644,0.00035978638,0.24401268,0.015758654,0.00001630743],"about_ca_topic_score_codex":0.0024444528,"about_ca_topic_score_gemma":0.001216549,"teacher_disagreement_score":0.0059202155,"about_ca_system_score_codex":0.0014157614,"about_ca_system_score_gemma":0.0010019577,"threshold_uncertainty_score":0.019805074},"labels":[],"label_agreement":null},{"id":"W1728818732","doi":"10.5555/2343896.2343920","title":"MO-LOST: adaptive ant trail untangling in multi-objective multi-colony robot foraging","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Foraging; Robot; Computer science; Context (archaeology); Ant colony; Population; Set (abstract data type); Throughput; Dual (grammatical number); Ant colony optimization algorithms; Robot kinematics; Interference (communication); Artificial intelligence; Mobile robot; Ecology; Geography; Biology; Computer network; Telecommunications","score_opus":0.08703283696101467,"score_gpt":0.3321901935187764,"score_spread":0.24515735655776172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1728818732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052638203,0.00041642983,0.94295764,0.0001300042,0.000075547534,0.00008449174,0.000036521604,0.0009662949,0.0026948163],"genre_scores_gemma":[0.6111464,0.00016813634,0.38485968,0.00014526583,0.000032832195,0.00017755688,0.00006985143,0.00019850109,0.0032017059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984956,0.00004840621,0.000007292482,0.000020088006,0.00005386144,0.000020749205],"domain_scores_gemma":[0.99967,0.00014010485,0.000049400485,0.00005376833,0.000051507348,0.00003521599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005211016,0.00046228088,0.0005652043,0.00037145257,0.0003902994,0.0004315266,0.0011316873,0.00056708266,0.0012374428],"category_scores_gemma":[0.0012911987,0.00021843109,0.00035600358,0.00035457948,0.00047396048,0.00055472093,0.0008676742,0.00070466445,0.0002559459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017529528,0.00012760985,0.0017487992,0.00016170643,0.00007870066,0.00015546453,0.00013649536,0.7978085,0.013443085,0.010765983,0.0015432024,0.17385514],"study_design_scores_gemma":[0.00002113981,0.000063249805,0.00014282287,0.0000062770837,0.000006510412,0.000033303328,0.0000068522086,0.9953591,0.0014645271,0.0019037656,0.0009857696,0.000006653599],"about_ca_topic_score_codex":0.0014596281,"about_ca_topic_score_gemma":0.0017824993,"teacher_disagreement_score":0.0014596281,"about_ca_system_score_codex":0.0003321537,"about_ca_system_score_gemma":0.0005412607,"threshold_uncertainty_score":0.004139662},"labels":[],"label_agreement":null},{"id":"W173691115","doi":"","title":"A New Method For Constructing Nonlinear Modular n-Queens Solutions.","year":2006,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modular design; Mathematics; Nonlinear system; Computer science; Programming language; Physics","score_opus":0.023402061188800352,"score_gpt":0.3087845100197513,"score_spread":0.285382448830951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173691115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062313084,0.00021156918,0.97732985,0.000115500174,0.00017622915,0.00014320333,0.00009944714,0.0006182141,0.015074585],"genre_scores_gemma":[0.05552068,0.00019527366,0.9318115,0.00010766094,0.000054076187,0.00029498182,0.0002039701,0.00023853344,0.011573378],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975127,0.000053223222,0.000014904311,0.00005264792,0.00010253254,0.000025463727],"domain_scores_gemma":[0.99974114,0.000098151366,0.000024248777,0.000061574516,0.00004659285,0.000028308274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003813248,0.00081063097,0.0005622596,0.0012538813,0.00074330467,0.0007538964,0.0012223801,0.0006850848,0.012600952],"category_scores_gemma":[0.001572904,0.00038041873,0.00097282004,0.0009950512,0.00068654463,0.0010017301,0.0019978515,0.0010161801,0.002974918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001981816,0.00020647047,0.00066570146,0.0005737255,0.00012385576,0.00022156986,0.00025835482,0.095531315,0.03036176,0.16253142,0.019022997,0.6903047],"study_design_scores_gemma":[0.00018166364,0.00020872141,0.00053329463,0.00013609417,0.00009620804,0.00056827907,0.000111238594,0.76777816,0.01408147,0.14181857,0.074426085,0.000060230548],"about_ca_topic_score_codex":0.00081778865,"about_ca_topic_score_gemma":0.0021741746,"teacher_disagreement_score":0.012600952,"about_ca_system_score_codex":0.00040926773,"about_ca_system_score_gemma":0.00075636146,"threshold_uncertainty_score":0.04215443},"labels":[],"label_agreement":null},{"id":"W174767910","doi":"10.1007/978-81-322-2184-5_7","title":"Analyzing the Behaviour of Multi-recombinative Evolution Strategies Applied to a Conically Constrained Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Infosys science foundation series","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.03022384821143987,"score_gpt":0.30133427765540166,"score_spread":0.2711104294439618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W174767910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7068249,0.0026412779,0.2406469,0.00087922363,0.00011518747,0.00009190134,0.000103045815,0.00022806597,0.04846941],"genre_scores_gemma":[0.9433816,0.00052784354,0.0488348,0.00010279212,0.00002162691,0.000058726233,0.00011182608,0.000109389286,0.0068514356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998254,0.000075886404,0.000005705583,0.0000198509,0.000037775906,0.000035405243],"domain_scores_gemma":[0.9965623,0.003088304,0.000119305856,0.00006195589,0.000109484135,0.000058672646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008803248,0.00059272576,0.0005594613,0.00063440023,0.00039461098,0.0009992155,0.001001098,0.0015760709,0.0031654509],"category_scores_gemma":[0.005151401,0.00030423715,0.00060116604,0.00088801264,0.0007000683,0.0009155548,0.0005813395,0.0010595457,0.00017771412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075185824,0.00007578946,0.00059989945,0.00007569787,0.000032481883,0.00009168374,0.00007053489,0.9638864,0.0023053312,0.017307382,0.0006854471,0.014794135],"study_design_scores_gemma":[0.000004666706,0.000024557165,0.00016997351,0.000005260081,0.0000044519534,0.00001130212,0.000019998773,0.9969452,0.00029595208,0.0023820356,0.00013349099,0.000003049043],"about_ca_topic_score_codex":0.004419404,"about_ca_topic_score_gemma":0.0030740818,"teacher_disagreement_score":0.004419404,"about_ca_system_score_codex":0.00074477453,"about_ca_system_score_gemma":0.0005133809,"threshold_uncertainty_score":0.01058948},"labels":[],"label_agreement":null},{"id":"W1764669605","doi":"10.5281/zenodo.7080765","title":"Invited paper: A Review of Thresheld Convergence","year":2015,"lang":"en","type":"review","venue":"eCite Digital Repository (University of Tasmania)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Convergence (economics); Computer science; Applied mathematics; Mathematics; Economics; Macroeconomics","score_opus":0.04705993929200671,"score_gpt":0.28210217302895435,"score_spread":0.23504223373694763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1764669605","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009566729,0.9935747,0.0005702501,0.002004653,0.0013191244,0.00000717006,0.000022607288,0.000009256544,0.002396557],"genre_scores_gemma":[0.0011430841,0.99345857,0.0005177155,0.0014931401,0.0018338319,0.000016330656,0.00004890027,0.000011777886,0.001476687],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897325,0.00027777103,0.00014378957,0.00018402298,0.0003505453,0.0000706404],"domain_scores_gemma":[0.9954906,0.0023908957,0.00031379258,0.00012046124,0.0014730401,0.00021116418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023260035,0.0010010998,0.0015850781,0.004279125,0.00056747923,0.002289821,0.0018200099,0.0024588162,0.00865999],"category_scores_gemma":[0.008838018,0.00047602307,0.0009102377,0.005511482,0.00122011,0.0039619426,0.0013089953,0.0027357463,0.0068250443],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103942664,0.00007583736,0.00039506156,0.019974671,0.00012525533,0.00028144554,0.00019573928,0.0008500625,0.00042965033,0.018125387,0.1754722,0.7839708],"study_design_scores_gemma":[0.000011574908,0.000058432346,0.0004069632,0.006110503,0.00005839926,0.0008925024,0.00006233523,0.00011569363,0.00020354846,0.0058188974,0.9862366,0.000024649207],"about_ca_topic_score_codex":0.0016169909,"about_ca_topic_score_gemma":0.0020109727,"teacher_disagreement_score":0.00865999,"about_ca_system_score_codex":0.0012904082,"about_ca_system_score_gemma":0.0028196522,"threshold_uncertainty_score":0.02897054},"labels":[],"label_agreement":null},{"id":"W1770820624","doi":"10.1109/cec.2004.1330933","title":"Enhancement of the shifting balance genetic algorithm for highly multimodal problems","year":2004,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Knapsack problem; Genetic algorithm; Computer science; Mathematical optimization; Extension (predicate logic); Population; Balance (ability); Continuous knapsack problem; Function (biology); Mechanism (biology); Algorithm; Machine learning; Mathematics; Biology","score_opus":0.01811963696650311,"score_gpt":0.26752115022537576,"score_spread":0.24940151325887264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1770820624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05045675,0.00021000385,0.94138265,0.00016205941,0.000049461305,0.0000872897,0.000018059502,0.00044416284,0.0071896045],"genre_scores_gemma":[0.5107142,0.00035738372,0.4830271,0.00021528355,0.00006656534,0.00023430912,0.000104757855,0.00015486253,0.005125558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995352,0.0001518678,0.000016045216,0.000046097262,0.000205786,0.000044989498],"domain_scores_gemma":[0.9995117,0.00021980626,0.000043882166,0.00004107377,0.00015533072,0.000028232498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088570407,0.0006162725,0.000495659,0.00069573417,0.0003171908,0.000450768,0.0009726834,0.0008382329,0.0017190065],"category_scores_gemma":[0.0028356372,0.00022366595,0.0003988888,0.0005848185,0.00040820244,0.0006683672,0.0010317292,0.0007182118,0.0003979446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105244064,0.0001328538,0.0013598897,0.000060207673,0.00006060673,0.00017888162,0.00016671883,0.6845823,0.018408002,0.018715883,0.0015726368,0.2746568],"study_design_scores_gemma":[0.000020971993,0.00005777226,0.0002198151,0.0000059866184,0.000012082708,0.000057902987,0.000010168752,0.9914698,0.0021382887,0.0035473502,0.00245343,0.000006407489],"about_ca_topic_score_codex":0.0018989795,"about_ca_topic_score_gemma":0.0016382555,"teacher_disagreement_score":0.0018989795,"about_ca_system_score_codex":0.0003635154,"about_ca_system_score_gemma":0.0007240964,"threshold_uncertainty_score":0.0057505965},"labels":[],"label_agreement":null},{"id":"W1801849579","doi":"10.1016/s0167-739x(00)00043-1","title":"– Ant System","year":2000,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2698,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Travelling salesman problem; Ant colony optimization algorithms; Computer science; Benchmark (surveying); Quadratic assignment problem; Extremal optimization; Mathematical optimization; Parallel metaheuristic; Combinatorial optimization; Metaheuristic; Ant colony; Optimization problem; Artificial intelligence; Algorithm; Meta-optimization; Mathematics","score_opus":0.016814986928085477,"score_gpt":0.23204394409662635,"score_spread":0.21522895716854087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1801849579","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03676422,0.0020388137,0.18650629,0.0013097053,0.0023202787,0.0008883241,0.002745408,0.02016042,0.7472665],"genre_scores_gemma":[0.34938714,0.0017600878,0.19129194,0.001347288,0.000540477,0.00060402224,0.0058568856,0.0019450558,0.44726714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960655,0.00006622361,0.000023655175,0.00009081976,0.00017117312,0.000041585314],"domain_scores_gemma":[0.99965894,0.000033883825,0.000027493763,0.00008198991,0.00015746274,0.000040237923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027201558,0.0006507418,0.0003908795,0.0007576571,0.0008520136,0.0017571009,0.0011669275,0.00085519184,0.04204626],"category_scores_gemma":[0.00090443686,0.0002595831,0.00037282018,0.00076882425,0.00029843807,0.0009418175,0.0009229765,0.0007508033,0.028468518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065750844,0.00036581254,0.0020690823,0.0010271943,0.00013556702,0.00041809506,0.00025835488,0.03680173,0.042958666,0.08431405,0.18537328,0.64562064],"study_design_scores_gemma":[0.000104102204,0.00018512672,0.0011229323,0.00005281956,0.00006106806,0.0005407026,0.000068691435,0.06795353,0.019716041,0.014373581,0.89576364,0.00005771813],"about_ca_topic_score_codex":0.0019967032,"about_ca_topic_score_gemma":0.0022306142,"teacher_disagreement_score":0.04204626,"about_ca_system_score_codex":0.00047491287,"about_ca_system_score_gemma":0.0010040748,"threshold_uncertainty_score":0.14065874},"labels":[],"label_agreement":null},{"id":"W1802369074","doi":"10.1504/ijpse.2015.071426","title":"gpuMF: a framework for parallel hybrid metaheuristics on GPU with application to the minimisation of harmonics in multilevel inverters","year":2015,"lang":"en","type":"article","venue":"International Journal of Process Systems Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Metaheuristic; Computer science; Speedup; Massively parallel; Parallel computing; Graphics processing unit; General-purpose computing on graphics processing units; Graphics; Algorithm","score_opus":0.038730280253787566,"score_gpt":0.31600884068880253,"score_spread":0.277278560435015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802369074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062302384,0.00025309704,0.9870544,0.00010394951,0.000041560237,0.000054659868,0.00010345304,0.0040118764,0.00214686],"genre_scores_gemma":[0.10310458,0.00025638696,0.89333653,0.00009475441,0.00002685287,0.00028686173,0.0002525392,0.0007995366,0.0018419336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977905,0.00006646226,0.000014872976,0.000030389954,0.00007844376,0.000030838248],"domain_scores_gemma":[0.9997688,0.000103037004,0.00002092234,0.000029153722,0.000057312427,0.000020677779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063620514,0.00080414297,0.000751311,0.00056830526,0.00052698015,0.00077732006,0.0017437191,0.0013439812,0.003594108],"category_scores_gemma":[0.0012014162,0.00041799224,0.0011414357,0.0005966622,0.00050404976,0.00070747343,0.00083162286,0.0013369406,0.00061212445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086883396,0.000079288984,0.00077881815,0.00022668639,0.00010003747,0.00016633549,0.00015162275,0.8320057,0.00968005,0.037870087,0.005779387,0.113075115],"study_design_scores_gemma":[0.000023818991,0.000016962267,0.00006112339,0.000011173695,0.0000067735186,0.000027926555,0.000008480062,0.98878795,0.0010957713,0.0045126253,0.005438779,0.000008637608],"about_ca_topic_score_codex":0.0074543543,"about_ca_topic_score_gemma":0.007840284,"teacher_disagreement_score":0.0074543543,"about_ca_system_score_codex":0.0006835499,"about_ca_system_score_gemma":0.0010703793,"threshold_uncertainty_score":0.014821947},"labels":[],"label_agreement":null},{"id":"W1803694054","doi":"10.1007/978-3-540-75396-4_15","title":"Particle Swarm Optimization with Mutation for High Dimensional Problems","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"SavvyDox (Canada)","funders":"","keywords":"Particle swarm optimization; Mathematical optimization; Mutation; Multi-swarm optimization; Computer science; Set (abstract data type); Optimization problem; Artificial neural network; Evolutionary algorithm; Metaheuristic; Operator (biology); Artificial intelligence; Mathematics","score_opus":0.11411252491759621,"score_gpt":0.34737800273483493,"score_spread":0.23326547781723872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803694054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007544246,0.0034233944,0.96872085,0.00040264902,0.00052702014,0.000055670447,0.000022710292,0.0003146801,0.018988729],"genre_scores_gemma":[0.2023804,0.0045012725,0.75463635,0.00029227178,0.0005390131,0.00035971784,0.00011225735,0.00031285512,0.036865834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997768,0.000065421096,0.000009250968,0.000020406715,0.000117441494,0.000010731883],"domain_scores_gemma":[0.99973077,0.00016567542,0.000013305825,0.000032556007,0.000048367332,0.000009269829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054680655,0.0008349861,0.00085636234,0.0004027155,0.00039339217,0.0007592063,0.00084626,0.0010846499,0.0030823746],"category_scores_gemma":[0.0016853862,0.0002987005,0.0004908567,0.0009110846,0.00074385246,0.0008931648,0.00076718495,0.0016370573,0.00078121194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069730944,0.00009577168,0.00022636651,0.00033423485,0.0000777557,0.0001579267,0.0001515648,0.549938,0.0061980844,0.12708569,0.01487013,0.3007948],"study_design_scores_gemma":[0.000022175711,0.00004382236,0.00011436528,0.000024788742,0.000014961997,0.000062140316,0.000012521202,0.9576306,0.0011060681,0.031165816,0.009793886,0.0000089088535],"about_ca_topic_score_codex":0.0012142349,"about_ca_topic_score_gemma":0.001028547,"teacher_disagreement_score":0.0030823746,"about_ca_system_score_codex":0.00034402835,"about_ca_system_score_gemma":0.00035199473,"threshold_uncertainty_score":0.010311544},"labels":[],"label_agreement":null},{"id":"W1805834402","doi":"10.1007/978-3-540-73007-1_124","title":"Hybrid Unsupervised/Supervised Virtual Reality Spaces for Visualizing Cancer Databases: An Evolutionary Computation Approach","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Classifier (UML); Artificial intelligence; Machine learning; Cluster analysis; Data mining; Knowledge extraction","score_opus":0.1003301340051558,"score_gpt":0.36815997418564805,"score_spread":0.2678298401804923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1805834402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019701952,0.00023384434,0.97745967,0.00016938602,0.00001843548,0.000044938544,0.00008245883,0.0005303209,0.0017590085],"genre_scores_gemma":[0.28621602,0.00028490194,0.71091235,0.000100899444,0.00002992925,0.00013858758,0.00017077854,0.0002109447,0.0019356046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955004,0.00017950508,0.000021428543,0.000077898636,0.0001262823,0.000044728946],"domain_scores_gemma":[0.99912375,0.00050011853,0.000068303976,0.000102305705,0.00015524364,0.000050377934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010812058,0.0009265239,0.0010638422,0.0014612137,0.00058522355,0.0025981204,0.002058626,0.0012807632,0.002168413],"category_scores_gemma":[0.0023230298,0.0006569032,0.0013745229,0.0014498885,0.00073607534,0.0016148692,0.0017801921,0.0008967966,0.00038018762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017041231,0.000117460586,0.0009154827,0.0001301993,0.00011669799,0.0001330716,0.00030302198,0.79787225,0.009396418,0.027153559,0.0019609989,0.1617305],"study_design_scores_gemma":[0.000004846044,0.000011371918,0.000086742955,0.000005403487,0.000006235155,0.00003349662,0.000027872007,0.9940276,0.0012177144,0.0041466127,0.0004248397,0.0000072639787],"about_ca_topic_score_codex":0.0033117302,"about_ca_topic_score_gemma":0.004645028,"teacher_disagreement_score":0.0033117302,"about_ca_system_score_codex":0.0007365254,"about_ca_system_score_gemma":0.00063483935,"threshold_uncertainty_score":0.007254064},"labels":[],"label_agreement":null},{"id":"W1810526953","doi":"10.1007/978-3-540-76931-6_2","title":"Analyzing the Role of “Smart” Start Points in Coarse Search-Greedy Search","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Computer science; Memetic algorithm; Point (geometry); Greedy algorithm; Domain (mathematical analysis); Local search (optimization); Process (computing); Mathematics","score_opus":0.038195848875386566,"score_gpt":0.3025436831775436,"score_spread":0.264347834302157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810526953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28075796,0.0014738963,0.69286656,0.0009825426,0.00012473998,0.00011728087,0.0001136063,0.00064795243,0.022915527],"genre_scores_gemma":[0.9262504,0.00024820364,0.070518576,0.00013585722,0.00003421,0.00006219439,0.00008175642,0.00018324789,0.0024856427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892056,0.00052238454,0.000027975671,0.00011977925,0.00021763232,0.00019167065],"domain_scores_gemma":[0.9837105,0.01384198,0.0005889515,0.00083922147,0.0005906581,0.00042869453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003090942,0.0007163699,0.0011366707,0.0010192028,0.00072973414,0.0014566719,0.0015701611,0.0015831573,0.0036070393],"category_scores_gemma":[0.024602238,0.00068621297,0.00063041673,0.0011296286,0.0019859304,0.0028644293,0.0016705403,0.0015608922,0.00031553526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000367752,0.000090321286,0.0017708859,0.000114345494,0.000060973092,0.00006885424,0.00013045197,0.8869555,0.0011940121,0.08596465,0.0015562573,0.021725912],"study_design_scores_gemma":[0.00002956092,0.000050588762,0.000320635,0.000013130933,0.000018793164,0.000015985399,0.000038250113,0.96418834,0.00047232045,0.034597095,0.00024591744,0.000009349024],"about_ca_topic_score_codex":0.0044278167,"about_ca_topic_score_gemma":0.0050731516,"teacher_disagreement_score":0.0044278167,"about_ca_system_score_codex":0.001432656,"about_ca_system_score_gemma":0.0019437317,"threshold_uncertainty_score":0.016346693},"labels":[],"label_agreement":null},{"id":"W1820106783","doi":"10.1007/978-3-642-00267-0_3","title":"The Evolutionary-Gradient-Search Procedure in Theory and Practice","year":2009,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Evolutionary algorithm; Computer science; Inverse; Mathematical optimization; Artificial intelligence; Mathematics; Algorithm","score_opus":0.08754761877130322,"score_gpt":0.40931156537023544,"score_spread":0.3217639465989322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1820106783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011233042,0.020970933,0.9101761,0.0023822128,0.0010139237,0.00006221742,0.00005603742,0.00033018235,0.06388519],"genre_scores_gemma":[0.097234644,0.018558973,0.848393,0.0015458666,0.0010250845,0.00043011623,0.00013549265,0.00053661666,0.032140225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851686,0.00080762967,0.00007202286,0.00016957616,0.0003751384,0.000058705362],"domain_scores_gemma":[0.9988912,0.00077056995,0.000037806316,0.00016349228,0.000113224916,0.00002380938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026180309,0.0011886328,0.001392362,0.0011955947,0.000678787,0.0027204924,0.0018959127,0.0029729104,0.0066880696],"category_scores_gemma":[0.0060398364,0.00059857237,0.0007766944,0.002839835,0.0058775763,0.0031703492,0.0015778608,0.004303305,0.003233182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013391537,0.000017790055,0.000095292664,0.00017648237,0.000021115859,0.00003520916,0.000108517655,0.011198187,0.00017975648,0.9012232,0.009201737,0.077729344],"study_design_scores_gemma":[0.00002127515,0.000029204133,0.00012039373,0.00017422103,0.000016592316,0.00014616862,0.00004630852,0.046069346,0.00047317782,0.8814136,0.0714666,0.000023050829],"about_ca_topic_score_codex":0.0014264991,"about_ca_topic_score_gemma":0.0011293332,"teacher_disagreement_score":0.0066880696,"about_ca_system_score_codex":0.0011307682,"about_ca_system_score_gemma":0.0014622088,"threshold_uncertainty_score":0.022373796},"labels":[],"label_agreement":null},{"id":"W1835894572","doi":"10.1109/ccece.2002.1013043","title":"Enhancing the particle swarm optimizer via proper parameters selection","year":2003,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Particle swarm optimization; Range (aeronautics); Mathematical optimization; Selection (genetic algorithm); Swarm intelligence; Computer science; Swarm behaviour; Multi-swarm optimization; Process (computing); Metaheuristic; Algorithm; Mathematics; Artificial intelligence; Engineering","score_opus":0.025822136232708577,"score_gpt":0.26812461032439533,"score_spread":0.24230247409168676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835894572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018315956,0.00042868065,0.9771627,0.0001622712,0.00007141851,0.00014297936,0.000018285968,0.0007219172,0.0029757684],"genre_scores_gemma":[0.34320197,0.0008171573,0.65333176,0.00014943605,0.00008783191,0.0003578803,0.00007917551,0.00032425384,0.0016505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991296,0.0003612776,0.00007230043,0.000098248245,0.00029380864,0.00004472561],"domain_scores_gemma":[0.9980691,0.0011058289,0.00019452233,0.00023177618,0.00036565756,0.000033171338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00203624,0.0013309967,0.0010255846,0.0007927,0.00035952733,0.0010426879,0.0008064658,0.0014861326,0.00093410246],"category_scores_gemma":[0.009598386,0.00052660104,0.00046389876,0.000655329,0.0005257186,0.0013644944,0.0007058441,0.0011152385,0.00079063367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026055332,0.00022147445,0.002222889,0.00036805475,0.00010804719,0.00035502057,0.0003309482,0.57936406,0.042162735,0.009380511,0.0024297351,0.36279598],"study_design_scores_gemma":[0.00006403478,0.00016378869,0.00073459133,0.00003598372,0.000059545695,0.00024056307,0.000036406145,0.9731909,0.017272597,0.0027115713,0.0054507037,0.000039278857],"about_ca_topic_score_codex":0.0008903701,"about_ca_topic_score_gemma":0.00068751624,"teacher_disagreement_score":0.00203624,"about_ca_system_score_codex":0.00023323012,"about_ca_system_score_gemma":0.0004892264,"threshold_uncertainty_score":0.010768831},"labels":[],"label_agreement":null},{"id":"W1859892029","doi":"10.1023/a:1011409029226","title":"Keep–Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in","year":2001,"lang":"en","type":"article","venue":"Constraints","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Kwantlen Polytechnic University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Selection (genetic algorithm); Fitness proportionate selection; Population; Offspring; Computer science; Operator (biology); Genetic algorithm; Mathematical optimization; Evolutionary biology; Biology; Machine learning; Mathematics; Genetics; Demography; Sociology","score_opus":0.029087930865425562,"score_gpt":0.2622588816988172,"score_spread":0.23317095083339168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859892029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21151751,0.0006591404,0.76806194,0.0009667762,0.00007699509,0.000093223796,0.00006511869,0.00022543158,0.018333841],"genre_scores_gemma":[0.87460893,0.00022189908,0.116550684,0.00019637377,0.000044208024,0.000100206125,0.000075139156,0.00019637265,0.008006203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996376,0.00017347395,0.000008463734,0.000045850175,0.00007806439,0.000056514426],"domain_scores_gemma":[0.9988638,0.0006047562,0.00012969165,0.0001422892,0.00013827028,0.00012126024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010433184,0.000404067,0.00059448817,0.0004903472,0.0010645397,0.0010372299,0.0018053177,0.001175887,0.0037591816],"category_scores_gemma":[0.004699931,0.0002257284,0.0004599706,0.00077720085,0.0010082124,0.0017901497,0.0011711987,0.00084359996,0.00037658025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003400307,0.00018930975,0.0046428223,0.0001492176,0.00025876847,0.0007963852,0.0009969745,0.62571746,0.01237184,0.18125841,0.010205286,0.1630734],"study_design_scores_gemma":[0.000050134426,0.00018345128,0.00091884326,0.000020495869,0.00006996714,0.00029552932,0.0002884877,0.9516412,0.002915741,0.038071804,0.0055101505,0.000034227887],"about_ca_topic_score_codex":0.0021978144,"about_ca_topic_score_gemma":0.00403807,"teacher_disagreement_score":0.0037591816,"about_ca_system_score_codex":0.0005185026,"about_ca_system_score_gemma":0.00062559225,"threshold_uncertainty_score":0.012575686},"labels":[],"label_agreement":null},{"id":"W191909571","doi":"10.1007/978-3-642-27534-0_7","title":"Investigating a Measure of the Recombinational Distance Traversed by the Genetic Algorithm","year":2012,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Unary operation; Measure (data warehouse); Algorithm; Set (abstract data type); Operator (biology); Function (biology); Population; Genetic algorithm; Computer science; Replicate; Binary number; Recombination; Mathematics; Mathematical optimization; Theoretical computer science; Data mining; Discrete mathematics; Biology; Statistics; Genetics; Arithmetic","score_opus":0.10173530705018209,"score_gpt":0.33894018647456564,"score_spread":0.23720487942438356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191909571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2004026,0.0068816897,0.76709694,0.0010063982,0.00019599078,0.000055877827,0.00009453248,0.0003130568,0.023952872],"genre_scores_gemma":[0.7798953,0.0015298474,0.21380617,0.0001436218,0.00011918048,0.000070019036,0.00014448426,0.00024451007,0.0040468434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978364,0.00091739534,0.000093351395,0.00033290562,0.0006880022,0.00013192471],"domain_scores_gemma":[0.9839999,0.012738306,0.00092396,0.0007636349,0.0013134343,0.0002607612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003173586,0.00060379656,0.00061058707,0.0021000088,0.0007042989,0.0032777805,0.0019308967,0.0019211391,0.0022576184],"category_scores_gemma":[0.027680703,0.00035279428,0.00051474705,0.0028439888,0.0021688826,0.0054117385,0.0010419149,0.0017376239,0.0003599687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004777577,0.0002251385,0.007363438,0.000539447,0.0001850784,0.00027626587,0.0010403084,0.26447234,0.022846213,0.51604635,0.0017434119,0.18478422],"study_design_scores_gemma":[0.00004119941,0.00044263477,0.004701936,0.0001290659,0.00010751307,0.000563325,0.00049174397,0.7973847,0.010492248,0.1803063,0.0052580405,0.0000812541],"about_ca_topic_score_codex":0.0013346634,"about_ca_topic_score_gemma":0.000846052,"teacher_disagreement_score":0.0032777805,"about_ca_system_score_codex":0.0016616374,"about_ca_system_score_gemma":0.0006263995,"threshold_uncertainty_score":0.016783774},"labels":[],"label_agreement":null},{"id":"W194959742","doi":"10.1007/978-3-319-06483-3_36","title":"Heterogeneous Multi-Population Cultural Algorithm with a Dynamic Dimension Decomposition Strategy","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Benchmark (surveying); Dimension (graph theory); Computer science; Decomposition; Population; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01824106933648329,"score_gpt":0.2962817787374648,"score_spread":0.2780407094009815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194959742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038615834,0.00033357617,0.9488304,0.00019275746,0.00013959476,0.000067281435,0.000036655747,0.00015898283,0.011624835],"genre_scores_gemma":[0.507836,0.0002845755,0.48132154,0.0002572782,0.00009971869,0.00043020133,0.00015527496,0.000117999276,0.009497519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954563,0.00019351006,0.000018542989,0.000072314666,0.00011300148,0.000056946188],"domain_scores_gemma":[0.9994715,0.0002374574,0.000045282297,0.00007558895,0.00011221197,0.00005795584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077118515,0.0007257087,0.0008340239,0.00082170335,0.00080816826,0.0011791274,0.0014910813,0.0011873947,0.0027999657],"category_scores_gemma":[0.0019105705,0.0003355115,0.0008811363,0.0010306848,0.0007412395,0.0009591175,0.0022699751,0.00097576686,0.00043831897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013452514,0.00014165876,0.00074203504,0.00009352837,0.0001504462,0.00011850366,0.00015834557,0.79936,0.0065763798,0.0660426,0.003052131,0.12342988],"study_design_scores_gemma":[0.000023208926,0.000036779842,0.000084254236,0.000008005811,0.000017796767,0.000033354307,0.000018358895,0.9929026,0.00061284244,0.0053437403,0.0009107405,0.000008383005],"about_ca_topic_score_codex":0.0013526685,"about_ca_topic_score_gemma":0.0012469479,"teacher_disagreement_score":0.0027999657,"about_ca_system_score_codex":0.00062901777,"about_ca_system_score_gemma":0.0006705789,"threshold_uncertainty_score":0.00936681},"labels":[],"label_agreement":null},{"id":"W1963521172","doi":"10.1115/ipc2008-64410","title":"Fuel Optimization Using Biologically-Inspired Computational Models","year":2008,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"TransCanada (Canada); University of Calgary","funders":"","keywords":"Computer science; Fuel efficiency; Particle swarm optimization; Pipeline (software); Mathematical optimization; Set (abstract data type); Optimization problem; Engineering; Algorithm; Mathematics","score_opus":0.12207240953058614,"score_gpt":0.3034342312988801,"score_spread":0.18136182176829396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963521172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03483208,0.0005106603,0.9468049,0.00047104078,0.00006856246,0.000059995178,0.00010856691,0.0002517472,0.016892483],"genre_scores_gemma":[0.6524794,0.001121675,0.3368103,0.00020737528,0.000066964196,0.0004929836,0.0002181747,0.00012512467,0.008477938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998876,0.00003238935,0.0000044027615,0.000019446989,0.000046194145,0.000009851533],"domain_scores_gemma":[0.99973077,0.00017734992,0.000029945873,0.000021671327,0.000029662408,0.000010666538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027765188,0.0005761264,0.00047336606,0.0004734331,0.0004068478,0.00084608793,0.0009776726,0.00090444204,0.001566941],"category_scores_gemma":[0.0010190294,0.00033274572,0.000659339,0.00042069028,0.0006161641,0.00068281457,0.00064109033,0.0006335872,0.00021081531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004615618,0.0000065321537,0.000109031535,0.00001532525,0.0000076513315,0.000015759893,0.0000096581425,0.9874126,0.00057760766,0.0080069015,0.00012523196,0.0037090946],"study_design_scores_gemma":[0.0000026915543,0.0000041114477,0.00002426172,0.0000023633622,0.000002254579,0.000005046198,0.0000028579564,0.9965215,0.00017551833,0.002714832,0.0005427422,0.0000018843823],"about_ca_topic_score_codex":0.0037287485,"about_ca_topic_score_gemma":0.0036042538,"teacher_disagreement_score":0.0037287485,"about_ca_system_score_codex":0.00079137844,"about_ca_system_score_gemma":0.0007337197,"threshold_uncertainty_score":0.0074141026},"labels":[],"label_agreement":null},{"id":"W1964465571","doi":"10.1016/j.asoc.2014.04.018","title":"Improved global-best particle swarm optimization algorithm with mixed-attribute data classification capability","year":2014,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Particle swarm optimization; Computer science; Multi-swarm optimization; Algorithm; Metaheuristic; Data mining; Mathematical optimization; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.0402902922792972,"score_gpt":0.29176492415386873,"score_spread":0.25147463187457153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964465571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031162329,0.00043729093,0.9654363,0.00020946062,0.0001321882,0.00005548714,0.00005348807,0.0005662787,0.0019472433],"genre_scores_gemma":[0.40496472,0.00024739784,0.5896902,0.00020624943,0.00012408131,0.00022574572,0.00032823512,0.000121703175,0.0040916936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989452,0.00023861916,0.00009421307,0.0002492315,0.0003816911,0.00009118287],"domain_scores_gemma":[0.9989674,0.00034203453,0.00007061022,0.0001492673,0.00041496922,0.000055614895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017864548,0.0010884503,0.0022536223,0.0013630034,0.00097496115,0.0017014408,0.0021378135,0.0017902061,0.0013454176],"category_scores_gemma":[0.0029759223,0.00062506186,0.0012818835,0.0020555728,0.0005903769,0.0016210782,0.0015618979,0.0012962185,0.00043085456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039669793,0.00027179497,0.0021928465,0.00013263003,0.00025536647,0.000121755176,0.00013580454,0.6391126,0.0049118837,0.007186598,0.004199891,0.34108213],"study_design_scores_gemma":[0.000013792419,0.000020194888,0.00012269543,0.0000021684443,0.00001041913,0.0000142621375,0.0000045716097,0.9985587,0.00042174768,0.00062440365,0.0002029042,0.0000041820304],"about_ca_topic_score_codex":0.0056362776,"about_ca_topic_score_gemma":0.003646879,"teacher_disagreement_score":0.0056362776,"about_ca_system_score_codex":0.0006572301,"about_ca_system_score_gemma":0.001350167,"threshold_uncertainty_score":0.011206925},"labels":[],"label_agreement":null},{"id":"W1964649011","doi":"10.1145/1068009.1068050","title":"Factors governing the behavior of multiple cooperating swarms","year":2005,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmark (surveying); Computer science; Swarm behaviour; Synchronization (alternating current); Distributed computing; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.05847962861320025,"score_gpt":0.30615081089765783,"score_spread":0.24767118228445759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964649011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9592145,0.00043450555,0.030105473,0.00032656422,0.00003186363,0.000078979305,0.000018419689,0.00009839178,0.009691279],"genre_scores_gemma":[0.99608177,0.00010899618,0.0031123797,0.000023497472,0.000010070356,0.000022671056,0.0000132352525,0.000014224264,0.00061307463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893457,0.00036300402,0.000073029536,0.00016850627,0.00029880292,0.0001621282],"domain_scores_gemma":[0.9940795,0.0030320801,0.0012952441,0.00037327458,0.0006668779,0.00055312755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001907397,0.00042871697,0.0006040372,0.0006279043,0.0008692158,0.0016823594,0.0007017001,0.0006827664,0.0015300243],"category_scores_gemma":[0.0129109165,0.00037806638,0.00026767544,0.00032282007,0.0010588771,0.0012930046,0.0008929142,0.00051875866,0.0003471637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010304409,0.00060433394,0.19309294,0.00082330935,0.0006691839,0.0050459816,0.0052434015,0.33655846,0.27636883,0.05806337,0.002525739,0.11997397],"study_design_scores_gemma":[0.00035532395,0.0022550004,0.1333541,0.00019249057,0.0005591918,0.0042539365,0.006551346,0.7459277,0.04811155,0.040261913,0.017870326,0.00030714087],"about_ca_topic_score_codex":0.0014470057,"about_ca_topic_score_gemma":0.0013148291,"teacher_disagreement_score":0.001907397,"about_ca_system_score_codex":0.0006079684,"about_ca_system_score_gemma":0.0006339031,"threshold_uncertainty_score":0.010087371},"labels":[],"label_agreement":null},{"id":"W1965210196","doi":"10.1108/17427371011066383","title":"Intelligent learning agent for collaborative virtual workspace","year":2010,"lang":"en","type":"article","venue":"International Journal of Pervasive Computing and Communications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Workspace; Reinforcement learning; Human–computer interaction; Architecture; Intelligent agent; Originality; Artificial intelligence; Robot","score_opus":0.04465470724219504,"score_gpt":0.36766452904383473,"score_spread":0.3230098218016397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965210196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02217894,0.0003026764,0.9677729,0.0003003241,0.000060046837,0.0001440167,0.000039101848,0.0016599081,0.007542116],"genre_scores_gemma":[0.45865038,0.00022666155,0.53243285,0.00016403163,0.000027864016,0.0002528742,0.00010853882,0.00006149879,0.00807528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995766,0.00013806316,0.000026290649,0.00008586421,0.00013423848,0.000038758695],"domain_scores_gemma":[0.9994771,0.0001505801,0.00007417613,0.00011228154,0.00012705039,0.000058879676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049707486,0.00032047572,0.00031076837,0.00024757846,0.00046666985,0.00092908705,0.0012113918,0.0008848154,0.0027031037],"category_scores_gemma":[0.0014971836,0.00013396435,0.00027088227,0.0002087097,0.0005032454,0.0010464829,0.0010368208,0.00071369496,0.0009302469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005180842,0.0006298108,0.0035872555,0.00054977805,0.00012324007,0.0009377072,0.0008837908,0.27481794,0.052869458,0.13825904,0.009883328,0.5169406],"study_design_scores_gemma":[0.00007928577,0.00030391992,0.0006861444,0.00007870169,0.000049641512,0.00069309503,0.00011921129,0.8938704,0.0282131,0.032563213,0.043294765,0.000048485184],"about_ca_topic_score_codex":0.0010401123,"about_ca_topic_score_gemma":0.00095849903,"teacher_disagreement_score":0.0027031037,"about_ca_system_score_codex":0.0003905197,"about_ca_system_score_gemma":0.00076800084,"threshold_uncertainty_score":0.0090427995},"labels":[],"label_agreement":null},{"id":"W1966076063","doi":"10.5539/jmr.v4n4p81","title":"Similarity Form, Similarity Variational Element and Similarity Solution to (2+1) Dimensional Breaking Solition Equation","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Similarity (geometry); Similarity solution; Partial differential equation; Element (criminal law); Mathematical analysis; Burgers' equation; Applied mathematics; Law; Computer science; Artificial intelligence; Physics","score_opus":0.17058280712304255,"score_gpt":0.40661304280702126,"score_spread":0.2360302356839787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966076063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12148687,0.0013467037,0.8307004,0.0014274905,0.0004002616,0.00014803397,0.00010112537,0.0001276779,0.044261396],"genre_scores_gemma":[0.8588405,0.00093453587,0.10483443,0.00047337916,0.0002924283,0.00016654405,0.00016716082,0.00011648136,0.034174476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.000090085094,0.000026817565,0.00006792674,0.00014937068,0.000053350086],"domain_scores_gemma":[0.9997414,0.00005790761,0.000039629038,0.000030327748,0.0000824172,0.000048281614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064455456,0.00046364014,0.0005986916,0.00069671747,0.0007923707,0.0007980688,0.0010413815,0.0010378729,0.0033458646],"category_scores_gemma":[0.0016966228,0.00021907098,0.0009415587,0.00044768245,0.0015358472,0.0021631813,0.0019008006,0.0013660092,0.00035624192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027556953,0.000027609829,0.0007314136,0.00009268552,0.000021705786,0.00021270465,0.00029478892,0.01809335,0.0070259543,0.9593974,0.0011563284,0.012918568],"study_design_scores_gemma":[0.000034311808,0.00008337504,0.0007063458,0.00002434088,0.000016621072,0.0004929508,0.00020780534,0.31819075,0.0029383749,0.6698262,0.0074352724,0.000043665048],"about_ca_topic_score_codex":0.0015041126,"about_ca_topic_score_gemma":0.0007944661,"teacher_disagreement_score":0.0033458646,"about_ca_system_score_codex":0.0006289602,"about_ca_system_score_gemma":0.0008407968,"threshold_uncertainty_score":0.011193097},"labels":[],"label_agreement":null},{"id":"W1966725634","doi":"10.1145/1370256.1370260","title":"A bioinspired algorithm to price options","year":2008,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Computer science; Binomial options pricing model; Ant colony optimization algorithms; Mathematical optimization; Heuristic; Valuation of options; Algorithm; Finance; Economics; Artificial intelligence; Mathematics","score_opus":0.04023007675289864,"score_gpt":0.2890739934956034,"score_spread":0.24884391674270478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966725634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058661993,0.00016252125,0.9862896,0.000269205,0.00012632062,0.00008974514,0.000035792098,0.0005493893,0.00661133],"genre_scores_gemma":[0.08852127,0.00018514914,0.90446013,0.00022212535,0.000046779427,0.00031739342,0.00012425597,0.00013693834,0.0059860167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996697,0.000068997615,0.00002423278,0.000085173066,0.00011995988,0.000031951018],"domain_scores_gemma":[0.9995111,0.00024080323,0.00003974976,0.000056661447,0.000117174495,0.000034448807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086758577,0.000585859,0.00057468674,0.00091680797,0.0007017874,0.0011534233,0.0016810937,0.0019162867,0.0075073116],"category_scores_gemma":[0.0029422839,0.00039609004,0.0007439712,0.0008243274,0.0010495656,0.0011447791,0.0011329089,0.0010587283,0.001404094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012845099,0.00014435497,0.0011673872,0.00019876855,0.00009198803,0.00019760747,0.00021313316,0.4802758,0.0066940854,0.15785255,0.008512706,0.3445231],"study_design_scores_gemma":[0.000043209602,0.000043305474,0.000068790374,0.000020456506,0.0000106359685,0.00008410499,0.000016793156,0.9585648,0.00091946626,0.031866014,0.008352955,0.000009447358],"about_ca_topic_score_codex":0.0017188854,"about_ca_topic_score_gemma":0.0018998374,"teacher_disagreement_score":0.0075073116,"about_ca_system_score_codex":0.0007862737,"about_ca_system_score_gemma":0.0011169657,"threshold_uncertainty_score":0.025114477},"labels":[],"label_agreement":null},{"id":"W1967756118","doi":"10.1007/s10957-004-0943-z","title":"Analysis of Random Restart and Iterated Improvement for Global Optimization with Application to the Traveling Salesman Problem","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Travelling salesman problem; Mathematics; Iterated function; Theory of computation; A priori and a posteriori; Convergence (economics); Speedup; Mathematical optimization; Combinatorics; Rate of convergence; Applied mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.007913086695719185,"score_gpt":0.2766126644019262,"score_spread":0.26869957770620706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967756118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05928116,0.0046111187,0.91701573,0.0005479911,0.00015671575,0.00015696151,0.000045306722,0.00046640603,0.01771854],"genre_scores_gemma":[0.8206485,0.0017405871,0.16881144,0.00021598059,0.00025855337,0.00025381983,0.000100416364,0.00053660735,0.007434041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979504,0.001058936,0.00006806961,0.00019601663,0.00049546664,0.0002311875],"domain_scores_gemma":[0.98196685,0.014918365,0.0008280771,0.0006566328,0.0013882414,0.0002419136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00669921,0.0016706215,0.002391674,0.0019233045,0.0008871112,0.0018303223,0.0027372842,0.0019170109,0.003836888],"category_scores_gemma":[0.021149961,0.00082268065,0.0019421135,0.0013583933,0.0020098027,0.0029842856,0.0015074628,0.0020783907,0.00029994643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017350008,0.00011201772,0.00058031484,0.00015548115,0.0001156975,0.000104479324,0.00008945809,0.9041658,0.00070720207,0.06735164,0.0012073157,0.025237134],"study_design_scores_gemma":[0.0000061842943,0.00003090694,0.00008747379,0.0000065058184,0.000018420524,0.000012047122,0.000006019567,0.9954217,0.00010634951,0.0041347565,0.00016505762,0.000004691666],"about_ca_topic_score_codex":0.0048472127,"about_ca_topic_score_gemma":0.0039303023,"teacher_disagreement_score":0.00669921,"about_ca_system_score_codex":0.0018161503,"about_ca_system_score_gemma":0.0019785753,"threshold_uncertainty_score":0.03542918},"labels":[],"label_agreement":null},{"id":"W1970542049","doi":"10.1109/ccece.2012.6334976","title":"Center-point-based Simulated Annealing","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Simulated annealing; Computer science; Algorithm; Mathematical optimization; Metaheuristic; Local optimum; Adaptive simulated annealing; Benchmark (surveying); Curse of dimensionality; Center (category theory); Convergence (economics); Point (geometry); Mathematics; Artificial intelligence","score_opus":0.032179011542871755,"score_gpt":0.30372800627111723,"score_spread":0.27154899472824545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970542049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023216272,0.0004101854,0.9679565,0.00013111594,0.00006861874,0.00014323431,0.000038863505,0.00055540254,0.0074798116],"genre_scores_gemma":[0.5552513,0.0005017695,0.4381327,0.00017537919,0.000039154787,0.00061709166,0.00015086729,0.00015780523,0.0049739038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990914,0.00036855298,0.000037880094,0.00017574207,0.00025315204,0.00007321158],"domain_scores_gemma":[0.9991823,0.00034200356,0.00008379531,0.00015738541,0.00020625847,0.000028116807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092010404,0.00072710915,0.0013922004,0.0008118164,0.00069642643,0.00089035573,0.0019200862,0.0015228065,0.0020238862],"category_scores_gemma":[0.0027822582,0.0005373432,0.0012170607,0.0010818791,0.0011002341,0.00094422174,0.0010501822,0.0010769105,0.00054874824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011650478,0.00005034457,0.00058234285,0.00010129315,0.00008338714,0.000049473187,0.00013481877,0.9135276,0.006362651,0.024857467,0.001225004,0.052909136],"study_design_scores_gemma":[0.00002326111,0.000059598886,0.000096852644,0.000009253063,0.000011872525,0.00001990524,0.00001031432,0.99107575,0.0020195518,0.004340187,0.0023232666,0.000010106376],"about_ca_topic_score_codex":0.0034464577,"about_ca_topic_score_gemma":0.0024460205,"teacher_disagreement_score":0.0034464577,"about_ca_system_score_codex":0.001228659,"about_ca_system_score_gemma":0.0012198752,"threshold_uncertainty_score":0.00891459},"labels":[],"label_agreement":null},{"id":"W1971035609","doi":"10.1109/cec.2007.4424846","title":"Cryptanalysis of Pointcheval&amp;#x2019;s identification scheme using ant colony optimization","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Ant colony optimization algorithms; Cryptanalysis; Scheme (mathematics); Identification (biology); Identification scheme; Computer science; Binary number; Ant colony; Cryptography; Algorithm; Data mining; Mathematics; Arithmetic","score_opus":0.05457023489829093,"score_gpt":0.3553378603244654,"score_spread":0.30076762542617447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971035609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42224553,0.0002794179,0.5666044,0.001259222,0.00011243357,0.00021888844,0.000074989606,0.0006740226,0.008531095],"genre_scores_gemma":[0.9295194,0.000061387924,0.06800706,0.00010144233,0.000010079703,0.000039432674,0.00003575549,0.000015506559,0.0022099358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.0005204472,0.00005699324,0.00016609936,0.0006393624,0.0001603117],"domain_scores_gemma":[0.998522,0.00062172883,0.00022709512,0.00033436867,0.00023464873,0.000060256913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013956904,0.00037923778,0.00072104036,0.0006575289,0.0006571756,0.000777818,0.0007806055,0.0011128522,0.001234668],"category_scores_gemma":[0.003312958,0.00016172396,0.00046220535,0.0005762022,0.0012348949,0.0011414129,0.0008184513,0.0008978825,0.00024776405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019779082,0.00053310674,0.004715058,0.00018252639,0.00024564096,0.0006987093,0.00031643026,0.5257207,0.07259749,0.14079316,0.00402431,0.24819495],"study_design_scores_gemma":[0.000058917438,0.00022844205,0.0003988902,0.000008512125,0.000013575212,0.00021696654,0.000019273706,0.96060336,0.028738828,0.0087761795,0.0009194887,0.000017641652],"about_ca_topic_score_codex":0.0010179247,"about_ca_topic_score_gemma":0.00084509124,"teacher_disagreement_score":0.0013956904,"about_ca_system_score_codex":0.000905419,"about_ca_system_score_gemma":0.0011096157,"threshold_uncertainty_score":0.007381201},"labels":[],"label_agreement":null},{"id":"W1971967548","doi":"10.1109/syscon.2012.6189539","title":"Overview of Artificial Bee Colony (ABC) algorithm and its applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Artificial bee colony algorithm; Computer science; Metaheuristic; Heuristic; Mathematical optimization; Algorithm; Key (lock); Optimization algorithm; Population; Meta heuristic; Artificial intelligence; Mathematics","score_opus":0.07954983294595744,"score_gpt":0.35052592406468414,"score_spread":0.27097609111872667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971967548","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009973592,0.21666194,0.64708817,0.0034095114,0.0014637775,0.00046378394,0.00047020684,0.0014599233,0.11900903],"genre_scores_gemma":[0.1621359,0.20848541,0.58198816,0.0012862139,0.0013458829,0.00048881647,0.0014079532,0.00030736823,0.04255428],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943274,0.000110748384,0.000057009634,0.00006821507,0.00030264613,0.000028533688],"domain_scores_gemma":[0.9995159,0.00010094332,0.000037088783,0.000034574572,0.00028207657,0.000029524614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049760065,0.00080505764,0.0007207931,0.001481369,0.00047415207,0.0015467972,0.000945711,0.0014663229,0.0034534086],"category_scores_gemma":[0.0013262207,0.00032666864,0.00050239585,0.0030484085,0.0003256264,0.0010702239,0.000611535,0.00095756486,0.0019699605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052695235,0.00006628609,0.0012200096,0.0009773172,0.000053096122,0.00020539419,0.00008580708,0.03512043,0.004193949,0.03462753,0.024618244,0.89877915],"study_design_scores_gemma":[0.00003736401,0.00018462945,0.0023713766,0.00073825126,0.00009460522,0.0015514181,0.00013550176,0.20041835,0.0060160784,0.03996475,0.748399,0.00008860341],"about_ca_topic_score_codex":0.0032246658,"about_ca_topic_score_gemma":0.0017026333,"teacher_disagreement_score":0.0034534086,"about_ca_system_score_codex":0.0004866426,"about_ca_system_score_gemma":0.0009327128,"threshold_uncertainty_score":0.011552811},"labels":[],"label_agreement":null},{"id":"W1977528467","doi":"10.1145/2463372.2463426","title":"On the behaviour of the (1, λ)-es for a conically constrained problem","year":2013,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Mathematical optimization; Applied mathematics; Mathematics; Computer science; Rate of convergence; Invariant (physics); Algorithm; Key (lock)","score_opus":0.028158495147658162,"score_gpt":0.27669647974194406,"score_spread":0.2485379845942859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977528467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31916505,0.0013112464,0.6649979,0.0011825537,0.00005908135,0.00011560906,0.000104053644,0.00024236752,0.012822031],"genre_scores_gemma":[0.90416855,0.0005547208,0.09118256,0.00028825918,0.000024243076,0.00010802589,0.00011837583,0.00011862467,0.0034366373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995121,0.0002437226,0.00002507677,0.00006679758,0.00009326271,0.000059032816],"domain_scores_gemma":[0.9891816,0.0094226515,0.00054104306,0.0002102664,0.00044625055,0.00019832885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004098664,0.00071813003,0.0008702953,0.00089890836,0.00045157078,0.0011854983,0.0009585539,0.0018080705,0.0016284039],"category_scores_gemma":[0.023057431,0.00040326698,0.0006027645,0.0005194071,0.0015948799,0.0013894129,0.0010532552,0.0012089158,0.00024671084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073256844,0.00003241085,0.0007585129,0.00008937291,0.000029896319,0.00012203509,0.00012612568,0.9590885,0.0031431313,0.0277899,0.00042355194,0.008323368],"study_design_scores_gemma":[0.000006980963,0.000038739272,0.00017341746,0.000018222163,0.000005208166,0.000032881948,0.000023047982,0.9926973,0.00035190178,0.006537961,0.00010740947,0.0000068582244],"about_ca_topic_score_codex":0.003325733,"about_ca_topic_score_gemma":0.0015822599,"teacher_disagreement_score":0.004098664,"about_ca_system_score_codex":0.0008530697,"about_ca_system_score_gemma":0.00086018234,"threshold_uncertainty_score":0.021676064},"labels":[],"label_agreement":null},{"id":"W1979173729","doi":"10.1007/s10288-009-0108-x","title":"Attraction probabilities in variable neighborhood search","year":2009,"lang":"en","type":"article","venue":"4OR","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Royal Military College of Canada","funders":"","keywords":"Attraction; Variable (mathematics); Context (archaeology); Mathematical optimization; Operator (biology); Variable neighborhood search; Mathematics; Local search (optimization); Convergence (economics); Current (fluid); Global optimization; Computer science; Metaheuristic; Geography; Mathematical analysis; Physics; Economics","score_opus":0.023488047299865797,"score_gpt":0.28500180224200083,"score_spread":0.261513754942135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979173729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043839507,0.0013203816,0.9347435,0.0008229009,0.0001821938,0.00008181546,0.000084769614,0.000156058,0.01876878],"genre_scores_gemma":[0.77596915,0.0010185384,0.20163937,0.000294602,0.00028362445,0.00038695612,0.00016572121,0.00020371775,0.020038372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909496,0.00051403226,0.000026141655,0.00009303959,0.00020439635,0.00006756952],"domain_scores_gemma":[0.99348664,0.0055501712,0.00028979033,0.00019792649,0.00032584084,0.00014964318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027567584,0.0003872931,0.0010512092,0.0015213034,0.0010095518,0.0013671226,0.0016591713,0.0017475904,0.006582774],"category_scores_gemma":[0.01889062,0.0006874386,0.00061168475,0.0012995023,0.001840179,0.003145163,0.0016453008,0.0015266925,0.0004658956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000703271,0.000032804222,0.00069439295,0.00010275953,0.000024857729,0.000047559563,0.00008968445,0.4763483,0.00026042244,0.4958504,0.0018542114,0.02462409],"study_design_scores_gemma":[0.00001207222,0.0000130733015,0.00016395726,0.000019085195,0.0000068035174,0.00001653246,0.000010767608,0.895899,0.000121337696,0.102878,0.00085144275,0.000007904255],"about_ca_topic_score_codex":0.0034436109,"about_ca_topic_score_gemma":0.0026791797,"teacher_disagreement_score":0.006582774,"about_ca_system_score_codex":0.001246708,"about_ca_system_score_gemma":0.0007802232,"threshold_uncertainty_score":0.022021532},"labels":[],"label_agreement":null},{"id":"W1982970548","doi":"10.1007/s00500-010-0591-1","title":"DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization","year":2010,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":367,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"China University of Geosciences; China Scholarship Council","keywords":"Differential evolution; Benchmark (surveying); Evolutionary algorithm; Computer science; Global optimization; Curse of dimensionality; Mathematical optimization; Convergence (economics); Range (aeronautics); Evolutionary computation; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Engineering","score_opus":0.009130652461568212,"score_gpt":0.26138213911071934,"score_spread":0.25225148664915115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982970548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057153385,0.00032544014,0.9871991,0.000121198005,0.00015424674,0.00008005651,0.000082041086,0.00060265546,0.0057198997],"genre_scores_gemma":[0.13863026,0.00036029896,0.8533965,0.00027749367,0.00009291258,0.00052054605,0.00022611361,0.00045968467,0.0060361577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996611,0.00011754825,0.00001688843,0.000035557634,0.00014017308,0.000028763501],"domain_scores_gemma":[0.9996207,0.00019456423,0.000030473127,0.000044331162,0.00007868426,0.000031290077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079409446,0.0009916603,0.0012727112,0.00069869997,0.0004812984,0.0008493396,0.0017245864,0.0016185567,0.0037823715],"category_scores_gemma":[0.0014780881,0.0005670589,0.0008783257,0.0008207189,0.00052224024,0.0006531937,0.0014259741,0.0014969455,0.00097144564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096534946,0.000094528135,0.0004591641,0.00019010264,0.00015389181,0.000063898864,0.00004240085,0.87195444,0.004872026,0.018639427,0.002594677,0.10083894],"study_design_scores_gemma":[0.000020809824,0.000018337358,0.00004766079,0.000006868762,0.000009399146,0.000010187857,0.000002380164,0.9958034,0.00058653275,0.0014773858,0.0020124556,0.0000045187267],"about_ca_topic_score_codex":0.0029322098,"about_ca_topic_score_gemma":0.0037896875,"teacher_disagreement_score":0.0037823715,"about_ca_system_score_codex":0.00050809473,"about_ca_system_score_gemma":0.00081461197,"threshold_uncertainty_score":0.012653232},"labels":[],"label_agreement":null},{"id":"W1985951128","doi":"10.1007/s00500-015-1630-8","title":"Bolstering efficient SSGAs based on an ensemble of probabilistic variable-wise crossover strategies","year":2015,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Crossover; Benchmark (surveying); Computer science; Probabilistic logic; Operator (biology); Evolutionary computation; Evolutionary algorithm; Variable (mathematics); Computation; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.04493490173541932,"score_gpt":0.3110365270932806,"score_spread":0.2661016253578613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985951128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08247246,0.0008525599,0.90969837,0.00021171336,0.00012333467,0.00006317114,0.000022011127,0.00032711177,0.006229214],"genre_scores_gemma":[0.8740465,0.00028681624,0.12323179,0.00011716506,0.000042465952,0.00010196539,0.000036902165,0.00004876878,0.0020875274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938214,0.0002026511,0.00002336707,0.000084608655,0.00022750156,0.000079640304],"domain_scores_gemma":[0.99921656,0.00038479292,0.000072318995,0.00013908552,0.00013491615,0.000052262425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013219499,0.00064424565,0.0010930784,0.00065147836,0.00048382487,0.00093504414,0.0012282921,0.001117534,0.0013587407],"category_scores_gemma":[0.0027828088,0.00038951472,0.00070302846,0.00069285755,0.0006518883,0.0012616088,0.0012846384,0.0012823275,0.00028940605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018831852,0.00011697044,0.0009095886,0.000059698345,0.00010832854,0.00007175439,0.0000774074,0.84663135,0.010891881,0.026915811,0.000765178,0.11326372],"study_design_scores_gemma":[0.00001284366,0.00006601536,0.00011435208,0.000006896234,0.000014427808,0.000027275526,0.000008660852,0.99376607,0.0012037073,0.004335372,0.00043839938,0.0000059740696],"about_ca_topic_score_codex":0.00080510596,"about_ca_topic_score_gemma":0.0011562223,"teacher_disagreement_score":0.0013587407,"about_ca_system_score_codex":0.00048597713,"about_ca_system_score_gemma":0.00069806835,"threshold_uncertainty_score":0.006991267},"labels":[],"label_agreement":null},{"id":"W1989327351","doi":"10.1109/ictai.2010.21","title":"Particle Swarm Classification for High Dimensional Data Sets","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Curse of dimensionality; Cardinality (data modeling); Computer science; Set (abstract data type); Data set; Swarm behaviour; Statistical classification; Class (philosophy); Dispersion (optics); Data mining; Algorithm; Artificial intelligence; Physics","score_opus":0.11288058756019513,"score_gpt":0.3645696285704929,"score_spread":0.25168904101029776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989327351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030853525,0.0008435853,0.96516824,0.00072084117,0.00013774725,0.00014852949,0.00017740885,0.00055355293,0.001396591],"genre_scores_gemma":[0.3471334,0.00085257017,0.6484049,0.00021708848,0.00018714125,0.00047079305,0.0007408897,0.00009160006,0.0019016936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973774,0.00093459006,0.0002955912,0.00034520196,0.000941516,0.00010566338],"domain_scores_gemma":[0.9899503,0.007101414,0.000686536,0.0009674252,0.0011747341,0.00011956667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055622705,0.00087146286,0.0017123284,0.0029755929,0.0009698786,0.0027539046,0.0010502037,0.001717051,0.0011218212],"category_scores_gemma":[0.021901488,0.00048957305,0.0010057794,0.0031128058,0.0010986024,0.0023254592,0.0013646972,0.001939615,0.00059249473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023151045,0.00016604865,0.005395903,0.00041067702,0.00020197032,0.0002285814,0.00042469494,0.6490479,0.0040524327,0.026449164,0.0048648394,0.30852625],"study_design_scores_gemma":[0.000009235701,0.000022995455,0.0007073314,0.000016984137,0.0000070334713,0.00002662299,0.00003625516,0.9898268,0.0006909583,0.007753465,0.0008925345,0.000009811991],"about_ca_topic_score_codex":0.0040741274,"about_ca_topic_score_gemma":0.002012061,"teacher_disagreement_score":0.0055622705,"about_ca_system_score_codex":0.0012638614,"about_ca_system_score_gemma":0.0007942489,"threshold_uncertainty_score":0.029416502},"labels":[],"label_agreement":null},{"id":"W1989361868","doi":"10.1109/cec.2010.5586139","title":"Fighting noise with noise: DE with individuals shaking to tackle noisy problems","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Noise (video); Benchmark (surveying); Computer science; Noise measurement; Algorithm; Monte Carlo method; Test suite; Population; Artificial intelligence; Machine learning; Mathematics; Noise reduction; Statistics; Test case","score_opus":0.014128498407306123,"score_gpt":0.2667874087732113,"score_spread":0.25265891036590515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989361868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016970398,0.00022473594,0.98097986,0.00007641888,0.000038636786,0.000027222539,0.00001599406,0.000101199,0.0015655237],"genre_scores_gemma":[0.48810598,0.00044121998,0.5069283,0.00021036433,0.00008312801,0.00022090167,0.00012233357,0.0000901541,0.0037975553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995704,0.0001464169,0.000028073837,0.00007230356,0.00014685236,0.0000359637],"domain_scores_gemma":[0.9992507,0.00046154493,0.00008280895,0.00007816489,0.00009588131,0.00003092736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011124124,0.0008211084,0.0009421212,0.0005141378,0.00035822144,0.00066927995,0.00092823186,0.000905193,0.00086919183],"category_scores_gemma":[0.002223152,0.00032091633,0.00055699307,0.0005158148,0.00058122905,0.00082455715,0.0010364886,0.0009705506,0.00016985282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049731145,0.00004476817,0.0006311753,0.000076938326,0.000059910148,0.000060447313,0.00005896063,0.9339383,0.007091339,0.013739148,0.00041375347,0.043835472],"study_design_scores_gemma":[0.000009049028,0.000032888584,0.00008743966,0.000004722514,0.000009733351,0.000028333974,0.000008344549,0.9943446,0.0017471845,0.0026843064,0.001038341,0.0000050601243],"about_ca_topic_score_codex":0.00070988416,"about_ca_topic_score_gemma":0.00076151267,"teacher_disagreement_score":0.0011124124,"about_ca_system_score_codex":0.0003188915,"about_ca_system_score_gemma":0.0004169313,"threshold_uncertainty_score":0.0058830976},"labels":[],"label_agreement":null},{"id":"W1989986531","doi":"10.1109/smc.2014.6974290","title":"On VEPSO and VEDE for solving a treaty optimization problem","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematical optimization; Optimization problem; Vector optimization; Differential evolution; Particle swarm optimization; Computer science; Multi-swarm optimization; Mathematics","score_opus":0.016756325054187903,"score_gpt":0.27057511004080237,"score_spread":0.2538187849866145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989986531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08337502,0.0018864749,0.89675707,0.0009001118,0.0002815031,0.0002298072,0.000106669475,0.0003818298,0.016081592],"genre_scores_gemma":[0.47531804,0.001117594,0.5179283,0.0005038674,0.00011342722,0.0004641614,0.00029630557,0.00015790187,0.004100331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994246,0.0002712624,0.000034426455,0.00004707046,0.00017610086,0.00004657845],"domain_scores_gemma":[0.99754506,0.0018935222,0.00009914294,0.00008883473,0.00031152222,0.000061858445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021832888,0.0009869477,0.001088358,0.0009435743,0.0004355712,0.00096184365,0.00096290774,0.0015349422,0.0021583154],"category_scores_gemma":[0.0067556547,0.00040382287,0.000626946,0.00095182844,0.00074679754,0.00080026774,0.0012494981,0.0012705692,0.00027184474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009957534,0.000073628544,0.00073222653,0.00011163222,0.000050146184,0.00004501763,0.00003952129,0.93312436,0.0006336343,0.0091572115,0.0007575224,0.055175487],"study_design_scores_gemma":[0.000016102682,0.00006242372,0.000120499644,0.000013245856,0.000007137914,0.000014004589,0.000009724991,0.99699295,0.00027872325,0.0017896324,0.0006908503,0.0000047510634],"about_ca_topic_score_codex":0.0058389087,"about_ca_topic_score_gemma":0.004541412,"teacher_disagreement_score":0.0058389087,"about_ca_system_score_codex":0.0006941877,"about_ca_system_score_gemma":0.0009780858,"threshold_uncertainty_score":0.011609852},"labels":[],"label_agreement":null},{"id":"W1991528932","doi":"10.1108/17563780810857121","title":"Adaptive learning by a target‐tracking system","year":2008,"lang":"en","type":"article","venue":"International Journal of Intelligent Computing and Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Ethogram; Implementation; Space (punctuation); Quality (philosophy)","score_opus":0.024619582025407268,"score_gpt":0.2819123869717912,"score_spread":0.25729280494638396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991528932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040957294,0.00018207441,0.93577427,0.00029708052,0.000105353574,0.00011916979,0.00003495435,0.0015619039,0.0209679],"genre_scores_gemma":[0.8606431,0.00018422876,0.12369787,0.00021053532,0.00005402685,0.00019915431,0.000057116165,0.000050763552,0.014903159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997416,0.00003298609,0.000015647493,0.000096123105,0.000088496185,0.00002506402],"domain_scores_gemma":[0.999683,0.000094122566,0.000039217946,0.000055384335,0.00009751665,0.000030830346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043451224,0.0002493397,0.00033537924,0.0001909688,0.00034313707,0.0007716189,0.00090603123,0.0007466026,0.0041511175],"category_scores_gemma":[0.0009537534,0.00018088281,0.00030166082,0.00020731185,0.00057900324,0.0007267195,0.0007129112,0.00074984145,0.001107559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000281394,0.0002480943,0.0020269654,0.000208424,0.000082263934,0.00035566176,0.0003315726,0.5844535,0.09719917,0.0585103,0.0026002745,0.25370237],"study_design_scores_gemma":[0.00002810459,0.00020221899,0.00049870915,0.000017452336,0.000014518128,0.000097397395,0.000017285733,0.97890955,0.008727782,0.0052645383,0.0062054046,0.00001692794],"about_ca_topic_score_codex":0.0018294016,"about_ca_topic_score_gemma":0.001006648,"teacher_disagreement_score":0.0041511175,"about_ca_system_score_codex":0.0005071841,"about_ca_system_score_gemma":0.00061011617,"threshold_uncertainty_score":0.013886809},"labels":[],"label_agreement":null},{"id":"W1993259679","doi":"10.1145/1557626.1557669","title":"Option pricing using Particle Swarm Optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Department of Science and Technology, Ministry of Science and Technology, India; University of Manitoba","keywords":"Particle swarm optimization; Swarm intelligence; Computer science; Mathematical optimization; Valuation of options; Black–Scholes model; Simple (philosophy); Multi-swarm optimization; Metaheuristic; Computational intelligence; Economics; Artificial intelligence; Econometrics; Machine learning; Mathematics","score_opus":0.04394890247619784,"score_gpt":0.31781241357080725,"score_spread":0.2738635110946094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993259679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016114684,0.0009658286,0.9740423,0.00043156935,0.00011376482,0.00006409795,0.00003900654,0.00025939252,0.007969332],"genre_scores_gemma":[0.70743626,0.0020405634,0.28375405,0.00012243303,0.00016570529,0.00016656084,0.0001479308,0.000072639756,0.0060938327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995784,0.00019323369,0.000017871884,0.000039589675,0.00015170472,0.000019162822],"domain_scores_gemma":[0.9995395,0.00027494505,0.000047664686,0.000046389363,0.000070507216,0.000021033242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083239545,0.0004803423,0.000807327,0.00056284183,0.00037678605,0.0015046814,0.00046854353,0.0011119642,0.0015465122],"category_scores_gemma":[0.0024311603,0.00026019537,0.0005697664,0.0008741478,0.0005030742,0.001364106,0.0006532288,0.00086927717,0.00031541736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004230081,0.00004369247,0.00064778834,0.000071155504,0.00006896155,0.00008189004,0.000047578364,0.8958261,0.0017465443,0.04352584,0.0014894587,0.05640871],"study_design_scores_gemma":[0.0000070230813,0.00001250811,0.0000761842,0.00000379301,0.0000044521908,0.000011844067,0.0000044534095,0.99083906,0.00021833481,0.008051078,0.00076764124,0.0000036727547],"about_ca_topic_score_codex":0.0025058913,"about_ca_topic_score_gemma":0.0012195336,"teacher_disagreement_score":0.0025058913,"about_ca_system_score_codex":0.00046879263,"about_ca_system_score_gemma":0.00047643186,"threshold_uncertainty_score":0.005173564},"labels":[],"label_agreement":null},{"id":"W1993433133","doi":"10.1142/s0129065707001202","title":"NON-LINEAR GLOBAL OPTIMIZATION VIA PARAMETERIZATION AND INVERSE FUNCTION APPROXIMATION: AN ARTIFICIAL NEURAL NETWORKS APPROACH","year":2007,"lang":"en","type":"article","venue":"International Journal of Neural Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Maxima and minima; Global optimization; Artificial neural network; Mathematical optimization; Simulated annealing; Computer science; Inverse; Algorithm; Function (biology); Inflection point; MATLAB; Mathematics; Artificial intelligence","score_opus":0.036571343788874354,"score_gpt":0.30295177695533027,"score_spread":0.26638043316645593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993433133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019567204,0.00021138626,0.9964245,0.00005421558,0.000014039317,0.00001003515,0.000003106522,0.00007536692,0.0012506486],"genre_scores_gemma":[0.32804018,0.001115319,0.66408414,0.0001570906,0.000086721324,0.00027794574,0.00006941359,0.00020117042,0.0059679993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996549,0.00012821898,0.000017608156,0.00006432515,0.00011110383,0.000023813225],"domain_scores_gemma":[0.99966466,0.00017926596,0.00005626025,0.00004326832,0.00004944528,0.0000070774113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008993586,0.0008928512,0.000895736,0.00052356976,0.00029270313,0.0008085565,0.001022548,0.0011662357,0.0012090736],"category_scores_gemma":[0.0015997117,0.00039076942,0.00073485536,0.00059263845,0.00079731666,0.0013814818,0.00082097546,0.0011617866,0.0003158597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029388875,0.000023066272,0.00018261137,0.00009876912,0.000044520973,0.000053718122,0.00006642906,0.8991874,0.0045526084,0.021344662,0.00042062948,0.07399621],"study_design_scores_gemma":[0.000003264847,0.000015161743,0.000043150863,0.000008499762,0.0000072785497,0.00002626173,0.0000063245757,0.9928028,0.000997653,0.0050332565,0.0010501262,0.000006146573],"about_ca_topic_score_codex":0.0010879211,"about_ca_topic_score_gemma":0.0012434538,"teacher_disagreement_score":0.0012090736,"about_ca_system_score_codex":0.00047601011,"about_ca_system_score_gemma":0.00052292616,"threshold_uncertainty_score":0.0047563314},"labels":[],"label_agreement":null},{"id":"W1994895518","doi":"10.1007/s10898-007-9234-1","title":"Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search","year":2007,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Mathematics; Variable neighborhood search; Mathematical optimization; Metaheuristic; Convergence (economics); Local search (optimization); Variable (mathematics); Guided Local Search; Algorithm","score_opus":0.021690053764088987,"score_gpt":0.29792047765924756,"score_spread":0.27623042389515856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994895518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022082508,0.00036740224,0.97012997,0.000105376304,0.00011011299,0.000053809097,0.000019498606,0.00018121333,0.006950123],"genre_scores_gemma":[0.38145828,0.00025814984,0.611039,0.000118836324,0.000084309366,0.00027953304,0.00006293492,0.00018925338,0.0065097343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976295,0.00009480579,0.0000084083385,0.000027366657,0.000093436596,0.000013000419],"domain_scores_gemma":[0.9993697,0.00041606097,0.00004988132,0.00004521253,0.000099367775,0.000019778809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068096566,0.000515179,0.00092962495,0.0006402929,0.00041717137,0.0006307816,0.0010347669,0.0009996236,0.002264737],"category_scores_gemma":[0.00216161,0.0004668385,0.0005224016,0.00056271575,0.0005957462,0.00086942257,0.0007840968,0.00068901305,0.00026411467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012093243,0.00008448622,0.00038024294,0.00009678913,0.00006681492,0.00005774172,0.00006079334,0.883984,0.0030236514,0.032333232,0.0013949078,0.07839645],"study_design_scores_gemma":[0.00000841282,0.000011848171,0.000029978002,0.0000019979132,0.00000311802,0.0000058140727,0.0000021621431,0.9977348,0.00015988108,0.0017964353,0.00024368423,0.000001945514],"about_ca_topic_score_codex":0.0024254275,"about_ca_topic_score_gemma":0.0035027992,"teacher_disagreement_score":0.0024254275,"about_ca_system_score_codex":0.00042972676,"about_ca_system_score_gemma":0.0005349988,"threshold_uncertainty_score":0.007576287},"labels":[],"label_agreement":null},{"id":"W1996527665","doi":"10.1145/1569901.1570046","title":"Evolving an edge selection formula for ant colony optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Ant colony optimization algorithms; Selection (genetic algorithm); ANT; Computer science; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.027682765713338834,"score_gpt":0.31985136021596156,"score_spread":0.2921685945026227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996527665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04478653,0.00031663536,0.94460267,0.00024474526,0.00012527156,0.000078643716,0.000029350402,0.00030623423,0.009509907],"genre_scores_gemma":[0.49007964,0.0004213991,0.50328237,0.00017863132,0.00005443107,0.000118855976,0.00007088718,0.0001680908,0.005625636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997495,0.00006335091,0.000011929808,0.000023142178,0.00013183495,0.000020236585],"domain_scores_gemma":[0.9996624,0.00015794439,0.00002737416,0.000029508503,0.00010945958,0.000013222643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005249407,0.00031427434,0.00033582826,0.0004069246,0.00024616878,0.0005074539,0.00073248276,0.000520148,0.0014351036],"category_scores_gemma":[0.002479836,0.00013571515,0.00021956029,0.0003679619,0.00028427312,0.00056645955,0.0003292004,0.00066979113,0.00027485663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000741273,0.00010619856,0.0013780368,0.0000940867,0.00003354752,0.00015606247,0.00012516494,0.5080528,0.019379808,0.09323729,0.0035831542,0.37377968],"study_design_scores_gemma":[0.000013449007,0.00003121946,0.00010242746,0.000006121682,0.0000072229964,0.000033778862,0.00000648585,0.98844296,0.0021557305,0.0068053147,0.0023901288,0.0000051360857],"about_ca_topic_score_codex":0.0010630459,"about_ca_topic_score_gemma":0.0015611679,"teacher_disagreement_score":0.0014351036,"about_ca_system_score_codex":0.00032042258,"about_ca_system_score_gemma":0.00037655476,"threshold_uncertainty_score":0.0048009157},"labels":[],"label_agreement":null},{"id":"W1997744027","doi":"10.1109/cec.2012.6256132","title":"Particle Swarm Optimization with Adaptive Bounds","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Particle swarm optimization; Maxima and minima; Estimation of distribution algorithm; Benchmark (surveying); Mathematical optimization; Premature convergence; Metaheuristic; Multi-swarm optimization; Computer science; Convergence (economics); Evolutionary algorithm; Probabilistic logic; Local search (optimization); Algorithm; Mathematics; Artificial intelligence","score_opus":0.031256977085311194,"score_gpt":0.26984096596596324,"score_spread":0.23858398888065205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997744027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006005298,0.00118582,0.9852883,0.00019196088,0.00011815849,0.000051809944,0.00003577715,0.0002523593,0.0068703988],"genre_scores_gemma":[0.54890126,0.0022836654,0.43798578,0.00021973516,0.0002529006,0.0005294135,0.00027818853,0.00017712968,0.009371885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991912,0.00027785206,0.00005225996,0.00011580952,0.00030428375,0.00005848229],"domain_scores_gemma":[0.9988487,0.0007137356,0.00010545687,0.00010315839,0.00019211159,0.000036858455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012099186,0.0010566973,0.0013784978,0.00072464824,0.00054037536,0.0013949455,0.0011727046,0.0015321443,0.0018485008],"category_scores_gemma":[0.0047826837,0.00044136166,0.00067189167,0.001124413,0.00069146673,0.0013378584,0.0014929469,0.0014822375,0.0005261399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000350413,0.000034943056,0.00028677646,0.00006899064,0.000037196685,0.00003685854,0.0000284837,0.9434033,0.00061141123,0.017091477,0.0011014537,0.03726418],"study_design_scores_gemma":[0.000013545005,0.00001650235,0.00006312028,0.000008727532,0.000006001527,0.000008928503,0.000003316315,0.99404496,0.00020620355,0.0042149597,0.0014092464,0.0000045972797],"about_ca_topic_score_codex":0.0038355377,"about_ca_topic_score_gemma":0.0017137678,"teacher_disagreement_score":0.0038355377,"about_ca_system_score_codex":0.000581966,"about_ca_system_score_gemma":0.0008641713,"threshold_uncertainty_score":0.0076264143},"labels":[],"label_agreement":null},{"id":"W1998625786","doi":"10.1155/2013/172193","title":"Complexity Reduction in the Use of Evolutionary Algorithms to Function Optimization: A Variable Reduction Strategy","year":2013,"lang":"en","type":"article","venue":"The Scientific World JOURNAL","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Mathematical optimization; Reduction (mathematics); Benchmark (surveying); Optimization problem; Computer science; Particle swarm optimization; Variable (mathematics); Function (biology); Algorithm; Continuous optimization; Evolutionary algorithm; Derivative-free optimization; Multi-swarm optimization; Mathematics","score_opus":0.11378218412887775,"score_gpt":0.29512209943853585,"score_spread":0.1813399153096581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998625786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069663906,0.0004732242,0.9900031,0.00022160647,0.000034543475,0.000049875747,0.000009556947,0.00008117907,0.0021605028],"genre_scores_gemma":[0.25319877,0.0011809769,0.7423577,0.00021390816,0.00009725995,0.00031149737,0.000074873235,0.00010538669,0.0024597235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990727,0.0004212856,0.000046394725,0.00009243577,0.0003222082,0.000044914123],"domain_scores_gemma":[0.9990908,0.00058953825,0.000057477162,0.00012394541,0.00012105656,0.000017195362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013936629,0.0008943617,0.00097170664,0.0010530881,0.00039760483,0.0009754815,0.0010976013,0.000836757,0.0013624778],"category_scores_gemma":[0.0035472717,0.00036334788,0.0012939879,0.0010823524,0.0009903201,0.0012735715,0.0011859196,0.0011740302,0.00030518477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009693346,0.0001236232,0.0008014261,0.00030721864,0.0001782823,0.00018591524,0.00023659314,0.59206176,0.011902223,0.112743005,0.0017310202,0.279632],"study_design_scores_gemma":[0.000025413477,0.000090447524,0.00020358438,0.00002410206,0.000041946838,0.000084683554,0.000019411294,0.96176016,0.0026315695,0.031538468,0.0035643305,0.000015878704],"about_ca_topic_score_codex":0.0012401243,"about_ca_topic_score_gemma":0.0011858123,"teacher_disagreement_score":0.0013936629,"about_ca_system_score_codex":0.0004652829,"about_ca_system_score_gemma":0.0007609142,"threshold_uncertainty_score":0.007370472},"labels":[],"label_agreement":null},{"id":"W2002865108","doi":"10.1109/sde.2014.7031533","title":"MDE: Differential evolution with merit-based mutation strategy","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Differential evolution; Computer science; Mutation; Evolutionary computation; Convergence (economics); Mathematical optimization; Computation; Evolution strategy; Evolutionary algorithm; Population; Algorithm; Artificial intelligence; Mathematics","score_opus":0.012621272463644025,"score_gpt":0.25082818856107414,"score_spread":0.2382069160974301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002865108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016209342,0.0012478514,0.9736419,0.00033266327,0.00014944906,0.00012337341,0.000077674355,0.0005558873,0.0076618604],"genre_scores_gemma":[0.5737393,0.0012924753,0.41102338,0.00032340104,0.000098602206,0.00043943612,0.00022871805,0.00014025618,0.012714407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957424,0.00009728924,0.000021438176,0.00005301726,0.00022284621,0.00003112797],"domain_scores_gemma":[0.9996942,0.00013951065,0.00004074121,0.000028911261,0.00007901024,0.000017564522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060533214,0.00059992314,0.0009845757,0.000705255,0.00030075194,0.00067405653,0.0013065988,0.0009851636,0.0019983326],"category_scores_gemma":[0.0016524886,0.00018115621,0.00054029934,0.0008281872,0.00045037115,0.0005763216,0.00078554987,0.0007128287,0.00041786153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011053167,0.00010136836,0.0010746431,0.00021850906,0.00011428934,0.00037291637,0.00007585423,0.6571541,0.017820721,0.05535689,0.004366844,0.2632333],"study_design_scores_gemma":[0.000035614714,0.00009575013,0.00025105936,0.000015683085,0.000021773662,0.00022644881,0.0000066697553,0.9818378,0.0035311973,0.006940488,0.0070215166,0.00001603243],"about_ca_topic_score_codex":0.0014169276,"about_ca_topic_score_gemma":0.001074448,"teacher_disagreement_score":0.0019983326,"about_ca_system_score_codex":0.0006054908,"about_ca_system_score_gemma":0.00065203366,"threshold_uncertainty_score":0.006685078},"labels":[],"label_agreement":null},{"id":"W2003200838","doi":"10.1002/cjce.21681","title":"Vortex motion‐based particle swarm optimisation for energy consumption of alumina evaporation","year":2012,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"National Science Fund for Distinguished Young Scholars; National Natural Science Foundation of China","keywords":"Sodium aluminate; Evaporation; Particle swarm optimization; Process engineering; Process (computing); Benchmark (surveying); Energy consumption; Vortex; Particle (ecology); Regenerative heat exchanger; Mathematical optimization; Steam reforming; Computer science; Materials science; Engineering; Algorithm; Heat exchanger; Mechanical engineering; Chemistry; Mechanics; Mathematics; Thermodynamics; Aluminium; Physics; Composite material","score_opus":0.032530352793241894,"score_gpt":0.2516932989016014,"score_spread":0.2191629461083595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003200838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2605821,0.000705013,0.7331808,0.0003285493,0.00007024687,0.000111478905,0.000055284145,0.00012054858,0.004845913],"genre_scores_gemma":[0.9453146,0.00019138191,0.052770074,0.000026298918,0.000016597343,0.000111158166,0.000052498537,0.000026636115,0.0014908705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987125,0.00006000259,0.0000056111726,0.000012572741,0.000033678793,0.000016792334],"domain_scores_gemma":[0.9996,0.0002796979,0.00004187895,0.000011365822,0.000054391112,0.00001284814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061280484,0.0004816481,0.0006754491,0.00052938535,0.00029598278,0.0006265679,0.00036047114,0.00065538206,0.000601733],"category_scores_gemma":[0.0012241406,0.0002989957,0.00039863735,0.00043633732,0.00045778524,0.00039441165,0.000325233,0.00035888935,0.00006968034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028502174,0.000015001997,0.0002756997,0.00002072484,0.000013142027,0.000014685282,0.000009386434,0.993361,0.0012346687,0.0010469436,0.00007944136,0.0039008267],"study_design_scores_gemma":[0.0000067098354,0.000012643812,0.000078345925,0.0000011800788,0.0000020029793,0.0000013414015,0.000002385644,0.9993591,0.00024224778,0.00023390375,0.0000590262,0.0000011403995],"about_ca_topic_score_codex":0.003482387,"about_ca_topic_score_gemma":0.0019226337,"teacher_disagreement_score":0.003482387,"about_ca_system_score_codex":0.00057508424,"about_ca_system_score_gemma":0.00065864593,"threshold_uncertainty_score":0.0069242716},"labels":[],"label_agreement":null},{"id":"W2004624951","doi":"10.2495/data070071","title":"Genetic Algorithms in a dynamically changing environment","year":2007,"lang":"en","type":"article","venue":"WIT transactions on information and communication technologies","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Crossover; Computer science; Transformation (genetics); Genetic algorithm; Selection (genetic algorithm); Operator (biology); Generator (circuit theory); Adaptation (eye); Population; Mathematical optimization; Quality control and genetic algorithms; Mutation; Algorithm; Linear map; Genetic operator; Meta-optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.010721761327469695,"score_gpt":0.2390097840484396,"score_spread":0.2282880227209699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004624951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021316003,0.00298634,0.9555524,0.0012376442,0.00025881233,0.00008353493,0.0000890936,0.0007577272,0.017718518],"genre_scores_gemma":[0.39096084,0.007336179,0.5859294,0.0011035912,0.0002967621,0.0003770213,0.0002733876,0.00030589048,0.01341687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992933,0.00025423523,0.000029453111,0.00014680102,0.00021721184,0.000059047932],"domain_scores_gemma":[0.9992305,0.00046788141,0.00008339571,0.00009237968,0.0000920513,0.00003383176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008001415,0.0006464223,0.00092165265,0.00076423195,0.00070417207,0.0020279258,0.0014911778,0.0018349454,0.002106538],"category_scores_gemma":[0.0028870872,0.00040039688,0.00055257056,0.001148767,0.0018697173,0.0021965078,0.001382045,0.0018178929,0.00088563026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051981682,0.000047013156,0.001147041,0.00015129891,0.00011531529,0.00047413548,0.00027386023,0.6963333,0.005036633,0.20061186,0.0049601817,0.090797335],"study_design_scores_gemma":[0.00004102963,0.00006474484,0.00047053827,0.00008110529,0.000054648368,0.00035620126,0.00015776155,0.73766696,0.00213093,0.20958889,0.049334098,0.000053073905],"about_ca_topic_score_codex":0.002277633,"about_ca_topic_score_gemma":0.0013570014,"teacher_disagreement_score":0.002277633,"about_ca_system_score_codex":0.0008104082,"about_ca_system_score_gemma":0.000871122,"threshold_uncertainty_score":0.0070471168},"labels":[],"label_agreement":null},{"id":"W2005381007","doi":"10.1109/iscas.2012.6272097","title":"A novel particle swarm optimization for high-level synthesis of digital filters","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Computer science; Backtracking; Scheduling (production processes); Digital filter; Algorithm; Mathematical optimization; Filter (signal processing); Mathematics; Computer vision","score_opus":0.07040461113638566,"score_gpt":0.29313235783168995,"score_spread":0.2227277466953043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005381007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00285046,0.00009517806,0.99544793,0.00004790333,0.000035898203,0.00002371656,0.000009637473,0.00010178788,0.0013875931],"genre_scores_gemma":[0.19299896,0.0003121836,0.8022228,0.000083524705,0.00005785891,0.000230405,0.00008155882,0.000055039287,0.003957587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979204,0.000058175694,0.000012580056,0.000034647503,0.00008706163,0.000015542328],"domain_scores_gemma":[0.9998627,0.000060713588,0.000018481473,0.000015140043,0.00003485916,0.0000081184235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040411094,0.000543607,0.00049990613,0.0003220445,0.00030939904,0.0005401951,0.00051442604,0.0007512967,0.0014104478],"category_scores_gemma":[0.00074577314,0.0002816745,0.00056015473,0.00029675727,0.00040448402,0.00043516987,0.00040611505,0.00059136446,0.0003605132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063500214,0.000052614618,0.00033646764,0.00015630806,0.00006105254,0.00009167328,0.00008644534,0.858462,0.020342937,0.019442528,0.0013388743,0.099565625],"study_design_scores_gemma":[0.000016662076,0.000038594786,0.00006441768,0.000005509272,0.000007303334,0.000017689845,0.0000041043736,0.99477553,0.001620106,0.001318639,0.0021272216,0.0000042488145],"about_ca_topic_score_codex":0.0015728096,"about_ca_topic_score_gemma":0.0015295846,"teacher_disagreement_score":0.0015728096,"about_ca_system_score_codex":0.00038239305,"about_ca_system_score_gemma":0.0006420669,"threshold_uncertainty_score":0.004718423},"labels":[],"label_agreement":null},{"id":"W2006129815","doi":"10.1504/ijhpsa.2008.024206","title":"Particle swarm optimisation for the design of two-connected networks with bounded rings","year":2008,"lang":"en","type":"article","venue":"International Journal of High Performance Systems Architecture","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland","keywords":"Computer science; Particle swarm optimization; Bounded function; Swarm behaviour; Distributed computing; Mathematical optimization; Topology (electrical circuits); Parallel computing; Algorithm; Artificial intelligence; Mathematics","score_opus":0.023441447851446053,"score_gpt":0.25994354577197315,"score_spread":0.2365020979205271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006129815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02663073,0.00040751035,0.96744967,0.00019814933,0.00004304354,0.00009189026,0.000032824024,0.0001572278,0.004988852],"genre_scores_gemma":[0.6309332,0.0004913241,0.36198643,0.00008296181,0.00002718116,0.0004864779,0.00010074113,0.00008033958,0.0058113756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.00015410007,0.000015638409,0.000054145108,0.00010186142,0.000036454763],"domain_scores_gemma":[0.9991604,0.00053464185,0.000104887695,0.000041164094,0.000113558366,0.00004530107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001154984,0.0007499065,0.0008235572,0.00071245315,0.000523146,0.00102323,0.0009031851,0.0011424441,0.0018434199],"category_scores_gemma":[0.002639365,0.0005565107,0.00072455406,0.0004983594,0.00089863216,0.00071201974,0.0007781842,0.00073111936,0.000245656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014322799,0.000008807577,0.000102207036,0.000023482748,0.000009400998,0.000027356366,0.00001630684,0.9906144,0.00039059963,0.0045679165,0.00011465032,0.004110501],"study_design_scores_gemma":[0.000008622267,0.000012363708,0.000022017583,0.0000034488921,0.0000032242142,0.000004676994,0.000003981677,0.9977423,0.000117343756,0.0017580135,0.00032236302,0.0000016937221],"about_ca_topic_score_codex":0.0028304255,"about_ca_topic_score_gemma":0.0025638214,"teacher_disagreement_score":0.0028304255,"about_ca_system_score_codex":0.0009123307,"about_ca_system_score_gemma":0.0010841881,"threshold_uncertainty_score":0.006619394},"labels":[],"label_agreement":null},{"id":"W2007082296","doi":"10.1109/sis.2014.7011783","title":"MAX-SAT problem using evolutionary algorithms","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Evolutionary algorithm; Algorithm; Computer science; Estimation of distribution algorithm; Evolutionary computation; Domain (mathematical analysis); Similarity (geometry); Randomized algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.03233759690800255,"score_gpt":0.2895972199943828,"score_spread":0.2572596230863803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007082296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024119189,0.0011142149,0.9580685,0.0005029366,0.00012384912,0.00014899614,0.0001323002,0.0005619381,0.015228154],"genre_scores_gemma":[0.31114978,0.0009603307,0.6830439,0.00027800852,0.000107994965,0.00034173852,0.0005126831,0.00013556266,0.0034700218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988631,0.00045392165,0.000061615436,0.0001732257,0.00036590165,0.00008227949],"domain_scores_gemma":[0.99856466,0.0009949636,0.00009681649,0.00013529517,0.00017805921,0.000030223115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012829462,0.00074180803,0.0010930966,0.001015854,0.0006975673,0.0015951633,0.001397768,0.001406712,0.003387347],"category_scores_gemma":[0.0058757183,0.00038829297,0.0011740414,0.0019535006,0.0006705189,0.0018791201,0.0012278652,0.0011874541,0.0004703368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099775876,0.00012091755,0.0010492959,0.00031945246,0.00012122699,0.00009043396,0.0000994064,0.6861965,0.00263025,0.09244858,0.003783762,0.21304046],"study_design_scores_gemma":[0.000025627618,0.000027397626,0.00017900902,0.000027802258,0.000018425868,0.00005501074,0.000019787083,0.9620111,0.0009816342,0.033237625,0.0034095063,0.000007053552],"about_ca_topic_score_codex":0.0015342159,"about_ca_topic_score_gemma":0.00150615,"teacher_disagreement_score":0.003387347,"about_ca_system_score_codex":0.00091242674,"about_ca_system_score_gemma":0.00094921753,"threshold_uncertainty_score":0.011331856},"labels":[],"label_agreement":null},{"id":"W2008164953","doi":"10.1109/cec.2014.6900298","title":"Improved differential evolution with adaptive opposition strategy","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Differential evolution; Opposition (politics); Benchmark (surveying); Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.016420905085937684,"score_gpt":0.24460092149646467,"score_spread":0.228180016410527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008164953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029948147,0.00041571012,0.96150464,0.00011715907,0.00007761301,0.000044818702,0.000025618108,0.00018786998,0.007678338],"genre_scores_gemma":[0.7158439,0.00029091144,0.27701136,0.00017849449,0.000042130872,0.00016593277,0.00009192142,0.00006267659,0.0063126767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996697,0.00008604615,0.000014188472,0.000040994513,0.0001579674,0.000031081872],"domain_scores_gemma":[0.9997311,0.000121395045,0.000030972285,0.000027859072,0.00007305362,0.00001554479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005337516,0.00043762152,0.00085493276,0.000489476,0.00021409037,0.00050245906,0.0010037037,0.0006049604,0.0010067583],"category_scores_gemma":[0.0011445382,0.00020212155,0.00052877085,0.0004887883,0.0003982725,0.0004675909,0.0008227454,0.000588898,0.00020808994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009343079,0.00007720411,0.00090089487,0.00011151074,0.00007794287,0.00021067045,0.00009863243,0.79505795,0.014075994,0.0314017,0.0014702948,0.15642373],"study_design_scores_gemma":[0.000014720477,0.00003677592,0.000104367646,0.0000035420571,0.0000063844527,0.000049834744,0.000003596536,0.99538475,0.00086743466,0.0021894588,0.0013336731,0.0000054151546],"about_ca_topic_score_codex":0.00073918473,"about_ca_topic_score_gemma":0.00068686495,"teacher_disagreement_score":0.0010067583,"about_ca_system_score_codex":0.0003363799,"about_ca_system_score_gemma":0.0003103293,"threshold_uncertainty_score":0.0033679008},"labels":[],"label_agreement":null},{"id":"W2009993782","doi":"10.1109/tevc.2015.2395091","title":"Evolutionary Nonlinear Projection","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Evolutionary algorithm; Evolutionary computation; Cluster analysis; Artificial intelligence; Projection (relational algebra); Computer science; Population; Feature vector; Set (abstract data type); Nonlinear system; Optimization problem; Algorithm; Pattern recognition (psychology); Mathematics","score_opus":0.0480719819969123,"score_gpt":0.3045901847150168,"score_spread":0.2565182027181045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009993782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0241883,0.0011698105,0.9413253,0.0006282492,0.00020676029,0.0001179833,0.00008563362,0.00021728448,0.03206072],"genre_scores_gemma":[0.528529,0.002367075,0.42859834,0.0004122526,0.00019485081,0.0004973944,0.0002715655,0.00021260728,0.038916916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943525,0.00017120011,0.000021845945,0.00010450123,0.00021954728,0.00004764558],"domain_scores_gemma":[0.9991635,0.00044573093,0.0000735476,0.00010896678,0.0001672312,0.000041109026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000910613,0.0008132965,0.00081145874,0.0006498372,0.00071276724,0.0011335879,0.00087765395,0.0008660598,0.00463952],"category_scores_gemma":[0.0039012101,0.0003369128,0.00071740564,0.0007407495,0.0011593649,0.0011288143,0.0020025403,0.00095312437,0.0007608301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088872606,0.00009115081,0.001744877,0.00024250182,0.00011167116,0.00029523377,0.00023726454,0.6265291,0.005472073,0.16216993,0.0029436857,0.20007367],"study_design_scores_gemma":[0.000016935397,0.00008776166,0.00048422773,0.000032830656,0.00001925481,0.00020728946,0.00006189213,0.9383936,0.0016120134,0.04686067,0.012200361,0.000023222412],"about_ca_topic_score_codex":0.0018365162,"about_ca_topic_score_gemma":0.0014687162,"teacher_disagreement_score":0.00463952,"about_ca_system_score_codex":0.0008518164,"about_ca_system_score_gemma":0.0008698886,"threshold_uncertainty_score":0.015520692},"labels":[],"label_agreement":null},{"id":"W2012114154","doi":"10.1109/coginf.2011.6016145","title":"Towards agent Swarm Optimization","year":2011,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Particle swarm optimization; Computer science; Mathematical optimization; Position (finance); Measure (data warehouse); Multi-swarm optimization; Swarm behaviour; Situated; Artificial intelligence; Algorithm; Mathematics; Data mining","score_opus":0.07652404965570282,"score_gpt":0.2875324003347756,"score_spread":0.2110083506790728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012114154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025786727,0.005757862,0.9626099,0.0027450563,0.0006510161,0.00006511952,0.00004399753,0.00017567888,0.02537271],"genre_scores_gemma":[0.17296274,0.018564554,0.77533376,0.001657183,0.0014872187,0.0006234578,0.00020637324,0.0002415582,0.028923169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993309,0.00031847527,0.000022189892,0.000095881136,0.00020055339,0.000032112635],"domain_scores_gemma":[0.9993414,0.00033056526,0.000056321664,0.000075493386,0.00014685233,0.000049215832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910003,0.0011983104,0.0009817778,0.00077336386,0.0005787006,0.0019672897,0.0010124217,0.002044094,0.0031110605],"category_scores_gemma":[0.0036125118,0.00042648482,0.00086046965,0.00077861483,0.0015584098,0.0015367563,0.0022287874,0.002835683,0.0016211979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028996272,0.000043149063,0.0004997073,0.0003510181,0.00009331732,0.000108172695,0.0002654829,0.2611402,0.0011005251,0.6485132,0.00942838,0.07842788],"study_design_scores_gemma":[0.000024051553,0.000052339343,0.00015485157,0.000112678616,0.000017633936,0.00006432436,0.000067188055,0.4557859,0.00046180832,0.47239548,0.07084269,0.000021108179],"about_ca_topic_score_codex":0.0014496807,"about_ca_topic_score_gemma":0.0009842953,"teacher_disagreement_score":0.0031110605,"about_ca_system_score_codex":0.0008384031,"about_ca_system_score_gemma":0.00088544417,"threshold_uncertainty_score":0.010407567},"labels":[],"label_agreement":null},{"id":"W2012131995","doi":"10.1109/nabic.2009.5393729","title":"Multi-colony parallel ant colony optimization on SMP and multi-core computers","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Metaheuristic; Parallel computing; Node (physics); Parallel metaheuristic; Core (optical fiber); Multi-core processor; Ant colony; Distributed computing; Shared memory; Artificial intelligence; Engineering","score_opus":0.08187221506420697,"score_gpt":0.33517232368065175,"score_spread":0.2533001086164448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012131995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14069077,0.00050847395,0.84734356,0.00028483442,0.000081666534,0.000072168405,0.000023518098,0.00076636893,0.010228669],"genre_scores_gemma":[0.5491507,0.00023100091,0.4464495,0.00005431593,0.000027130951,0.000121117286,0.00004756139,0.00009960555,0.003819062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994875,0.00023082616,0.000019892417,0.00004050652,0.00017855702,0.00004256917],"domain_scores_gemma":[0.99951303,0.00023629685,0.00003374979,0.000097439086,0.00009099461,0.0000285137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000517376,0.00033003,0.00046452644,0.00022023584,0.00031174466,0.00037694248,0.00089560193,0.00046352303,0.0012384723],"category_scores_gemma":[0.0015537462,0.00024608546,0.0003380505,0.000457054,0.00040112334,0.00054452615,0.00065220305,0.00060033007,0.0002689622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020099226,0.0000898959,0.0007851744,0.00014651254,0.000057801808,0.00021907323,0.00009057003,0.8452594,0.02115635,0.021563066,0.0016789417,0.10875217],"study_design_scores_gemma":[0.000014610582,0.000028216697,0.00012332083,0.000003156149,0.0000036948595,0.000020243717,0.000008357155,0.99306035,0.00266349,0.0031545262,0.0009177918,0.0000022316615],"about_ca_topic_score_codex":0.0021789311,"about_ca_topic_score_gemma":0.0023520677,"teacher_disagreement_score":0.0021789311,"about_ca_system_score_codex":0.000344018,"about_ca_system_score_gemma":0.0005292767,"threshold_uncertainty_score":0.004332423},"labels":[],"label_agreement":null},{"id":"W2012377985","doi":"10.5430/air.v1n2p99","title":"A hybrid agent based virtual organization for studying knowledge evolution in social systems","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Macro; Evolutionary algorithm; Artificial intelligence; Process (computing); Social system; Genetic algorithm; Multi-agent system; Cultural algorithm; Swarm intelligence; Machine learning; Particle swarm optimization; Meta-optimization","score_opus":0.2515909848228119,"score_gpt":0.4318724132390408,"score_spread":0.1802814284162289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012377985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060516723,0.0006649981,0.9251231,0.0004447693,0.00009033891,0.00023159338,0.00011758505,0.00015288743,0.012658076],"genre_scores_gemma":[0.6311559,0.00055040384,0.36237836,0.00010577675,0.000051424002,0.0006665587,0.00012501319,0.000037348553,0.0049292264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999252,0.00045166613,0.000027007176,0.000107829335,0.00010965302,0.000051665877],"domain_scores_gemma":[0.9990225,0.00054556056,0.00011563393,0.00014220571,0.00007077396,0.00010341592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009524825,0.00051277183,0.0006139767,0.0013087653,0.00095317117,0.0021411323,0.0013492062,0.00096631545,0.0019727855],"category_scores_gemma":[0.0021684521,0.00025740298,0.0009734242,0.00091023254,0.00137415,0.0017670493,0.0017270402,0.0007995668,0.00021371427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007534887,0.00015008339,0.002924039,0.00013511248,0.00022552714,0.00033571236,0.0005654575,0.5872219,0.0041516847,0.37117785,0.00083937496,0.032197915],"study_design_scores_gemma":[0.000021792956,0.000058450158,0.00039840143,0.00001735661,0.00002361611,0.000055964218,0.00010842565,0.9410686,0.00045425468,0.054152895,0.0036257296,0.000014630974],"about_ca_topic_score_codex":0.002911756,"about_ca_topic_score_gemma":0.0017146252,"teacher_disagreement_score":0.002911756,"about_ca_system_score_codex":0.0012565689,"about_ca_system_score_gemma":0.0009722455,"threshold_uncertainty_score":0.009117126},"labels":[],"label_agreement":null},{"id":"W2012552818","doi":"10.5539/cis.v1n4p139","title":"A New Approach for Data Clustering Based on PSO with Local Search","year":2008,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Particle swarm optimization; Computer science; Context (archaeology); Local optimum; Data mining; Cluster (spacecraft); Mathematical optimization; Swarm behaviour; Local search (optimization); Process (computing); Multi-swarm optimization; TRACE (psycholinguistics); Artificial intelligence; Machine learning; Mathematics","score_opus":0.08463517590009528,"score_gpt":0.3103042688114249,"score_spread":0.22566909291132964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012552818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009175881,0.000110137036,0.99780196,0.00007093459,0.000059816826,0.000030341285,0.000009436727,0.00020099178,0.0007988061],"genre_scores_gemma":[0.080925785,0.0004713819,0.91381395,0.00020899718,0.00015763287,0.00036541276,0.00012646255,0.00015671627,0.0037736003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.00017730633,0.00004607824,0.000171774,0.00031449838,0.000035116915],"domain_scores_gemma":[0.99953055,0.00015823248,0.000050263137,0.00007192498,0.00015914762,0.000029804556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008372515,0.0010016322,0.001662845,0.0011563447,0.00061953004,0.0011011878,0.0015226927,0.0012680794,0.0013834165],"category_scores_gemma":[0.0019088872,0.00053619564,0.0012694122,0.0013252496,0.0006920996,0.0014252763,0.0012266682,0.0014956318,0.0007507041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009921066,0.00015672449,0.0011644681,0.0003678443,0.00039091674,0.00028743484,0.00028518823,0.58587694,0.015846232,0.04795193,0.007847659,0.33972538],"study_design_scores_gemma":[0.000020805957,0.00005122364,0.00015852923,0.000010437724,0.000019089359,0.000080176666,0.000013889248,0.9881445,0.0012192759,0.0055018505,0.004762817,0.000017329137],"about_ca_topic_score_codex":0.0022468476,"about_ca_topic_score_gemma":0.002053049,"teacher_disagreement_score":0.0022468476,"about_ca_system_score_codex":0.0005229209,"about_ca_system_score_gemma":0.0006718852,"threshold_uncertainty_score":0.0046280026},"labels":[],"label_agreement":null},{"id":"W2012831795","doi":"10.1109/cec.2012.6256497","title":"Particle swarm optimization with pbest crossover","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Crossover; Particle swarm optimization; Attractor; Multi-swarm optimization; Population; Mathematical optimization; Computer science; Metaheuristic; Swarm intelligence; Local optimum; Swarm behaviour; Genetic algorithm; Artificial intelligence; Mathematics","score_opus":0.022750967383062638,"score_gpt":0.27503496686841705,"score_spread":0.2522839994853544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012831795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009982732,0.0012659578,0.9625801,0.00027927966,0.00030024035,0.00030062857,0.00025120802,0.0021446908,0.022895234],"genre_scores_gemma":[0.18762153,0.001532581,0.7772935,0.00031385804,0.00019174635,0.0009804043,0.0008809908,0.000494597,0.030690853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993036,0.00019083146,0.000043262593,0.00012830942,0.0002633974,0.000070597474],"domain_scores_gemma":[0.99958414,0.00013242196,0.000036202393,0.000090518806,0.00013477477,0.00002191995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085812714,0.00096500583,0.0015028935,0.0007972905,0.00082575553,0.0012663159,0.0012920339,0.0016002594,0.00522128],"category_scores_gemma":[0.002491181,0.00050586625,0.0008776949,0.0014239,0.0005567545,0.0009849177,0.0011827501,0.0015576584,0.0024977694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029802695,0.00027815113,0.0011556057,0.00042916162,0.00021505395,0.0002929507,0.0001800878,0.56379247,0.0065174573,0.059329126,0.021390326,0.3461216],"study_design_scores_gemma":[0.00014811398,0.00018194874,0.0005323108,0.000057107874,0.000060752765,0.00023457698,0.000024626901,0.92615724,0.005233012,0.019692918,0.047635954,0.0000414995],"about_ca_topic_score_codex":0.0029473647,"about_ca_topic_score_gemma":0.0020947033,"teacher_disagreement_score":0.00522128,"about_ca_system_score_codex":0.0004301149,"about_ca_system_score_gemma":0.0011075906,"threshold_uncertainty_score":0.017466903},"labels":[],"label_agreement":null},{"id":"W2013517059","doi":"10.1016/j.ins.2014.04.013","title":"Multi-strategy ensemble artificial bee colony algorithm","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":260,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Artificial bee colony algorithm; Evolutionary algorithm; Set (abstract data type); Process (computing); Population; Algorithm; Local search (optimization); Search algorithm; Artificial intelligence; Mathematics","score_opus":0.06196425370856051,"score_gpt":0.3306889462073624,"score_spread":0.2687246924988019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013517059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09833131,0.0015611735,0.8795939,0.0004098226,0.00036874923,0.00011836058,0.00009930953,0.00042784453,0.019089492],"genre_scores_gemma":[0.7928898,0.0005006984,0.19884439,0.00024358564,0.00012153264,0.00021324336,0.00021198843,0.00006807722,0.006906664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947995,0.00015750572,0.000028588913,0.00007359243,0.00018747896,0.00007279148],"domain_scores_gemma":[0.9993641,0.00024037434,0.000051504794,0.00006193425,0.00023185172,0.000050363342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009204742,0.0007020808,0.0015484543,0.0007691423,0.00074055785,0.0008479543,0.0014397674,0.0012021076,0.0022968769],"category_scores_gemma":[0.0018180021,0.00031418775,0.0007548299,0.0008604624,0.00031203695,0.0010786117,0.0009490675,0.0007558492,0.0004183741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019661972,0.00021117987,0.0019081386,0.00008293276,0.0002528611,0.00011068892,0.00005886094,0.8224668,0.0036910786,0.008134837,0.0035069224,0.1593791],"study_design_scores_gemma":[0.000009412244,0.000030803432,0.00015191014,0.0000035731837,0.000016762746,0.000018399269,0.0000053707818,0.9983741,0.00026842402,0.0008254054,0.00029175717,0.000003985931],"about_ca_topic_score_codex":0.0022353064,"about_ca_topic_score_gemma":0.0028145595,"teacher_disagreement_score":0.0022968769,"about_ca_system_score_codex":0.00044959242,"about_ca_system_score_gemma":0.0007013408,"threshold_uncertainty_score":0.007683754},"labels":[],"label_agreement":null},{"id":"W2013520941","doi":"10.1088/1742-6596/540/1/012007","title":"High-Dimensional Adaptive Particle Swarm Optimization on Heterogeneous Systems","year":2014,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; Particle swarm optimization; Context (archaeology); Parallel computing; Parallelism (grammar); Task (project management); Supercomputer; Distributed computing; Multi-core processor; Data parallelism; Machine learning","score_opus":0.0325976283646544,"score_gpt":0.2552733162037131,"score_spread":0.22267568783905867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013520941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2195321,0.0007482311,0.76533794,0.00075767864,0.00016205477,0.00010482489,0.00007281339,0.00024826592,0.013036116],"genre_scores_gemma":[0.9023019,0.00037029115,0.09346255,0.00010797634,0.000065593966,0.00012326629,0.00010027769,0.000050022572,0.003418165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999635,0.00016325913,0.000015996306,0.00005908277,0.000080776445,0.00004589949],"domain_scores_gemma":[0.9993315,0.0003842249,0.000068103116,0.00007117774,0.000088279536,0.000056745455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008944281,0.00057995267,0.000899755,0.000427425,0.0006227704,0.0012613661,0.00080660614,0.00095104985,0.00084631203],"category_scores_gemma":[0.0022093747,0.0003878579,0.00069765834,0.0005875035,0.00092149206,0.0008295129,0.0012044682,0.0008072682,0.00014872866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002284003,0.000017705344,0.0004039177,0.0000149814,0.000023521246,0.000059152033,0.000019034831,0.99197453,0.00073306065,0.0032969913,0.00020603741,0.0032282583],"study_design_scores_gemma":[0.0000048190996,0.0000060833263,0.00008080111,9.444021e-7,0.0000017867538,0.000002760441,0.0000057750767,0.9986651,0.00008667214,0.0010274188,0.000116525494,0.0000012731718],"about_ca_topic_score_codex":0.0067943614,"about_ca_topic_score_gemma":0.0040377364,"teacher_disagreement_score":0.0067943614,"about_ca_system_score_codex":0.0007954543,"about_ca_system_score_gemma":0.00070203224,"threshold_uncertainty_score":0.013509631},"labels":[],"label_agreement":null},{"id":"W2014190703","doi":"10.1145/1830483.1830683","title":"Parallel FPGA-based implementation of scatter search","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Speedup; Field-programmable gate array; Heuristics; Parallel computing; Software; Parallelism (grammar); Population; Heuristic; Computer engineering; Computer architecture; Computer hardware; Programming language; Artificial intelligence; Operating system","score_opus":0.02962268605901686,"score_gpt":0.35463338451019805,"score_spread":0.3250106984511812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014190703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14500521,0.0005648918,0.78747755,0.00033618955,0.00026576882,0.00027576034,0.00058709795,0.017794661,0.047692806],"genre_scores_gemma":[0.70178384,0.00015213285,0.28790134,0.00018334335,0.000032007938,0.00017644557,0.00051441445,0.0002135859,0.009042865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978286,0.00003313646,0.000013734006,0.000041595107,0.000083955696,0.000044768087],"domain_scores_gemma":[0.9996762,0.000097191965,0.000030949566,0.0000697885,0.00010410313,0.000021713568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018514576,0.00045655193,0.0003000068,0.000510809,0.00025377405,0.0005574716,0.000995728,0.00037534718,0.010210818],"category_scores_gemma":[0.0006019036,0.0001706528,0.00019586492,0.000545967,0.00018683849,0.00042004453,0.00029867972,0.0003575418,0.0017837121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014780809,0.00035657437,0.004684852,0.0004702071,0.00013398306,0.0008002727,0.00019581866,0.3371555,0.09149083,0.020112082,0.03003218,0.51308954],"study_design_scores_gemma":[0.00026427404,0.0005455156,0.0014588414,0.00003721507,0.000047315934,0.00042500236,0.000042919706,0.8997761,0.06198815,0.003934451,0.031443678,0.000036541587],"about_ca_topic_score_codex":0.0031655214,"about_ca_topic_score_gemma":0.0034297411,"teacher_disagreement_score":0.010210818,"about_ca_system_score_codex":0.00046162854,"about_ca_system_score_gemma":0.00063148624,"threshold_uncertainty_score":0.034158587},"labels":[],"label_agreement":null},{"id":"W2014633436","doi":"10.1145/1068009.1068279","title":"Isolating the benefits of respect","year":2005,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Simulated annealing; Computer science; Genetic algorithm; Focus (optics); Adaptive simulated annealing; Mathematical optimization; Annealing (glass); Distributed computing; Algorithm; Artificial intelligence; Machine learning; Mathematics; Materials science; Physics","score_opus":0.03724486213064473,"score_gpt":0.29762954155802995,"score_spread":0.26038467942738525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014633436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88170874,0.0007917915,0.033251155,0.0009070854,0.00023096654,0.00018106725,0.00024104674,0.0005406644,0.082147494],"genre_scores_gemma":[0.9875315,0.00015832923,0.008132955,0.0001862744,0.000011868057,0.000052952382,0.000117740885,0.000119309334,0.0036890088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854624,0.0006018019,0.00010084241,0.00020700716,0.00041247712,0.00013174173],"domain_scores_gemma":[0.98733485,0.008514068,0.0008715986,0.00226487,0.000661426,0.00035323267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015740058,0.00039514856,0.00044344898,0.0003684261,0.00083815394,0.0013770649,0.0006865763,0.0007908119,0.01130542],"category_scores_gemma":[0.013840454,0.00019414428,0.00027872794,0.00044655605,0.0010054389,0.0023063854,0.0014162173,0.00117826,0.0013162832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008841773,0.0041667707,0.028374547,0.0028639543,0.0002823309,0.0009223747,0.00616648,0.04407715,0.3183646,0.1406675,0.011602611,0.43367004],"study_design_scores_gemma":[0.0011302629,0.018938774,0.05271785,0.00081074686,0.0008851921,0.0033132457,0.007151927,0.14288841,0.42545056,0.15980509,0.18657918,0.00032884246],"about_ca_topic_score_codex":0.00055283343,"about_ca_topic_score_gemma":0.0008454887,"teacher_disagreement_score":0.01130542,"about_ca_system_score_codex":0.00048168734,"about_ca_system_score_gemma":0.0004862932,"threshold_uncertainty_score":0.0378204},"labels":[],"label_agreement":null},{"id":"W2015047009","doi":"10.1016/j.neunet.2007.04.009","title":"Multi-objective evolutionary optimization for constructing neural networks for virtual reality visual data mining: Application to geophysical prospecting","year":2007,"lang":"en","type":"article","venue":"Neural Networks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Artificial neural network; Computer science; Genetic programming; Artificial intelligence; Set (abstract data type); Principal component analysis; Genetic algorithm; Multi-objective optimization; Pattern recognition (psychology); Data mining; Machine learning","score_opus":0.04843541151773481,"score_gpt":0.3534208836653585,"score_spread":0.3049854721476237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015047009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024205554,0.0002734569,0.97355515,0.00016767561,0.000033021788,0.000043549993,0.000027660395,0.00013990302,0.0015540193],"genre_scores_gemma":[0.4170703,0.00024917605,0.579519,0.000116739364,0.00003536047,0.00029469663,0.00009079645,0.000109605644,0.0025144827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997129,0.0001250894,0.00001856715,0.00004896348,0.00007027165,0.000024124045],"domain_scores_gemma":[0.9985618,0.0010104947,0.00010389638,0.000053757045,0.0002314229,0.000038643644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017493947,0.0010992651,0.0010742366,0.0010646381,0.0006384611,0.0010408087,0.0012889643,0.002264892,0.0015134498],"category_scores_gemma":[0.004989584,0.00082658994,0.00094487926,0.0010387384,0.000852914,0.0011240377,0.0010608298,0.001345121,0.00024050433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016981829,0.000020502523,0.0001422309,0.000018069391,0.000016262538,0.000020424986,0.000020033389,0.9799882,0.0003809223,0.0016724801,0.0001244671,0.01757937],"study_design_scores_gemma":[0.000002445215,0.000003744536,0.000016319236,0.0000014828532,0.0000017791897,0.0000023034681,0.0000019616214,0.99944586,0.00008837969,0.00040585027,0.000028790402,0.0000011263409],"about_ca_topic_score_codex":0.007856773,"about_ca_topic_score_gemma":0.0065724016,"teacher_disagreement_score":0.007856773,"about_ca_system_score_codex":0.0011015135,"about_ca_system_score_gemma":0.00092621887,"threshold_uncertainty_score":0.015622139},"labels":[],"label_agreement":null},{"id":"W2015350910","doi":"10.1145/2001858.2002100","title":"Pricing transmission rights using ant colony optimization","year":2011,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Heuristic; Transmission (telecommunications); Mathematical optimization; Optimization algorithm; Optimization problem; Artificial intelligence; Algorithm; Telecommunications; Mathematics","score_opus":0.06836078390450274,"score_gpt":0.28813823565504015,"score_spread":0.21977745175053742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015350910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013046718,0.00036885217,0.9755722,0.00054468383,0.000120757395,0.000057384514,0.00001937833,0.00013000441,0.010140017],"genre_scores_gemma":[0.6599356,0.0007898435,0.32830182,0.00020801219,0.00017019612,0.00014257216,0.000052495,0.00010906063,0.010290518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993175,0.00021559908,0.000025881376,0.0000688621,0.00032954034,0.000042627536],"domain_scores_gemma":[0.99933726,0.00031046968,0.00009940825,0.00008374687,0.00011197713,0.00005719156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066040276,0.0005082105,0.00088764634,0.000546478,0.00037203534,0.0016106601,0.0015102208,0.0015534001,0.0026424923],"category_scores_gemma":[0.0021991513,0.0003074976,0.00061398925,0.0009640428,0.0009367718,0.0024465385,0.00088195404,0.0011696595,0.0003563136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044952114,0.00010818185,0.00045979387,0.00007198971,0.00006867217,0.00020967558,0.00006409477,0.7682577,0.004358685,0.15492646,0.0020454763,0.069384314],"study_design_scores_gemma":[0.000015370697,0.000024330568,0.00004832914,0.000003977648,0.000007935962,0.000033199376,0.0000059040112,0.97694343,0.00044106806,0.020473016,0.0019958485,0.000007511912],"about_ca_topic_score_codex":0.0011866852,"about_ca_topic_score_gemma":0.0010096398,"teacher_disagreement_score":0.0026424923,"about_ca_system_score_codex":0.00045723293,"about_ca_system_score_gemma":0.0005775446,"threshold_uncertainty_score":0.008839965},"labels":[],"label_agreement":null},{"id":"W2016472674","doi":"10.1239/jap/1261670682","title":"Geometric Convergence of Genetic Algorithms Under Tempered Random Restart","year":2009,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Mathematics; Algorithm; Convergence (economics); Population; Genetic algorithm; Rate of convergence; Mathematical optimization; Mutation; Class (philosophy); Computer science; Key (lock); Artificial intelligence","score_opus":0.02888184872187093,"score_gpt":0.27749243825187647,"score_spread":0.24861058953000553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016472674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06399696,0.0011949334,0.9239885,0.00042866243,0.00009706623,0.000058630758,0.00004912912,0.00037756775,0.009808533],"genre_scores_gemma":[0.866545,0.0012189309,0.12539805,0.0003413787,0.00015815208,0.00021621794,0.00017667015,0.00043016433,0.005515414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972051,0.0011752915,0.00012729825,0.0005148679,0.00069423096,0.00028318027],"domain_scores_gemma":[0.9893505,0.0069434717,0.001082955,0.0010026657,0.0012922445,0.00032818364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056186,0.0011900126,0.0015847131,0.0013750748,0.00084257487,0.0020228885,0.0016342587,0.0016416361,0.0015022848],"category_scores_gemma":[0.032808322,0.0005867754,0.0017215376,0.0009656248,0.0052442667,0.002528414,0.002721178,0.0024686204,0.0005374231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000136745,0.000020120668,0.00088325463,0.000057168327,0.000076175704,0.000114208,0.00015921291,0.76240695,0.0018505217,0.22282246,0.0006819323,0.010791265],"study_design_scores_gemma":[0.000022140435,0.00006154451,0.00021763478,0.000018366814,0.000020551053,0.000060614104,0.000015245964,0.87968737,0.0007849586,0.11851611,0.00057620497,0.00001923574],"about_ca_topic_score_codex":0.0023639447,"about_ca_topic_score_gemma":0.0008047425,"teacher_disagreement_score":0.0056186,"about_ca_system_score_codex":0.0025896293,"about_ca_system_score_gemma":0.0013024935,"threshold_uncertainty_score":0.029714346},"labels":[],"label_agreement":null},{"id":"W2016870475","doi":"10.1109/cec.2009.4983113","title":"The effect of preadaptation epoch length on performance in an exaptive genetic algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Epoch (astronomy); Genetic algorithm; Computer science; Fitness function; Algorithm; Mathematics; Mathematical optimization; Computer vision","score_opus":0.012996172075999271,"score_gpt":0.2831351118732784,"score_spread":0.2701389397972791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016870475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9313898,0.0002753869,0.0657706,0.00020641959,0.00003665954,0.000045533387,0.000019019808,0.00034699572,0.0019094732],"genre_scores_gemma":[0.98381054,0.000054241707,0.015741559,0.00003776,0.000006926827,0.000022543269,0.00001614286,0.00002470332,0.000285672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922764,0.00035011664,0.00006996139,0.00011674968,0.0001439479,0.00009172068],"domain_scores_gemma":[0.9926878,0.0051938863,0.00063474016,0.0007105415,0.0005634711,0.00020945969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024738996,0.00066748745,0.0004655782,0.00043954974,0.00037641803,0.0008537877,0.0008671692,0.0009015271,0.0006383912],"category_scores_gemma":[0.014408959,0.00022312345,0.00019586603,0.00033637698,0.00067115756,0.000878509,0.00063229445,0.0006729378,0.00014008577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006166981,0.0003499632,0.01368807,0.00007228128,0.000120869096,0.00014736706,0.0001831934,0.89391947,0.017415183,0.0012930173,0.00018988848,0.072004],"study_design_scores_gemma":[0.000117233845,0.0014158968,0.008176229,0.0000317141,0.00013423708,0.00013766074,0.00008879132,0.971321,0.016211245,0.0018627895,0.0004687449,0.00003435986],"about_ca_topic_score_codex":0.001038356,"about_ca_topic_score_gemma":0.0010159299,"teacher_disagreement_score":0.0024738996,"about_ca_system_score_codex":0.00047001298,"about_ca_system_score_gemma":0.000514605,"threshold_uncertainty_score":0.013083398},"labels":[],"label_agreement":null},{"id":"W2017351056","doi":"10.1142/s1469026815500029","title":"Collaborative Parallel Hybrid Metaheuristics on Graphics Processing Unit","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Parallel computing; Metaheuristic; Speedup; Graphics processing unit; CUDA; Parallel metaheuristic; Asynchronous communication; Simulated annealing; Instruction set; Multi-core processor; Algorithm","score_opus":0.06856806425648525,"score_gpt":0.3758262417399429,"score_spread":0.30725817748345763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017351056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025893642,0.0006232931,0.9554196,0.00030429894,0.00019208301,0.00011621726,0.00006808295,0.0025303205,0.014852428],"genre_scores_gemma":[0.33808976,0.0004358146,0.6521069,0.00028776223,0.00007857834,0.0005136579,0.00025903134,0.00030234572,0.007926113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995136,0.00015648842,0.000022834522,0.00008520786,0.00016407165,0.000057728135],"domain_scores_gemma":[0.9994671,0.00016754081,0.000041796502,0.0001492137,0.00013508103,0.000039268525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004943336,0.00080782484,0.0008035961,0.0005182645,0.00063842034,0.0012219201,0.0019597814,0.0012013974,0.0040704585],"category_scores_gemma":[0.0012482093,0.00032535952,0.0009928817,0.0011469114,0.0006111734,0.0007982642,0.0012170689,0.0012099238,0.0011448659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027769513,0.00014730636,0.0009671875,0.00017433208,0.00016521604,0.000357684,0.0001401852,0.78157544,0.01818748,0.03598759,0.009552601,0.15246722],"study_design_scores_gemma":[0.000042490825,0.00005094995,0.00014338303,0.000007144075,0.000016248781,0.00003705278,0.000012665465,0.98392093,0.0022360045,0.007178103,0.006344569,0.0000103184975],"about_ca_topic_score_codex":0.004907983,"about_ca_topic_score_gemma":0.004227816,"teacher_disagreement_score":0.004907983,"about_ca_system_score_codex":0.00089044817,"about_ca_system_score_gemma":0.0009189393,"threshold_uncertainty_score":0.013617039},"labels":[],"label_agreement":null},{"id":"W2017871062","doi":"10.1145/1389095.1389313","title":"Comparing genetic algorithm and guided local search methods by symmetric TSP instances","year":2008,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Genetic algorithm; Computer science; Local search (optimization); Mathematical optimization; Heuristic; Algorithm; Reciprocal; Tournament; Local optimum; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.08553397280728181,"score_gpt":0.3644186847723492,"score_spread":0.27888471196506737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017871062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7869319,0.005162444,0.1768265,0.0010127262,0.00019555438,0.0002704705,0.00029210662,0.00083966996,0.028468596],"genre_scores_gemma":[0.8849817,0.0010473941,0.11149601,0.00013534143,0.000046675694,0.000164108,0.0002983485,0.00012525883,0.0017051836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979966,0.0012266993,0.00007489847,0.00012293068,0.00047536,0.0001033515],"domain_scores_gemma":[0.9924769,0.005878643,0.0003394825,0.00056161714,0.0006063016,0.00013711063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034805553,0.0005931618,0.00092606014,0.0028918874,0.00041032265,0.0010128991,0.0011677836,0.0013418243,0.0011111589],"category_scores_gemma":[0.011056638,0.00023619908,0.00074723817,0.003066755,0.0006547406,0.0012981126,0.00069065235,0.0006574428,0.00021837653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033471183,0.00022101255,0.0021622577,0.00018186429,0.00015723771,0.000044528297,0.000066417044,0.9018362,0.0006492167,0.009759351,0.0011955907,0.08339159],"study_design_scores_gemma":[0.00006422665,0.00027998257,0.00081283145,0.000016914151,0.00003104116,0.000033017343,0.00004995636,0.99415034,0.00085307774,0.0029504881,0.000747648,0.000010465283],"about_ca_topic_score_codex":0.0056290505,"about_ca_topic_score_gemma":0.0056282394,"teacher_disagreement_score":0.0056290505,"about_ca_system_score_codex":0.0014008385,"about_ca_system_score_gemma":0.0011639656,"threshold_uncertainty_score":0.018407166},"labels":[],"label_agreement":null},{"id":"W2017926151","doi":"10.1115/detc2013-12665","title":"Improved Trust Region Based MPS Method for High-Dimensional Expensive Black-Box Problems","year":2013,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Black box; Computer science; Curse of dimensionality; Suite; Mathematical optimization; Sampling (signal processing); Trust region; High dimensional; Algorithm; Mathematics; Artificial intelligence","score_opus":0.031288293869971694,"score_gpt":0.2941774906111114,"score_spread":0.26288919674113975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017926151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009487132,0.00025044143,0.98839253,0.0000802544,0.000029251672,0.000041476873,0.00001925336,0.00024549017,0.0014541817],"genre_scores_gemma":[0.37595814,0.0003622624,0.61882603,0.00016810223,0.00007343821,0.00035276302,0.00014129191,0.00024246529,0.0038755657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917763,0.00038864213,0.000028995171,0.00007616159,0.00025745016,0.0000712253],"domain_scores_gemma":[0.99748945,0.0017538718,0.00016898393,0.0001372855,0.00035604366,0.00009442723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019927893,0.0009106464,0.001613549,0.00080070936,0.0004506952,0.0007964244,0.0016754518,0.0012048802,0.0024034097],"category_scores_gemma":[0.004817133,0.00066081516,0.0011625777,0.0006776542,0.00086564064,0.00095888914,0.0011599073,0.001357746,0.0004637062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011527013,0.000038529328,0.00048242824,0.00008426509,0.000060536346,0.00008247528,0.00007196415,0.9438424,0.0021733986,0.010404299,0.0010199287,0.04162451],"study_design_scores_gemma":[0.000007670533,0.00001535549,0.000025707935,0.0000030858919,0.0000036457081,0.000008314953,0.0000024364713,0.9984615,0.00028689217,0.00093302235,0.0002500512,0.0000023288205],"about_ca_topic_score_codex":0.004779385,"about_ca_topic_score_gemma":0.0030809504,"teacher_disagreement_score":0.004779385,"about_ca_system_score_codex":0.0007744517,"about_ca_system_score_gemma":0.0015222998,"threshold_uncertainty_score":0.010538995},"labels":[],"label_agreement":null},{"id":"W2018626130","doi":"10.1007/s00500-013-1195-3","title":"Enhancing differential evolution with role assignment scheme","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Benchmark (surveying); Differential evolution; A priori and a posteriori; Scheme (mathematics); Evolutionary algorithm; Computer science; Mutation; Evolutionary computation; Range (aeronautics); Process (computing); Population; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Engineering","score_opus":0.008135173854654523,"score_gpt":0.23140603069803328,"score_spread":0.22327085684337877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018626130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07405202,0.00019748296,0.91170114,0.00031104288,0.00013590135,0.000084966494,0.000020204963,0.00012062938,0.013376564],"genre_scores_gemma":[0.78444666,0.00016830457,0.20634836,0.00013178516,0.000033390108,0.000126637,0.000029767247,0.0000403502,0.008674738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978274,0.00007933172,0.000006794145,0.000026985595,0.00007609732,0.00002806778],"domain_scores_gemma":[0.99969304,0.00014223278,0.000028042119,0.00004271955,0.000061896775,0.000032126263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062984595,0.0003724935,0.00041755612,0.00042496662,0.00035852773,0.00046927412,0.0010209107,0.00067338784,0.002583021],"category_scores_gemma":[0.0017688399,0.00016662544,0.00030980754,0.00040975006,0.0004831278,0.0007066163,0.00092720607,0.00051584776,0.00025671526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001393872,0.00021314112,0.00096914766,0.00012062071,0.00003824024,0.000117823045,0.00015450947,0.6893065,0.02259165,0.15181977,0.0018150926,0.13271412],"study_design_scores_gemma":[0.00001625162,0.000041262432,0.000080528385,0.000003936874,0.0000067281962,0.000028453313,0.00000967969,0.9915569,0.0013038628,0.0059586978,0.0009898079,0.000003836866],"about_ca_topic_score_codex":0.0007867639,"about_ca_topic_score_gemma":0.00067559845,"teacher_disagreement_score":0.002583021,"about_ca_system_score_codex":0.00044413516,"about_ca_system_score_gemma":0.0004065485,"threshold_uncertainty_score":0.008641064},"labels":[],"label_agreement":null},{"id":"W201929260","doi":"10.5220/0001703002880294","title":"AN EFFICIENT HYBRID METHOD FOR CLUSTERING PROBLEMS","year":2008,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cluster analysis; Artificial intelligence","score_opus":0.055886619505874306,"score_gpt":0.3439156715610338,"score_spread":0.2880290520551595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201929260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005516737,0.0003057004,0.9907912,0.000086657994,0.00010846318,0.00004472187,0.00003801415,0.00034793056,0.002760596],"genre_scores_gemma":[0.11265035,0.0003486635,0.8780633,0.00013958989,0.00011048643,0.00037280278,0.00019054255,0.00021940604,0.007904897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946445,0.00015982028,0.000020561165,0.00006338094,0.0002476601,0.000044082684],"domain_scores_gemma":[0.99934393,0.00032945888,0.000034074124,0.00007118351,0.00018389862,0.00003737995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009082235,0.0009102612,0.0010373925,0.0013753131,0.00079021044,0.0009843755,0.0018918116,0.001676703,0.0042957556],"category_scores_gemma":[0.0014567142,0.0006355361,0.0010393328,0.0017932924,0.0005476207,0.0011852515,0.0013489428,0.0010194771,0.001057151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021220445,0.000112706955,0.00033996874,0.00023572797,0.00017521426,0.00009469134,0.000115423965,0.63675374,0.011307925,0.026858661,0.006090585,0.31770313],"study_design_scores_gemma":[0.000023575312,0.00003347278,0.00008227666,0.0000072735834,0.000017553803,0.000034683086,0.000010028416,0.9923459,0.0008632847,0.004345122,0.0022249515,0.0000117551845],"about_ca_topic_score_codex":0.0027559588,"about_ca_topic_score_gemma":0.0035577896,"teacher_disagreement_score":0.0042957556,"about_ca_system_score_codex":0.00060589524,"about_ca_system_score_gemma":0.00074299553,"threshold_uncertainty_score":0.014370799},"labels":[],"label_agreement":null},{"id":"W2022184750","doi":"10.1007/s11047-006-9025-5","title":"Evolution strategies with cumulative step length adaptation on the noisy parabolic ridge","year":2006,"lang":"en","type":"article","venue":"Natural Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Adaptation (eye); Ridge; Computer science; Mathematics; Statistical physics; Algorithm; Physics; Geology; Paleontology","score_opus":0.02355873132136673,"score_gpt":0.27680781757727196,"score_spread":0.25324908625590525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022184750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06272367,0.00035704594,0.9304913,0.0004016424,0.00007555106,0.000046269448,0.000019438494,0.00012819035,0.005756929],"genre_scores_gemma":[0.8052862,0.00029687365,0.18378715,0.00023223169,0.00008238375,0.00018124779,0.00004454377,0.000121229714,0.009968101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996736,0.00015139236,0.00001395524,0.000044146647,0.00008618291,0.00003081424],"domain_scores_gemma":[0.9990969,0.00051739434,0.00007886068,0.000091434806,0.00015510198,0.000060401184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012865014,0.00047386516,0.00088466407,0.00058281416,0.00043758505,0.0008579571,0.001314036,0.0015414233,0.001291163],"category_scores_gemma":[0.004122089,0.0005430823,0.0006812013,0.0004988665,0.0011424783,0.001068776,0.0014292274,0.0010570463,0.0002657786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006628791,0.000039776744,0.0004574415,0.00003616454,0.00004904667,0.00006580423,0.000086230604,0.92811346,0.002385881,0.047361143,0.00055013836,0.020788664],"study_design_scores_gemma":[0.0000066892026,0.000012813252,0.000037471873,0.000002399111,0.0000033181825,0.000006020377,0.0000034678017,0.9957218,0.00011282681,0.0039467146,0.00014283104,0.0000036023719],"about_ca_topic_score_codex":0.002386771,"about_ca_topic_score_gemma":0.0016287512,"teacher_disagreement_score":0.002386771,"about_ca_system_score_codex":0.0007432856,"about_ca_system_score_gemma":0.0006213099,"threshold_uncertainty_score":0.006803751},"labels":[],"label_agreement":null},{"id":"W2023026651","doi":"10.1145/2576768.2598280","title":"Identifying and exploiting the scale of a search space in particle swarm optimization","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Attraction; Particle swarm optimization; Convergence (economics); Local optimum; Context (archaeology); Cluster analysis; Mathematical optimization; Computer science; Swarm behaviour; Range (aeronautics); Modal; Scale (ratio); Task (project management); Metaheuristic; Local search (optimization); Exploit; Multi-swarm optimization; Local convergence; Mathematics; Artificial intelligence; Geography; Engineering; Iterative method","score_opus":0.037008208440620964,"score_gpt":0.2969969364756348,"score_spread":0.2599887280350138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023026651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028256612,0.000553564,0.96844697,0.00019076842,0.000026988371,0.000052524443,0.000017322805,0.00019511886,0.0022602498],"genre_scores_gemma":[0.6888594,0.00045148307,0.30935192,0.00007483946,0.00005943488,0.00016157185,0.000039943923,0.00007965479,0.0009217393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994881,0.0001971017,0.000030346911,0.000077014374,0.00017247481,0.000034802033],"domain_scores_gemma":[0.99805707,0.0012891825,0.00019449755,0.00020846611,0.00018952276,0.000061148276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016932011,0.00050970935,0.00062577595,0.00093975046,0.0005306261,0.0010040198,0.0007353577,0.0009420656,0.0006027923],"category_scores_gemma":[0.0067340345,0.00040551423,0.000568367,0.00064360927,0.0011342792,0.0014998534,0.001514472,0.0009858969,0.00015049535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008585213,0.000049710146,0.002583404,0.00016369726,0.000073233474,0.0001763982,0.00026476439,0.8616942,0.010808895,0.03246008,0.0008252847,0.09081438],"study_design_scores_gemma":[0.000007618279,0.000025731586,0.000560061,0.000011085196,0.000006720838,0.00002877577,0.00002409507,0.99026465,0.00084504095,0.007795406,0.00041767486,0.000013238425],"about_ca_topic_score_codex":0.002282663,"about_ca_topic_score_gemma":0.0018165178,"teacher_disagreement_score":0.002282663,"about_ca_system_score_codex":0.0005095352,"about_ca_system_score_gemma":0.0005700592,"threshold_uncertainty_score":0.008954644},"labels":[],"label_agreement":null},{"id":"W2023272781","doi":"10.1016/j.asoc.2014.11.059","title":"Efficient detection of faulty nodes with cuckoo search in t-diagnosable systems","year":2014,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Larus Technologies (Canada); University of Ottawa","funders":"","keywords":"Cuckoo search; Computer science; Cuckoo; Algorithm; Biology; Particle swarm optimization","score_opus":0.012887946652731748,"score_gpt":0.2466964863436767,"score_spread":0.23380853969094495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023272781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22689548,0.00053161586,0.7676065,0.00041303888,0.00007172641,0.00011646077,0.00007396783,0.0009964386,0.003294706],"genre_scores_gemma":[0.9617278,0.000056936908,0.037314955,0.000046123645,0.000007450655,0.000040307874,0.000039777,0.000049837276,0.00071687455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994898,0.000171255,0.000025180718,0.00009182352,0.00014209026,0.000079854835],"domain_scores_gemma":[0.99593157,0.0029230136,0.00038363138,0.00022726764,0.000439789,0.000094827825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087740173,0.0007724429,0.00081801583,0.0008383715,0.000609118,0.00071758893,0.0011761261,0.0010779795,0.0014062545],"category_scores_gemma":[0.0064003025,0.0003726981,0.00042761638,0.0004957691,0.0010090753,0.0008054329,0.0007808778,0.0006459225,0.00012977369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022744364,0.000036349982,0.001433341,0.00014343021,0.000042279466,0.00015120946,0.00008480642,0.94931793,0.006131694,0.0067344164,0.00050209375,0.035194933],"study_design_scores_gemma":[0.000007727603,0.000016919634,0.0001309349,0.0000057894727,0.0000055169617,0.000019022731,0.000008032692,0.99580884,0.0010900545,0.0028385092,0.00006527142,0.0000033180295],"about_ca_topic_score_codex":0.007095743,"about_ca_topic_score_gemma":0.006003092,"teacher_disagreement_score":0.007095743,"about_ca_system_score_codex":0.0010585553,"about_ca_system_score_gemma":0.0012119937,"threshold_uncertainty_score":0.014108896},"labels":[],"label_agreement":null},{"id":"W2023409871","doi":"10.1115/1.2803251","title":"Mode Pursuing Sampling Method for Discrete Variable Optimization on Expensive Black-Box Functions","year":2008,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematical optimization; Continuous variable; Sampling (signal processing); Discrete variable; Variable (mathematics); Black box; Mode (computer interface); Discrete space; Mathematics; Computer science; Algorithm; Control variable; Control (management); Control theory (sociology); Artificial intelligence; Statistics","score_opus":0.11295482548136972,"score_gpt":0.3639966378930159,"score_spread":0.2510418124116462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023409871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004778912,0.00006733949,0.9940713,0.000024940313,0.000014891944,0.000021269201,0.00000799168,0.000057643247,0.00095574954],"genre_scores_gemma":[0.28676826,0.0002552204,0.7096942,0.000089530826,0.000050584196,0.00030964482,0.00007075032,0.0000997612,0.002662056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.00017221256,0.000011990617,0.000038579485,0.00012674349,0.000023599074],"domain_scores_gemma":[0.99931276,0.00046430598,0.00004641619,0.000056832672,0.00008770165,0.000032023334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010893621,0.00064486056,0.0007988616,0.00055806676,0.0002636545,0.00047782014,0.0009242042,0.00059607567,0.002157313],"category_scores_gemma":[0.0020085375,0.00026793484,0.0006187771,0.00042702124,0.0006863932,0.0006622883,0.0007878045,0.00090552156,0.00028826078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015699376,0.00006981135,0.0007946734,0.00017851502,0.000060505652,0.00009510029,0.00009974679,0.7728902,0.013232317,0.08128288,0.0012001509,0.12993906],"study_design_scores_gemma":[0.0000091633065,0.0000305385,0.00004311678,0.0000037800116,0.0000030698413,0.0000127964595,0.00000248692,0.99525934,0.0009842679,0.003023185,0.0006243456,0.0000039756637],"about_ca_topic_score_codex":0.0011046723,"about_ca_topic_score_gemma":0.0009822994,"teacher_disagreement_score":0.002157313,"about_ca_system_score_codex":0.00041540328,"about_ca_system_score_gemma":0.0007305013,"threshold_uncertainty_score":0.007216871},"labels":[],"label_agreement":null},{"id":"W2023791340","doi":"10.1155/2014/318063","title":"Heterogeneous Differential Evolution for Numerical Optimization","year":2014,"lang":"en","type":"article","venue":"The Scientific World JOURNAL","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Science Foundation of Ministry of Education of China; State Key Laboratory of Software Engineering; Ministry of Education of the People's Republic of China; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Differential evolution; Computer science; Set (abstract data type); Mathematical optimization; Scheme (mathematics); Population; Optimization problem; Scale (ratio); Algorithm; Mathematics","score_opus":0.019937958922853834,"score_gpt":0.27062590338786224,"score_spread":0.2506879444650084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023791340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030249609,0.0041457633,0.98253375,0.0002736675,0.00016869219,0.00005184792,0.000048601054,0.00018071782,0.0095720105],"genre_scores_gemma":[0.38179067,0.009839851,0.59459966,0.00046562354,0.00040376064,0.0006737294,0.00030273446,0.00022362274,0.011700444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940205,0.00019520034,0.00003395394,0.000077237215,0.0002637411,0.000027805954],"domain_scores_gemma":[0.9995844,0.00022623503,0.000046631638,0.000050068964,0.00007779871,0.000014896083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008567774,0.00083654653,0.0008684331,0.0006836711,0.00033527883,0.00090673973,0.0008305581,0.0008602578,0.0018704836],"category_scores_gemma":[0.0023274235,0.00023391604,0.0006644717,0.0013942098,0.00086769566,0.0007076218,0.0011103606,0.0014586117,0.0005884708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004598926,0.000043829725,0.00067844713,0.00041935427,0.00010700036,0.00016601775,0.000092807444,0.63326323,0.0069180755,0.22634423,0.0039506033,0.12797044],"study_design_scores_gemma":[0.000014165143,0.000028101415,0.00014776319,0.000037925463,0.000015191965,0.00004442833,0.0000071234417,0.93971413,0.001225032,0.045492485,0.013260562,0.0000131625675],"about_ca_topic_score_codex":0.0011972272,"about_ca_topic_score_gemma":0.00081664504,"teacher_disagreement_score":0.0018704836,"about_ca_system_score_codex":0.00093415007,"about_ca_system_score_gemma":0.0005708895,"threshold_uncertainty_score":0.0067777634},"labels":[],"label_agreement":null},{"id":"W2026243033","doi":"10.1260/1748-3018.9.2.143","title":"Quantum-Behaved Particle Swarm Optimization with Novel Adaptive Strategies","year":2015,"lang":"en","type":"article","venue":"Journal of Algorithms & Computational Technology","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Multi-swarm optimization; Position (finance); Attractor; Metaheuristic; Mathematical optimization; Swarm behaviour; Computer science; Swarm intelligence; Global optimization; Mathematics; Algorithm","score_opus":0.05256136336976503,"score_gpt":0.3081965978010415,"score_spread":0.2556352344312765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026243033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021909136,0.0005200941,0.9729028,0.00015736293,0.000067742556,0.000046117002,0.000013400349,0.000121709476,0.004261649],"genre_scores_gemma":[0.79615366,0.0006445115,0.19965969,0.00018398414,0.000088231274,0.00022795926,0.000052193303,0.000041549953,0.002948122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967957,0.00010504562,0.00001897039,0.00004352519,0.0001282115,0.000024753004],"domain_scores_gemma":[0.99960965,0.00017132553,0.000059450125,0.00004174597,0.00009468951,0.0000231067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007506605,0.0005547429,0.0006971466,0.00044227118,0.00033711345,0.0007559785,0.0010393636,0.00090407673,0.0007115788],"category_scores_gemma":[0.0015499147,0.0003119421,0.00059101003,0.0005322767,0.0007057778,0.0007516215,0.0007929142,0.0005742153,0.00018260968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042358974,0.000052251657,0.0007668483,0.0000752815,0.00006596491,0.00010810906,0.00008384135,0.9057981,0.0051927273,0.036270756,0.0010088033,0.050534904],"study_design_scores_gemma":[0.000007637468,0.000021122447,0.00006690095,0.000002705863,0.0000056390563,0.0000147841165,0.0000030364313,0.99712664,0.00020145408,0.0021193775,0.0004262573,0.00000441922],"about_ca_topic_score_codex":0.0014188213,"about_ca_topic_score_gemma":0.0011403733,"teacher_disagreement_score":0.0014188213,"about_ca_system_score_codex":0.0003629243,"about_ca_system_score_gemma":0.0004967204,"threshold_uncertainty_score":0.0039699078},"labels":[],"label_agreement":null},{"id":"W2026267944","doi":"10.5267/j.ijiec.2012.03.007","title":"An elitist teaching-learning-based optimization algorithm for solving complex constrained optimization problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":504,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Computer science; Population; Algorithm; Mathematical optimization; Optimization algorithm; Population-based incremental learning; Range (aeronautics); Optimization problem; Process (computing); Artificial intelligence; Machine learning; Mathematics; Genetic algorithm; Engineering","score_opus":0.04507322606150652,"score_gpt":0.31449062254271937,"score_spread":0.2694173964812128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026267944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008518294,0.00027570495,0.9879352,0.00012630146,0.000049000726,0.00007599651,0.000017466982,0.00027256334,0.0027295314],"genre_scores_gemma":[0.23476027,0.0005423786,0.7571639,0.00031340853,0.000077158584,0.00077835383,0.00014257945,0.00011538621,0.0061065676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996537,0.000085407584,0.00002002318,0.00004765213,0.00015842458,0.000034874018],"domain_scores_gemma":[0.99956113,0.00024289529,0.000047478166,0.000021667154,0.0001033008,0.000023577886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010747465,0.0009416537,0.0012171749,0.0007087695,0.0006151241,0.0006145742,0.0016824516,0.0015202289,0.0020946595],"category_scores_gemma":[0.0018816424,0.00033927333,0.000597135,0.0010345717,0.0007498115,0.0007175222,0.001085282,0.0011410248,0.00038464373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052757914,0.00009325039,0.00047833912,0.00009760924,0.00006201752,0.000082988845,0.00007909946,0.86121136,0.0018595349,0.0073655294,0.0014955648,0.12712198],"study_design_scores_gemma":[0.000028857197,0.000030380923,0.000054233034,0.000007664867,0.000007178467,0.00002204525,0.0000057233806,0.9975489,0.0004079527,0.0011365712,0.00074618956,0.000004248342],"about_ca_topic_score_codex":0.004070561,"about_ca_topic_score_gemma":0.0051977965,"teacher_disagreement_score":0.004070561,"about_ca_system_score_codex":0.0007295218,"about_ca_system_score_gemma":0.001506249,"threshold_uncertainty_score":0.008093715},"labels":[],"label_agreement":null},{"id":"W2026308324","doi":"10.1145/1143997.1144123","title":"Multiobjective evolutionary optimization for visual data mining with virtual reality spaces","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Artificial intelligence; Classifier (UML); Machine learning; Knowledge extraction; Data mining; Pattern recognition (psychology)","score_opus":0.04712464955400414,"score_gpt":0.33500727094467003,"score_spread":0.2878826213906659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026308324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066661383,0.0003069061,0.9911772,0.00014492337,0.000019898433,0.00003926869,0.000015913813,0.000049733582,0.00158005],"genre_scores_gemma":[0.28899,0.0005996782,0.7063468,0.0001737302,0.00005722319,0.00060865143,0.00010936543,0.00007980891,0.003034729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991019,0.0004999354,0.0000408238,0.00009720747,0.00020898266,0.00005117235],"domain_scores_gemma":[0.99875855,0.0009014321,0.0001074691,0.000058357873,0.00012912597,0.000044958444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021910758,0.0011638991,0.0012208422,0.0013857847,0.00055140257,0.0014378635,0.0011816798,0.0013946247,0.0014363253],"category_scores_gemma":[0.0043901666,0.00057949184,0.0012296495,0.0011757206,0.0011909652,0.000895097,0.0016070235,0.0010398197,0.00021127812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013839708,0.00002125249,0.00015114712,0.000051417177,0.00003800608,0.000032498065,0.00004054471,0.9711287,0.0004301028,0.013555454,0.00017296395,0.014364044],"study_design_scores_gemma":[0.0000068390223,0.000016595202,0.000042627016,0.0000096448985,0.000005411035,0.0000107420055,0.000012460922,0.9924474,0.00015007214,0.0067823394,0.00051147887,0.000004399086],"about_ca_topic_score_codex":0.0025101355,"about_ca_topic_score_gemma":0.0016744831,"teacher_disagreement_score":0.0025101355,"about_ca_system_score_codex":0.0012685873,"about_ca_system_score_gemma":0.0008971534,"threshold_uncertainty_score":0.011587679},"labels":[],"label_agreement":null},{"id":"W2027681005","doi":"10.5220/0005068801840191","title":"Dynamic Heterogeneous Multi-Population Cultural Algorithm for Large Scale Global Optimization","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Scale (ratio); Population; Mathematical optimization; Mathematics; Geography; Medicine","score_opus":0.017301278083421905,"score_gpt":0.31532460182361655,"score_spread":0.29802332374019463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027681005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045387633,0.00038784795,0.9463427,0.00020405959,0.0001208908,0.000056597462,0.000027725026,0.00018902039,0.007283491],"genre_scores_gemma":[0.7035029,0.00026573223,0.2905401,0.00017967896,0.00007221405,0.0002939988,0.00010479821,0.00010509576,0.0049354993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964416,0.00015400072,0.0000134918855,0.00005077935,0.00009817527,0.000039419803],"domain_scores_gemma":[0.99922955,0.00040815686,0.00005517127,0.000096881515,0.00015053146,0.000059741753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010184951,0.000666132,0.00082322804,0.0007778132,0.00090616464,0.0010277272,0.0016542004,0.0011718823,0.0020549549],"category_scores_gemma":[0.0030292114,0.0003496707,0.0007122447,0.00081087434,0.0008104804,0.0011460149,0.001790714,0.0011656976,0.00028865875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060430062,0.00006830568,0.00043801035,0.000036661986,0.000065466906,0.00005863834,0.000061344246,0.9400528,0.0021668843,0.01783151,0.0011065509,0.03805344],"study_design_scores_gemma":[0.000009414293,0.0000120015575,0.00003639955,0.0000019004276,0.000005475176,0.000006620574,0.0000067914484,0.99776506,0.00015130492,0.0017953492,0.0002071992,0.000002464323],"about_ca_topic_score_codex":0.003487346,"about_ca_topic_score_gemma":0.003410229,"teacher_disagreement_score":0.003487346,"about_ca_system_score_codex":0.0008243223,"about_ca_system_score_gemma":0.0007738652,"threshold_uncertainty_score":0.0069341063},"labels":[],"label_agreement":null},{"id":"W2027723026","doi":"10.1117/12.542156","title":"Self-adaptive parameters in genetic algorithms","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Defence Research and Development Canada","funders":"","keywords":"Computer science; Algorithm; Genetic algorithm; Quality control and genetic algorithms; Context (archaeology); Range (aeronautics); Set (abstract data type); Chromosome; Resolution (logic); Artificial intelligence; Meta-optimization; Machine learning","score_opus":0.016124700050813512,"score_gpt":0.24519389518269608,"score_spread":0.22906919513188256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027723026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010005941,0.0016393341,0.97967255,0.00029654076,0.00008588972,0.00010570905,0.000032599502,0.00041873602,0.007742659],"genre_scores_gemma":[0.43920484,0.0024155758,0.5520957,0.00046400906,0.00014914942,0.0005458545,0.000104456754,0.00030554424,0.0047148676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988887,0.00049725804,0.00005710415,0.00017139802,0.00033363508,0.000051829164],"domain_scores_gemma":[0.99789774,0.0013381295,0.0002038209,0.00026266085,0.0002578332,0.000039860606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016940386,0.00071677624,0.0009244133,0.00092838303,0.0004832043,0.0015040876,0.0015149451,0.0017990343,0.0013899879],"category_scores_gemma":[0.008281578,0.0005123949,0.0005340447,0.001221943,0.0016985987,0.0019525003,0.0010481062,0.001822699,0.0005833357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037082715,0.000046021978,0.0008829485,0.00010731519,0.000066684246,0.00007972508,0.0002023421,0.812044,0.0031826084,0.09534838,0.0012981003,0.08670481],"study_design_scores_gemma":[0.000033064694,0.000049353148,0.00022483412,0.000068734604,0.000029002875,0.00008668441,0.000040782666,0.89190954,0.0020791832,0.094979785,0.0104606,0.00003846986],"about_ca_topic_score_codex":0.0015980279,"about_ca_topic_score_gemma":0.0011018655,"teacher_disagreement_score":0.0017990343,"about_ca_system_score_codex":0.000977383,"about_ca_system_score_gemma":0.0006828213,"threshold_uncertainty_score":0.008959055},"labels":[],"label_agreement":null},{"id":"W2028983148","doi":"10.3166/ria.16.367-382","title":"A Distributed Guided Genetic Algorithm for Max-CSPs","year":2002,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Genetic algorithm; Algorithm; Machine learning","score_opus":0.12672744075911443,"score_gpt":0.3253241602708092,"score_spread":0.19859671951169475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028983148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013277266,0.00033196405,0.9792742,0.000269082,0.00008469432,0.00009352152,0.00007746177,0.001328033,0.005263672],"genre_scores_gemma":[0.18102206,0.00040935143,0.8097592,0.00021494951,0.000056591565,0.00035276168,0.00028380955,0.0002496042,0.0076516457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996049,0.000097772165,0.0000137212455,0.00010086829,0.00012419146,0.000058631398],"domain_scores_gemma":[0.9996018,0.0002097543,0.00003036982,0.00004405503,0.00008144284,0.00003271339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007110179,0.0008803411,0.0009317692,0.0005962225,0.00069483573,0.0011111689,0.0017084195,0.0017991157,0.0043845614],"category_scores_gemma":[0.0018379899,0.0004005941,0.00063683337,0.0011665146,0.00068971404,0.0008883274,0.0012478282,0.0012478847,0.00084196136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017123621,0.00016482128,0.0006890167,0.00013499189,0.000061561914,0.00012082457,0.0001489617,0.7678123,0.0041034385,0.035711173,0.0054285727,0.18545319],"study_design_scores_gemma":[0.00010729776,0.000053251562,0.00008316939,0.000012534889,0.000014251122,0.000047352216,0.000022891682,0.9850321,0.0008765702,0.009162373,0.004580787,0.000007459982],"about_ca_topic_score_codex":0.007082599,"about_ca_topic_score_gemma":0.0083993245,"teacher_disagreement_score":0.007082599,"about_ca_system_score_codex":0.0011442205,"about_ca_system_score_gemma":0.0022693132,"threshold_uncertainty_score":0.014667749},"labels":[],"label_agreement":null},{"id":"W2032301555","doi":"10.1080/0305215x.2013.800057","title":"Modification of DIRECT for high-dimensional design problems","year":2013,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maxima and minima; Initialization; Subroutine; Curse of dimensionality; Mathematical optimization; Convergence (economics); Computer science; Premature convergence; Algorithm; Mathematics; Genetic algorithm; Artificial intelligence","score_opus":0.027829762872468914,"score_gpt":0.23952712347066998,"score_spread":0.21169736059820107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032301555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041415367,0.00028715265,0.95071507,0.00009404383,0.00006028916,0.00014240012,0.000057886424,0.0009062321,0.006321553],"genre_scores_gemma":[0.21285646,0.00015868775,0.783188,0.00010745761,0.0000224659,0.0003069906,0.00013699714,0.00021321315,0.0030098513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993808,0.00023233304,0.000036302124,0.00007051694,0.0002473986,0.00003254514],"domain_scores_gemma":[0.9986089,0.00062338955,0.00011966265,0.00031124087,0.00029172032,0.00004504835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009649406,0.00079623586,0.00070211623,0.00045397738,0.00030717062,0.0006347537,0.0011815621,0.0006882928,0.0033353055],"category_scores_gemma":[0.0025879792,0.00036049433,0.0005557379,0.000342168,0.00046068055,0.0005392578,0.0014421777,0.0009926652,0.00070871913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002688625,0.000352572,0.0038282592,0.00064163667,0.00012710616,0.00032187236,0.00024239579,0.47218764,0.042716064,0.018683748,0.004986191,0.4556436],"study_design_scores_gemma":[0.00007926062,0.00022518328,0.000711725,0.000028024122,0.000019080378,0.00036123968,0.000028382356,0.97144395,0.014138198,0.002952427,0.009991772,0.000020698426],"about_ca_topic_score_codex":0.0007739368,"about_ca_topic_score_gemma":0.0014824853,"teacher_disagreement_score":0.0033353055,"about_ca_system_score_codex":0.00022773475,"about_ca_system_score_gemma":0.0006560742,"threshold_uncertainty_score":0.0111576915},"labels":[],"label_agreement":null},{"id":"W2032385958","doi":"10.1109/icma.2014.6885702","title":"Comparison between differential evolution and particle swarm optimization algorithms","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Particle swarm optimization; Differential evolution; Benchmark (surveying); Robustness (evolution); Multi-swarm optimization; Mathematical optimization; Algorithm; Computer science; Swarm behaviour; Mathematics","score_opus":0.035081598719082036,"score_gpt":0.31398949959045425,"score_spread":0.2789079008713722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032385958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1313531,0.013676831,0.8219877,0.00078901206,0.0004888302,0.00015914036,0.00019929401,0.0010512237,0.030294899],"genre_scores_gemma":[0.72729784,0.004874104,0.26330325,0.0001989521,0.00012634134,0.00013383878,0.00039911733,0.00016425237,0.0035023303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982913,0.0005532857,0.00013791377,0.00014236369,0.00081407116,0.000061009065],"domain_scores_gemma":[0.9955753,0.0031176903,0.00018206568,0.00023435867,0.0008348824,0.00005563969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024482033,0.00049057207,0.0008206387,0.0017704125,0.0002867272,0.0011436298,0.0007126321,0.0008241939,0.0014676633],"category_scores_gemma":[0.008780641,0.00015135176,0.00040824775,0.0018270427,0.00037694248,0.001223211,0.0005904816,0.00043167823,0.00029428466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004374687,0.00018197995,0.0067641265,0.0008929971,0.0002649993,0.00018590504,0.00013642361,0.4770708,0.0051385593,0.026733791,0.0019443673,0.48024854],"study_design_scores_gemma":[0.000038489223,0.00026714677,0.0030858773,0.00005360124,0.00006663756,0.0001933481,0.00006461734,0.9774271,0.0053460854,0.0057766777,0.0076550953,0.000025263742],"about_ca_topic_score_codex":0.0014103713,"about_ca_topic_score_gemma":0.00077713083,"teacher_disagreement_score":0.0024482033,"about_ca_system_score_codex":0.0005826037,"about_ca_system_score_gemma":0.00043357073,"threshold_uncertainty_score":0.0129475},"labels":[],"label_agreement":null},{"id":"W2032658116","doi":"10.1155/2011/938240","title":"Evolutionary Computation and Its Applications in Neural and Fuzzy Systems","year":2011,"lang":"en","type":"article","venue":"Applied Computational Intelligence and Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Evolutionary programming; Evolutionary computation; Evolutionary algorithm; Metaheuristic; Mathematical optimization; Optimization problem; Genetic programming; Artificial neural network; Meta-optimization; Artificial intelligence; Interactive evolutionary computation; Simulated annealing; Machine learning; Algorithm; Mathematics","score_opus":0.05946061781252375,"score_gpt":0.295526399703519,"score_spread":0.23606578189099525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032658116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006151675,0.13887691,0.7652705,0.0060371105,0.0013771248,0.00009174227,0.00012266175,0.00024240097,0.08182989],"genre_scores_gemma":[0.37506667,0.14554559,0.4467461,0.0014840461,0.0037337532,0.00041772568,0.00022725467,0.0001484855,0.026630387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994035,0.00022737561,0.00004594789,0.0000864674,0.00020801046,0.000028693577],"domain_scores_gemma":[0.9991924,0.00058000884,0.000048053957,0.00005062694,0.00010646586,0.000022464195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008605607,0.0008805483,0.0011327178,0.0012991979,0.0006338128,0.0017519039,0.0007506573,0.002058004,0.0035724416],"category_scores_gemma":[0.0030167918,0.00034983509,0.0007667146,0.0028434424,0.0021574034,0.0016280783,0.0012376121,0.0022246568,0.00062004576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018528872,0.00002606867,0.0005750944,0.000549233,0.00007594722,0.00030674934,0.0002569777,0.11226473,0.0009750882,0.7242825,0.005296313,0.15537283],"study_design_scores_gemma":[0.000011006677,0.000032709228,0.0006483404,0.00025179604,0.000024862282,0.00028818,0.00009417657,0.19053328,0.00059786363,0.73248196,0.0750033,0.000032544285],"about_ca_topic_score_codex":0.00212297,"about_ca_topic_score_gemma":0.0013048962,"teacher_disagreement_score":0.0035724416,"about_ca_system_score_codex":0.0009217541,"about_ca_system_score_gemma":0.00069044903,"threshold_uncertainty_score":0.01195097},"labels":[],"label_agreement":null},{"id":"W2033093367","doi":"10.2478/mper-2014-0011","title":"Ant Colony Optimization for Data Acquisition Mission Planning","year":2014,"lang":"en","type":"article","venue":"Management and Production Engineering Review","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ant colony optimization algorithms; Computer science; Grid; Data acquisition; Data mining; Probabilistic logic; Graph; Trajectory; Mathematical optimization; Real-time computing; Artificial intelligence; Mathematics; Theoretical computer science","score_opus":0.04840702640377507,"score_gpt":0.31040760650009597,"score_spread":0.2620005800963209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033093367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007902414,0.003901684,0.9770504,0.0005146072,0.000097666074,0.00006355513,0.00005521445,0.00013486057,0.0102795735],"genre_scores_gemma":[0.5730495,0.005768118,0.40926307,0.00021086124,0.00016959116,0.00040433556,0.00019587534,0.00015494424,0.010783717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996263,0.00017668723,0.00001527521,0.000051917814,0.00010626473,0.000023528703],"domain_scores_gemma":[0.9995153,0.0003011681,0.000058831916,0.000022301048,0.000081600134,0.000020810983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051068416,0.0007464308,0.0007413713,0.0005647698,0.00026939926,0.0008987551,0.0008511616,0.0008149318,0.0013300704],"category_scores_gemma":[0.0014085062,0.00040602082,0.00047814456,0.001181058,0.00066690403,0.00047234897,0.0006249445,0.0009968688,0.00024222268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061614073,0.000010487626,0.000090452675,0.00005333975,0.0000211381,0.000024222636,0.000011967791,0.97092855,0.0003051276,0.012367472,0.0006413957,0.015539677],"study_design_scores_gemma":[0.0000033175033,0.000007654,0.000037620914,0.000008392359,0.0000033224617,0.000007857928,0.0000050088747,0.9919973,0.00008720413,0.00629857,0.001541489,0.0000022317358],"about_ca_topic_score_codex":0.0057415646,"about_ca_topic_score_gemma":0.0033330824,"teacher_disagreement_score":0.0057415646,"about_ca_system_score_codex":0.0008684476,"about_ca_system_score_gemma":0.00087450317,"threshold_uncertainty_score":0.011416316},"labels":[],"label_agreement":null},{"id":"W2033338535","doi":"10.1007/s12293-013-0129-z","title":"A bare-bones ant colony optimization algorithm that performs competitively on the sequential ordering problem","year":2014,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Missouri University of Science and Technology; University of Missouri; Intelligent Systems Center; National Science Foundation","keywords":"Ant colony optimization algorithms; Ant colony; Computer science; Algorithm; State (computer science); Complex system; ANT; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.029943360986871843,"score_gpt":0.2619239946884852,"score_spread":0.23198063370161337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033338535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0590882,0.00051579025,0.899826,0.00063884316,0.0006594944,0.0002941756,0.0001423615,0.0029068529,0.03592826],"genre_scores_gemma":[0.2254467,0.00022401343,0.7577841,0.00028653748,0.00012022545,0.00017939047,0.0002062587,0.00039700873,0.015355843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967456,0.00006123289,0.000014695193,0.000046697216,0.00016579793,0.000037114238],"domain_scores_gemma":[0.99953973,0.0001456845,0.000036570476,0.00007460832,0.00014032019,0.00006301456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049163634,0.000602819,0.00078600965,0.00067748054,0.00065917656,0.0008313753,0.0016759966,0.001408468,0.005249204],"category_scores_gemma":[0.001945364,0.00032501106,0.00041937814,0.000914493,0.00045145757,0.0006221279,0.0008384195,0.00083552406,0.0014287552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046254857,0.0004968156,0.0011703594,0.00025794347,0.00013186141,0.0002826109,0.00010927724,0.42145637,0.025366107,0.024721967,0.013854752,0.51168936],"study_design_scores_gemma":[0.0000780837,0.00011624822,0.00015230724,0.000007857204,0.000019314912,0.0001296819,0.0000132439,0.9871818,0.0026774358,0.003946976,0.0056638597,0.00001323799],"about_ca_topic_score_codex":0.0023576992,"about_ca_topic_score_gemma":0.0043452918,"teacher_disagreement_score":0.005249204,"about_ca_system_score_codex":0.0003879825,"about_ca_system_score_gemma":0.0011611278,"threshold_uncertainty_score":0.017560303},"labels":[],"label_agreement":null},{"id":"W2034854664","doi":"10.1145/1570256.1570317","title":"Black-box optimization benchmarking for noiseless function testbed using PSO_bounds","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Testbed; Initialization; Benchmarking; Particle swarm optimization; Computer science; Mathematical optimization; Black box; Simple (philosophy); Function (biology); Algorithm; Mathematics; Artificial intelligence","score_opus":0.03716575315474716,"score_gpt":0.30567287310543245,"score_spread":0.26850711995068527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034854664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60980564,0.0009340414,0.33735907,0.00071891927,0.00037637757,0.00033792705,0.0011487394,0.012871198,0.036448043],"genre_scores_gemma":[0.93362796,0.000113420196,0.0627934,0.000078989244,0.000013064829,0.00012466684,0.0009339007,0.00045867768,0.0018559598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858105,0.0005898528,0.00005781316,0.00015721002,0.00047089593,0.00014312744],"domain_scores_gemma":[0.9974728,0.0014364982,0.00013867012,0.00042292703,0.00037852227,0.0001506347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028553773,0.0010869115,0.0008129625,0.0007334397,0.0005143848,0.00086880726,0.0013531813,0.000862185,0.0024680123],"category_scores_gemma":[0.0057883007,0.00025118247,0.00039899795,0.0006807691,0.0007765042,0.0010348669,0.0006762742,0.00080703665,0.0005760295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006316575,0.00037624335,0.0018202851,0.00015979701,0.0000799278,0.000108387634,0.00006439676,0.9373034,0.005353385,0.0070819645,0.0050383597,0.04198213],"study_design_scores_gemma":[0.00007517681,0.0003012012,0.0007342631,0.000011086888,0.000009045833,0.000021143105,0.000019619722,0.9885257,0.00674384,0.0014990513,0.0020463765,0.0000135453365],"about_ca_topic_score_codex":0.0044727963,"about_ca_topic_score_gemma":0.0031792298,"teacher_disagreement_score":0.0044727963,"about_ca_system_score_codex":0.001020755,"about_ca_system_score_gemma":0.0009196549,"threshold_uncertainty_score":0.015100837},"labels":[],"label_agreement":null},{"id":"W2036225606","doi":"10.1145/1570256.1570316","title":"Black-box optimization benchmarking for noiseless function testbed using particle swarm optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Testbed; Benchmarking; Black box; Particle swarm optimization; Computer science; Multi-swarm optimization; Function (biology); Mathematical optimization; Benchmark (surveying); Algorithm; Artificial intelligence; Mathematics; Computer network","score_opus":0.039974930040846506,"score_gpt":0.3022172182142686,"score_spread":0.2622422881734221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036225606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6585575,0.000948617,0.29383248,0.0008825217,0.00038638405,0.00039518962,0.0011414462,0.007910477,0.0359454],"genre_scores_gemma":[0.9380709,0.00015424544,0.058341842,0.00009569183,0.0000123778755,0.00013753786,0.00077271584,0.0003373131,0.0020774065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986362,0.0005820713,0.000050024955,0.00012931261,0.00046814792,0.00013430377],"domain_scores_gemma":[0.99742717,0.0014697954,0.00013693098,0.0003836127,0.0004365074,0.00014589938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029223133,0.001091816,0.0007888956,0.0007504759,0.00064740784,0.0007582273,0.0012600253,0.0009801801,0.0020868548],"category_scores_gemma":[0.0056328955,0.00024878926,0.00042639457,0.0006911746,0.0008569607,0.00095656817,0.0006332346,0.00078907417,0.0005437544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064621906,0.0004993194,0.002200695,0.00020301952,0.00008813246,0.00015235462,0.00006778566,0.9458951,0.0064471653,0.007609154,0.0043211957,0.031869885],"study_design_scores_gemma":[0.00010110621,0.0004822204,0.0011009581,0.00001646283,0.000014011373,0.00003488833,0.000031676096,0.98327386,0.010164773,0.0021968046,0.002564822,0.000018471537],"about_ca_topic_score_codex":0.004105445,"about_ca_topic_score_gemma":0.0028678882,"teacher_disagreement_score":0.004105445,"about_ca_system_score_codex":0.0009441336,"about_ca_system_score_gemma":0.00096195453,"threshold_uncertainty_score":0.015454829},"labels":[],"label_agreement":null},{"id":"W2036829849","doi":"10.1080/0305215x.2013.776552","title":"Convergence analysis of the tabu-based real-coded small-world optimization algorithm","year":2013,"lang":"en","type":"article","venue":"Engineering Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; University of Otago; Ryerson University","keywords":"Tabu search; Mathematical optimization; Mathematics; Crossover; Convergence (economics); Metaheuristic; Algorithm; Benchmark (surveying); Bounded function; Computer science","score_opus":0.011920856076713844,"score_gpt":0.22510689703870265,"score_spread":0.21318604096198882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036829849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025479127,0.000543898,0.96886504,0.00016884576,0.000054712524,0.000068702604,0.000045267094,0.0002698974,0.00450448],"genre_scores_gemma":[0.6427303,0.0006967811,0.35258245,0.00014053815,0.000036211542,0.00037657618,0.00026608864,0.00019046971,0.0029805203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991554,0.00040145768,0.00003033325,0.000067019486,0.00027356404,0.00007212572],"domain_scores_gemma":[0.9971705,0.0016713839,0.00019043485,0.00015015052,0.0007416071,0.000075926146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026674783,0.00071291433,0.00090437435,0.0009885017,0.00042387506,0.0010026337,0.001427472,0.00081097515,0.0021495197],"category_scores_gemma":[0.0073802,0.00038807408,0.0005713867,0.0008699272,0.0009765178,0.000832781,0.0006678575,0.000958117,0.0003824038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004480216,0.000021705855,0.00029798155,0.000068204135,0.00003443944,0.000021431788,0.000028184264,0.971721,0.00091746147,0.010963793,0.00054290105,0.015337996],"study_design_scores_gemma":[0.0000031794402,0.00000832249,0.000030133284,0.000002991012,0.0000018420501,0.0000039737697,0.000001933195,0.9991302,0.00015332147,0.0005574443,0.00010486231,0.0000019441293],"about_ca_topic_score_codex":0.0048661055,"about_ca_topic_score_gemma":0.0020542734,"teacher_disagreement_score":0.0048661055,"about_ca_system_score_codex":0.001058206,"about_ca_system_score_gemma":0.0017819367,"threshold_uncertainty_score":0.014107108},"labels":[],"label_agreement":null},{"id":"W2037628519","doi":"10.1155/2014/713490","title":"A Particle Swarm Optimization Variant with an Inner Variable Learning Strategy","year":2014,"lang":"en","type":"article","venue":"The Scientific World JOURNAL","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Particle swarm optimization; Variable (mathematics); Curse of dimensionality; Computer science; Mathematical optimization; Local optimum; Relation (database); Multi-swarm optimization; Optimization problem; Artificial intelligence; Machine learning; Algorithm; Mathematics; Data mining","score_opus":0.022236354857923052,"score_gpt":0.2619238714423197,"score_spread":0.23968751658439666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037628519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008643784,0.00017461333,0.9875765,0.0001342576,0.00007096685,0.00004792652,0.000018453758,0.00016365168,0.0031698137],"genre_scores_gemma":[0.50507134,0.0003533531,0.4874428,0.00025555777,0.00015251728,0.00030380438,0.00015862496,0.00008185694,0.0061801886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963963,0.00009718979,0.000024972855,0.000081316466,0.00012633565,0.000030474255],"domain_scores_gemma":[0.99957603,0.00013726811,0.000054551518,0.00007213076,0.00012718773,0.000032872977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065742934,0.00054859667,0.00062863244,0.00036578244,0.00028621074,0.00068542996,0.001216385,0.00091045897,0.0010897886],"category_scores_gemma":[0.001512234,0.00021825745,0.0005306835,0.00042731664,0.00056965044,0.000667443,0.000700066,0.00087740645,0.00035490686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008758393,0.00013049481,0.0014881226,0.00014071986,0.00009273424,0.00021173766,0.000113643466,0.7530871,0.013651307,0.046250418,0.0026636953,0.18208233],"study_design_scores_gemma":[0.000015540127,0.000060948685,0.0001390979,0.0000041972694,0.000008380112,0.000043189917,0.0000038731123,0.99497014,0.0012889326,0.0017059844,0.0017534015,0.0000063456405],"about_ca_topic_score_codex":0.0021296549,"about_ca_topic_score_gemma":0.0013329211,"teacher_disagreement_score":0.0021296549,"about_ca_system_score_codex":0.00039408318,"about_ca_system_score_gemma":0.00063602754,"threshold_uncertainty_score":0.0042345524},"labels":[],"label_agreement":null},{"id":"W2038624805","doi":"10.1145/2576768.2598212","title":"An improved multi-start particle swarm-based algorithm for protein structure comparison","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Particle swarm optimization; Swarm behaviour; Computer science; Heuristic; Multi-swarm optimization; Heuristics; Local search (optimization); Agile software development; Metaheuristic; Local optimum; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.0372871004132425,"score_gpt":0.3288397382505595,"score_spread":0.291552637837317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038624805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009739458,0.00040708767,0.9858846,0.000091453105,0.00010032901,0.00011117288,0.00005574275,0.00092681317,0.0026833296],"genre_scores_gemma":[0.11534854,0.0002559243,0.8796402,0.00015159442,0.000040724037,0.00028589083,0.00034270503,0.00018300764,0.003751424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941516,0.000105389365,0.00003432915,0.0001202554,0.00028383848,0.00004114327],"domain_scores_gemma":[0.99963355,0.00011219228,0.00003898853,0.000043453554,0.00014287127,0.00002896851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089683034,0.0009316755,0.0012045474,0.0014095092,0.0006674798,0.00077764905,0.0017970968,0.0012503315,0.0026761005],"category_scores_gemma":[0.0015361359,0.0004279385,0.00093309465,0.0012515384,0.0003631839,0.0009929938,0.0009043325,0.00089950213,0.00091369863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031955863,0.0002029868,0.0021755553,0.00022410086,0.00021709997,0.00024405363,0.00016548872,0.4042237,0.014336452,0.013311179,0.006759752,0.5578201],"study_design_scores_gemma":[0.000051460465,0.00006653873,0.00038021457,0.000009625919,0.000019369825,0.00007640885,0.000009860529,0.9908687,0.0018974004,0.0017829392,0.0048249415,0.000012568319],"about_ca_topic_score_codex":0.003681273,"about_ca_topic_score_gemma":0.0030378567,"teacher_disagreement_score":0.003681273,"about_ca_system_score_codex":0.000614322,"about_ca_system_score_gemma":0.0010881195,"threshold_uncertainty_score":0.008952439},"labels":[],"label_agreement":null},{"id":"W2038636021","doi":"10.1016/j.ins.2011.03.016","title":"Enhancing particle swarm optimization using generalized opposition-based learning","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":473,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"National Natural Science Foundation of China","keywords":"Premature convergence; Initialization; Mathematical optimization; Particle swarm optimization; Local optimum; Differential evolution; Population; Benchmark (surveying); Computer science; Mathematics; Ode; Applied mathematics","score_opus":0.09140839569055396,"score_gpt":0.3139838274931784,"score_spread":0.2225754318026244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038636021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038552083,0.0002919854,0.9528069,0.00013558603,0.00011296346,0.000047584916,0.000010676084,0.00017502415,0.007867237],"genre_scores_gemma":[0.6893696,0.00034662217,0.30661124,0.0001388843,0.00008530896,0.00013708652,0.000043426353,0.00008444172,0.0031832908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996213,0.00012175316,0.000015107054,0.000031226544,0.00018232434,0.00002827817],"domain_scores_gemma":[0.99953747,0.00022926007,0.000058448906,0.000042307012,0.000115634626,0.000016956637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009431838,0.00055777456,0.00086568156,0.00052385055,0.0003181257,0.0007326042,0.0008004783,0.0009391207,0.0010161153],"category_scores_gemma":[0.0018854584,0.000250182,0.0005452265,0.0006128279,0.00050583616,0.00083316205,0.00090600655,0.0007107533,0.00023155747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001299381,0.0001394966,0.00053327327,0.00013073336,0.00007582215,0.00008112991,0.000072616334,0.8663871,0.010636628,0.015617536,0.00092744635,0.1052682],"study_design_scores_gemma":[0.000011777651,0.00003250171,0.000059845792,0.000003223164,0.00000668296,0.00001581168,0.0000036001359,0.99736685,0.0007240406,0.0014463733,0.00032642164,0.0000029698642],"about_ca_topic_score_codex":0.00087961665,"about_ca_topic_score_gemma":0.00079711,"teacher_disagreement_score":0.0010161153,"about_ca_system_score_codex":0.0002926345,"about_ca_system_score_gemma":0.00037618165,"threshold_uncertainty_score":0.0049880743},"labels":[],"label_agreement":null},{"id":"W2039139716","doi":"10.1145/1830483.1830527","title":"A hierarchical cooperative evolutionary algorithm","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Evolutionary algorithm; Computer science; Selection (genetic algorithm); Simple (philosophy); Evolutionary computation; String (physics); Interference (communication); Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.01415007931005871,"score_gpt":0.2829451829074897,"score_spread":0.268795103597431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039139716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010761975,0.00018149459,0.9791909,0.00012731363,0.00004139635,0.000101327154,0.000042670352,0.00049758336,0.009055377],"genre_scores_gemma":[0.27416718,0.00023187138,0.71475494,0.00022020804,0.0000415598,0.00042727243,0.00021868013,0.00012046112,0.009817758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940014,0.00015992952,0.000025840698,0.000118581665,0.00020989767,0.00008551615],"domain_scores_gemma":[0.99949324,0.00018728204,0.000042002343,0.00010759934,0.00012150235,0.00004821723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082697795,0.0005417626,0.00061879685,0.0008579044,0.00069917255,0.00074167724,0.0017201639,0.0011192556,0.005421346],"category_scores_gemma":[0.0022897634,0.0003014386,0.00063131057,0.0007987079,0.0005970949,0.0009980948,0.0020381217,0.00079908734,0.0011361728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001000836,0.00013595904,0.0012504015,0.00016060779,0.00009770402,0.00018309722,0.00034610764,0.5653673,0.017191345,0.1035695,0.0074858246,0.30411205],"study_design_scores_gemma":[0.000031763517,0.000049585644,0.00016519314,0.00000976457,0.000017428805,0.000051914787,0.000020744012,0.98258096,0.0011965719,0.009580602,0.0062854593,0.000010073675],"about_ca_topic_score_codex":0.0029485126,"about_ca_topic_score_gemma":0.0030915767,"teacher_disagreement_score":0.005421346,"about_ca_system_score_codex":0.0006231513,"about_ca_system_score_gemma":0.0011455918,"threshold_uncertainty_score":0.018136203},"labels":[],"label_agreement":null},{"id":"W2040376187","doi":"10.1109/foci.2014.7007807","title":"A discrete representation for real optimization with unique search properties","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Representation (politics); Theoretical computer science","score_opus":0.04425098409286923,"score_gpt":0.30601281697414573,"score_spread":0.2617618328812765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040376187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105445115,0.000175092,0.97969455,0.00017613874,0.00005864579,0.000037442496,0.000074502364,0.0002577176,0.008981384],"genre_scores_gemma":[0.3749603,0.0004198478,0.6155168,0.00017424418,0.000075816635,0.0002549999,0.00029815437,0.0002159298,0.008083888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995546,0.00012444497,0.000024112336,0.000072347255,0.0001921878,0.00003229832],"domain_scores_gemma":[0.99936455,0.000284826,0.000063412575,0.00015454591,0.00009958499,0.00003306131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005670303,0.00043979808,0.00043906816,0.000595278,0.00031443138,0.0014143001,0.000700852,0.00074635434,0.004795743],"category_scores_gemma":[0.0025082976,0.0001804771,0.00052177976,0.0008870528,0.0011375969,0.0015886577,0.0008865003,0.0011855633,0.00091769727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009366208,0.00007040118,0.00031306592,0.00018804485,0.000016661957,0.00009266672,0.00018080254,0.23775545,0.017780302,0.6032528,0.0027761324,0.13748002],"study_design_scores_gemma":[0.00002663241,0.0001197938,0.00016658341,0.000024106128,0.000007528827,0.0001447727,0.00003443884,0.8858781,0.0036239491,0.09731879,0.012634455,0.000020852469],"about_ca_topic_score_codex":0.0007834802,"about_ca_topic_score_gemma":0.0006709085,"teacher_disagreement_score":0.004795743,"about_ca_system_score_codex":0.00048650667,"about_ca_system_score_gemma":0.00046730955,"threshold_uncertainty_score":0.016043305},"labels":[],"label_agreement":null},{"id":"W2040441251","doi":"10.1109/acc.2010.5530897","title":"Spiral Bacterial Foraging Optimization method","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Convergence (economics); Gradient descent; Computer science; Jump; Swarm behaviour; Algorithm; Line search; Mathematics; Artificial neural network; Artificial intelligence; Path (computing)","score_opus":0.021410444842588076,"score_gpt":0.32123055069924444,"score_spread":0.29982010585665636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040441251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011785081,0.0010733098,0.9666587,0.00026639135,0.00014778602,0.00009162601,0.00006333156,0.0005358433,0.019377893],"genre_scores_gemma":[0.4193337,0.0018754115,0.5562366,0.00031015076,0.000097957156,0.00054372195,0.00024474642,0.00018783826,0.02116987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997553,0.000071936694,0.000012047031,0.000034233646,0.00009727234,0.000029185461],"domain_scores_gemma":[0.99981374,0.00005665839,0.000026987589,0.000020572745,0.00006464966,0.000017506163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033396643,0.0006334731,0.00094448315,0.00050723704,0.00044118293,0.00068998267,0.00077507447,0.0010022316,0.0032697748],"category_scores_gemma":[0.0008701365,0.00024223191,0.0006416035,0.00052668335,0.0004123183,0.0005243124,0.00069532654,0.00049348036,0.0009371489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011914482,0.00005456205,0.0009832241,0.0002608186,0.0000837289,0.00016229924,0.00011401093,0.7462944,0.012945616,0.07027497,0.0056554186,0.16305178],"study_design_scores_gemma":[0.000024204615,0.00004617235,0.00013534566,0.000019507357,0.00001168994,0.00009574106,0.0000103918655,0.982913,0.0013831304,0.007699708,0.0076471916,0.000013852828],"about_ca_topic_score_codex":0.0019423527,"about_ca_topic_score_gemma":0.00090243114,"teacher_disagreement_score":0.0032697748,"about_ca_system_score_codex":0.0005211165,"about_ca_system_score_gemma":0.0008382449,"threshold_uncertainty_score":0.010938466},"labels":[],"label_agreement":null},{"id":"W2040927350","doi":"10.1162/evco_a_00023","title":"On the Behaviour of Evolution Strategies Optimising Cigar Functions","year":2010,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Eigenvalues and eigenvectors; Quadratic equation; Mathematics; Regular polygon; Applied mathematics; Mathematical optimization; Adaptation (eye); Multiplicity (mathematics); Convex function; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.017658227654193327,"score_gpt":0.2767643156877009,"score_spread":0.25910608803350754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040927350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65592116,0.0019762563,0.32459983,0.00034983823,0.000053625055,0.00007460127,0.000023018758,0.00024740098,0.016754184],"genre_scores_gemma":[0.9732336,0.0006095124,0.024410916,0.00005879441,0.000011714222,0.0000361958,0.000032900065,0.000049670554,0.0015567339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.00015094748,0.000015433114,0.00003867169,0.00009326257,0.00005466835],"domain_scores_gemma":[0.9967314,0.0026428413,0.00019891391,0.00011080173,0.0002668261,0.000049168535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480014,0.00067338045,0.0007103934,0.0008142808,0.00037149238,0.00087690284,0.00051386363,0.0010471117,0.00080681755],"category_scores_gemma":[0.008145447,0.0002554683,0.00040521016,0.00053360104,0.00095726893,0.0007203683,0.00039500202,0.0005495724,0.00020631445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060953098,0.00003924817,0.000780094,0.000052527274,0.000039166738,0.00008839712,0.00009404989,0.96500856,0.0064563705,0.009838979,0.00014303674,0.017398585],"study_design_scores_gemma":[0.0000056472563,0.000059930095,0.00025577963,0.000007517674,0.000009381611,0.000025665624,0.000016319744,0.99549013,0.002113185,0.001819385,0.00018953627,0.000007388937],"about_ca_topic_score_codex":0.0029516544,"about_ca_topic_score_gemma":0.0013654233,"teacher_disagreement_score":0.0029516544,"about_ca_system_score_codex":0.00065642915,"about_ca_system_score_gemma":0.00039228756,"threshold_uncertainty_score":0.007827163},"labels":[],"label_agreement":null},{"id":"W2043879431","doi":"10.1109/cec.2014.6900579","title":"Identifying and exploiting the scale of a search space in differential evolution","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scale (ratio); Scale space; Space (punctuation); Artificial intelligence; Physics","score_opus":0.02722809374943415,"score_gpt":0.2845009929673625,"score_spread":0.25727289921792834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043879431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02854899,0.00042924067,0.96682477,0.000174239,0.000021239694,0.000040434832,0.0000147426435,0.00015061982,0.0037956587],"genre_scores_gemma":[0.6526053,0.00056937436,0.34441328,0.00008442037,0.000031200616,0.00015069233,0.000036903464,0.00009098789,0.0020178838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968183,0.00012560768,0.000014511356,0.000049857277,0.00010633146,0.000021906],"domain_scores_gemma":[0.998429,0.0011376922,0.00012121335,0.00014309895,0.00012650895,0.000042471078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013897835,0.00052705396,0.0006705802,0.0005774356,0.00034027474,0.0009130791,0.0007954354,0.0007345564,0.0008345402],"category_scores_gemma":[0.0060771797,0.00040168775,0.00047724432,0.0004880011,0.0012262535,0.001370899,0.0014472958,0.0009487944,0.00017842112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006057839,0.00003249567,0.0017725343,0.00013617691,0.000049338734,0.00018462782,0.00028377172,0.8449067,0.012753694,0.074219584,0.00051054585,0.06508998],"study_design_scores_gemma":[0.000005705545,0.000017177392,0.00019027092,0.000007695528,0.000005134488,0.00002296915,0.000013064034,0.9889341,0.0006936966,0.009599778,0.00050367205,0.000006800438],"about_ca_topic_score_codex":0.0017311597,"about_ca_topic_score_gemma":0.0013568702,"teacher_disagreement_score":0.0017311597,"about_ca_system_score_codex":0.0006240413,"about_ca_system_score_gemma":0.00037809522,"threshold_uncertainty_score":0.007349968},"labels":[],"label_agreement":null},{"id":"W2044079590","doi":"10.1109/ipdpsw.2014.137","title":"DisSLib: CC: A Library for Distributed Search with a Central Common Search State","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; State (computer science); Distributed computing; Interdependence; Search algorithm; Theoretical computer science; Programming language","score_opus":0.020136917053035587,"score_gpt":0.2747589418842488,"score_spread":0.2546220248312132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044079590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012460087,0.0006853852,0.6401261,0.0002466416,0.0003042012,0.00033329052,0.0055716773,0.3313854,0.02010121],"genre_scores_gemma":[0.059410606,0.0017499196,0.6473059,0.0016934861,0.00035565032,0.002892582,0.033398822,0.20210536,0.051087614],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826413,0.0003184808,0.00020582677,0.0002834767,0.0005832634,0.00034482992],"domain_scores_gemma":[0.9969265,0.0011485565,0.00023259856,0.000813827,0.0006358694,0.0002426229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002328098,0.0023683177,0.0019411849,0.002151067,0.0012308664,0.0040665423,0.0059757256,0.0029648733,0.10527861],"category_scores_gemma":[0.009009242,0.0020341314,0.0028598134,0.0028984863,0.0013458418,0.005504451,0.005219417,0.0043481602,0.06494181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012527882,0.00039720593,0.0015601584,0.0030338117,0.0003265145,0.0005146179,0.00045011862,0.035113193,0.011166112,0.08167985,0.57795423,0.2865514],"study_design_scores_gemma":[0.0011208256,0.00018739147,0.0007993864,0.0004411136,0.00014184821,0.0005495528,0.000075575364,0.16205558,0.028829176,0.0742424,0.7312523,0.00030475846],"about_ca_topic_score_codex":0.0035811802,"about_ca_topic_score_gemma":0.0050821803,"teacher_disagreement_score":0.10527861,"about_ca_system_score_codex":0.0018940504,"about_ca_system_score_gemma":0.0036039932,"threshold_uncertainty_score":0.35219204},"labels":[],"label_agreement":null},{"id":"W2044308622","doi":"10.5220/0005051801700175","title":"A Noise Resilient and Non-parametric Graph-based Classifier","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Parametric statistics; Graph; Algorithm; Theoretical computer science; Mathematics","score_opus":0.01661371420603852,"score_gpt":0.26492047686665515,"score_spread":0.24830676266061663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044308622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010450291,0.0002535114,0.9864607,0.00030964593,0.00009813317,0.00013758603,0.00014048349,0.001261526,0.00088812097],"genre_scores_gemma":[0.21366306,0.00030515442,0.7797593,0.0005188018,0.00015722676,0.00037351204,0.0014958173,0.00029228535,0.0034349002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974074,0.0005301508,0.00014609838,0.00081564765,0.000925863,0.0001747925],"domain_scores_gemma":[0.9970509,0.001097716,0.0002783293,0.000525788,0.00092960114,0.000117641604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017411885,0.0013273029,0.002095829,0.003721461,0.0011011967,0.0019153411,0.0044485317,0.0026898345,0.0019827245],"category_scores_gemma":[0.006918412,0.00051450665,0.0015200828,0.0029058093,0.0010596592,0.0036535398,0.0016101903,0.0025572584,0.0013926963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020989355,0.00034443208,0.0035628518,0.00015320069,0.00016291541,0.00010310991,0.00010089856,0.26370424,0.006102594,0.012392929,0.0095494725,0.7036135],"study_design_scores_gemma":[0.000014518772,0.000048224658,0.00036093482,0.000010185251,0.00001598784,0.00007007111,0.000026758027,0.98802173,0.0014334538,0.008440586,0.0015444235,0.000013033771],"about_ca_topic_score_codex":0.0049137077,"about_ca_topic_score_gemma":0.004787836,"teacher_disagreement_score":0.0049137077,"about_ca_system_score_codex":0.0012900739,"about_ca_system_score_gemma":0.0019150649,"threshold_uncertainty_score":0.009770215},"labels":[],"label_agreement":null},{"id":"W2045050140","doi":"10.1016/j.ins.2014.10.042","title":"Metaheuristics in large-scale global continues optimization: A survey","year":2014,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":470,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Metaheuristic; Computer science; Parallel metaheuristic; Decomposition; Engineering optimization; Search-based software engineering; Scale (ratio); Field (mathematics); Mathematical optimization; Optimization problem; Global optimization; Management science; Industrial engineering; Artificial intelligence; Algorithm; Meta-optimization; Engineering; Mathematics; Software; Software development","score_opus":0.027505616035827466,"score_gpt":0.31277591197388566,"score_spread":0.2852702959380582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045050140","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009147745,0.27042434,0.6943471,0.002114431,0.0006237625,0.00019727806,0.00018609477,0.0004318518,0.022527436],"genre_scores_gemma":[0.14380047,0.33105823,0.5136182,0.0012618735,0.0020454607,0.00050061865,0.00069137546,0.0003606368,0.006663096],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916124,0.00026789831,0.000077880446,0.0001366607,0.0002975883,0.000058758153],"domain_scores_gemma":[0.99854666,0.0010101219,0.00010537,0.00010767063,0.00018271897,0.000047505215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019609688,0.0020021715,0.0030240875,0.0017423583,0.000659817,0.0026734038,0.002476307,0.0023706248,0.0030809345],"category_scores_gemma":[0.0042445506,0.0006545319,0.0013996683,0.005418752,0.00090382824,0.0024964286,0.0013595464,0.0020832126,0.0015497613],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012572632,0.000382773,0.0009990274,0.0032017205,0.0003191829,0.000078364064,0.00010123737,0.2548856,0.0014384465,0.058306016,0.009448622,0.6707132],"study_design_scores_gemma":[0.00011679244,0.00027565987,0.0007802006,0.00089413975,0.0002329032,0.00022127976,0.00017682034,0.80560863,0.0020336509,0.10310038,0.08650527,0.000054212305],"about_ca_topic_score_codex":0.0023107666,"about_ca_topic_score_gemma":0.0025283236,"teacher_disagreement_score":0.0030809345,"about_ca_system_score_codex":0.00079719396,"about_ca_system_score_gemma":0.0016062701,"threshold_uncertainty_score":0.010370672},"labels":[],"label_agreement":null},{"id":"W2046858085","doi":"10.1007/s12293-014-0141-y","title":"Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem","year":2014,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Heuristics; Particle swarm optimization; Complex system; Domain (mathematical analysis); Quadratic equation; Mathematical optimization; Computer science; Multi-swarm optimization; Metaheuristic; Quadratic assignment problem; Algorithm; Mathematics; Optimization problem; Artificial intelligence","score_opus":0.025472997722234998,"score_gpt":0.25568643560058646,"score_spread":0.23021343787835147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046858085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010612574,0.00014805564,0.9840883,0.00019749552,0.00007862927,0.00004498099,0.000018343879,0.00010056972,0.0047110943],"genre_scores_gemma":[0.4300947,0.00032230475,0.56590265,0.00022661124,0.00012621183,0.00020037517,0.000078718534,0.00009332825,0.0029551215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958044,0.00022802613,0.000017719385,0.000039501207,0.00010239445,0.00003186209],"domain_scores_gemma":[0.9989489,0.0006996185,0.0000720387,0.00008233067,0.00016342037,0.00003380275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013795091,0.0005764216,0.00078620855,0.00071659154,0.00049835106,0.0010118464,0.0012273268,0.0013220304,0.0016612832],"category_scores_gemma":[0.0043389057,0.0004987671,0.0005308783,0.00090362545,0.0006992096,0.0010273375,0.00093274924,0.001089265,0.00028421349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018362813,0.000032402353,0.00012326158,0.000026569545,0.00001607834,0.000018961327,0.000022405125,0.9712549,0.00038932342,0.009385674,0.0004929791,0.018219084],"study_design_scores_gemma":[0.000007456554,0.000011869459,0.000022022383,0.0000029684206,0.0000037247391,0.000005001031,0.0000038901812,0.9973099,0.00009672095,0.0022538458,0.00028028854,0.000002230733],"about_ca_topic_score_codex":0.003681794,"about_ca_topic_score_gemma":0.0050492072,"teacher_disagreement_score":0.003681794,"about_ca_system_score_codex":0.0005754917,"about_ca_system_score_gemma":0.0009813131,"threshold_uncertainty_score":0.0073207617},"labels":[],"label_agreement":null},{"id":"W2048558571","doi":"10.1109/cec.2010.5585962","title":"Bottom-up evolutionary subspace clustering","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Institute for Materials Science; Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Cluster analysis; Subspace topology; Computer science; Data mining; Correlation clustering; Genetic algorithm; Population; Clustering high-dimensional data; Evolutionary computation; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.018694831569438124,"score_gpt":0.2842777595558827,"score_spread":0.26558292798644456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048558571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01147409,0.000096443655,0.9857836,0.000062072155,0.000016935293,0.000043587956,0.00003378476,0.00023744616,0.0022521324],"genre_scores_gemma":[0.27372974,0.00020575766,0.7204558,0.00012733236,0.00002130134,0.00023043898,0.00037928036,0.00014387067,0.004706365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990922,0.00024318685,0.00003957427,0.0001566468,0.00036214525,0.00010624249],"domain_scores_gemma":[0.99933213,0.00016745015,0.00004861158,0.00013639618,0.00027798032,0.00003751768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088920404,0.0007934716,0.0010934804,0.0010786898,0.00077550113,0.0012279331,0.0014382997,0.0009917321,0.0016554317],"category_scores_gemma":[0.002205668,0.00039516226,0.0010956316,0.0012639649,0.0007527561,0.00097424473,0.0016109117,0.000765285,0.00058763963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035261328,0.000046162833,0.0007576439,0.0000561154,0.000058224934,0.00008010587,0.00009984113,0.8428493,0.004920942,0.018404301,0.00141719,0.13127488],"study_design_scores_gemma":[0.0000045083602,0.000016645632,0.0001260716,0.0000058912983,0.000006128961,0.000029011375,0.000020961816,0.990231,0.0012897124,0.007008394,0.0012539933,0.000007757714],"about_ca_topic_score_codex":0.0031128428,"about_ca_topic_score_gemma":0.0031109212,"teacher_disagreement_score":0.0031128428,"about_ca_system_score_codex":0.0007641584,"about_ca_system_score_gemma":0.0010539071,"threshold_uncertainty_score":0.0061894655},"labels":[],"label_agreement":null},{"id":"W2051542317","doi":"10.5430/air.v1n2p149","title":"Fuzzy adaptive catfish particle swarm optimization","year":2012,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Catfish; Particle swarm optimization; Benchmark (surveying); Fuzzy logic; Inertia; Swarm intelligence; Multi-swarm optimization; Swarm behaviour; Mathematical optimization; Computer science; Artificial intelligence; Mathematics; Fish <Actinopterygii>; Biology; Physics; Fishery; Geography","score_opus":0.28251493352013757,"score_gpt":0.4290115289024241,"score_spread":0.14649659538228654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051542317","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07953824,0.00097702,0.90557456,0.00037885728,0.00018509798,0.00012536928,0.00007635743,0.00036465598,0.012779833],"genre_scores_gemma":[0.74043673,0.00064500317,0.24875244,0.00018601282,0.000051873474,0.0002470107,0.00018260995,0.000050028873,0.0094483085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977785,0.000048924838,0.000014654696,0.0000444555,0.00009254698,0.000021458807],"domain_scores_gemma":[0.99969614,0.00010563386,0.000036261736,0.000028316073,0.000118305434,0.000015314365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063812593,0.00053317705,0.0006648201,0.00047193404,0.0004051686,0.00078098755,0.0010116001,0.00091730163,0.0018320279],"category_scores_gemma":[0.0011688699,0.0002631244,0.0006477751,0.00045358852,0.00040542765,0.00056548446,0.0006813383,0.0006049466,0.00022136721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120726145,0.000051273586,0.0015209983,0.00015755,0.000079380006,0.00014230836,0.00008047573,0.87485904,0.008511514,0.013322645,0.0020771122,0.099076875],"study_design_scores_gemma":[0.000018332255,0.000027206128,0.0002039487,0.0000055291107,0.000006529832,0.000021461192,0.000006138259,0.997175,0.00065184425,0.00089763064,0.0009810636,0.0000052481387],"about_ca_topic_score_codex":0.0061269407,"about_ca_topic_score_gemma":0.0039046046,"teacher_disagreement_score":0.0061269407,"about_ca_system_score_codex":0.0004488315,"about_ca_system_score_gemma":0.00082385,"threshold_uncertainty_score":0.012182534},"labels":[],"label_agreement":null},{"id":"W2051644915","doi":"10.1109/ccece.2014.6901103","title":"Simulated Raindrop algorithm for global optimization","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Robustness (evolution); Simulated annealing; Benchmark (surveying); Computer science; Algorithm; Convergence (economics); Mathematical optimization; Mathematics; Geology","score_opus":0.017936386682110447,"score_gpt":0.2984521404160593,"score_spread":0.2805157537339488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051644915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005186102,0.0004174518,0.989912,0.000102906175,0.00006688261,0.000054882134,0.000039505096,0.00038107345,0.0038392495],"genre_scores_gemma":[0.28928173,0.00087080005,0.7032666,0.00026914247,0.00009627559,0.00055118743,0.00032841403,0.00025147764,0.005084343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961984,0.00014306074,0.000014788426,0.000047451802,0.00014488243,0.000029959116],"domain_scores_gemma":[0.9996456,0.00018966463,0.00003832674,0.00004606227,0.00006150759,0.00001882923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005685894,0.0006458151,0.0007837643,0.00055600726,0.00029874637,0.00058731093,0.0011558429,0.0008052525,0.002745407],"category_scores_gemma":[0.001317609,0.00028313734,0.00081433565,0.0005330169,0.0004744109,0.00059708004,0.0008039411,0.0010152754,0.00060144346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006437157,0.000043429765,0.00044969236,0.00013954034,0.000109738605,0.00005896458,0.000045925954,0.89141524,0.0034765557,0.0292542,0.0023765096,0.07256589],"study_design_scores_gemma":[0.000019704175,0.00003483961,0.000059932,0.000009308553,0.000010866312,0.000019872965,0.00000591625,0.9900333,0.0008997053,0.0052507007,0.0036509563,0.0000049127348],"about_ca_topic_score_codex":0.001642994,"about_ca_topic_score_gemma":0.0017331839,"teacher_disagreement_score":0.002745407,"about_ca_system_score_codex":0.0005586351,"about_ca_system_score_gemma":0.00082030136,"threshold_uncertainty_score":0.0091843605},"labels":[],"label_agreement":null},{"id":"W2052526715","doi":"10.1109/ccece.2010.5575132","title":"A study of optimal topologies in swarm intelligence","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Network topology; Particle swarm optimization; Mathematical optimization; Swarm behaviour; Convergence (economics); Computer science; Multi-swarm optimization; Swarm intelligence; Metaheuristic; Torus; Mathematics","score_opus":0.04576576221345303,"score_gpt":0.35271652086210137,"score_spread":0.30695075864864835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052526715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15239649,0.0073123644,0.7938867,0.0019013489,0.0001750415,0.00010955708,0.00007415731,0.00013618355,0.044008166],"genre_scores_gemma":[0.8779491,0.004030939,0.114985324,0.000108086315,0.00013961912,0.00014933274,0.000076976576,0.0000621637,0.0024984193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884415,0.00061426207,0.00004418673,0.00011098493,0.00032587917,0.000060491035],"domain_scores_gemma":[0.99590045,0.0030471683,0.00029669207,0.00025751232,0.0003898605,0.00010834298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021141153,0.0004831591,0.00069339655,0.0014827034,0.000734344,0.0019618091,0.0005611607,0.00096177123,0.0013230804],"category_scores_gemma":[0.013261615,0.0004713538,0.00048633167,0.001094654,0.0022370736,0.0030462807,0.00069815153,0.0007250313,0.00017077717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040640407,0.000028322052,0.0013102537,0.00015938352,0.000041613133,0.00014083504,0.00030726223,0.5276704,0.0013368201,0.43416178,0.0007523648,0.03405027],"study_design_scores_gemma":[0.000022660048,0.000115337505,0.00067868637,0.000068220936,0.000015208828,0.00016375529,0.00017732769,0.70297426,0.0008868723,0.28886414,0.006015472,0.000018122697],"about_ca_topic_score_codex":0.0008318555,"about_ca_topic_score_gemma":0.00044456465,"teacher_disagreement_score":0.0021141153,"about_ca_system_score_codex":0.0008636967,"about_ca_system_score_gemma":0.0005300248,"threshold_uncertainty_score":0.011180639},"labels":[],"label_agreement":null},{"id":"W2052822043","doi":"10.1109/cec.2014.6900566","title":"TraDE: Training device selection via multi-objective optimization","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Sorting; Scheduling (production processes); Genetic algorithm; Training (meteorology); Mutation; Computation; Population; Selection (genetic algorithm); Mathematical optimization; Operator (biology); Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.044943394844312874,"score_gpt":0.30191977756390875,"score_spread":0.2569763827195959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052822043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06109928,0.0003387545,0.93298614,0.00038483765,0.000054465865,0.00011238172,0.00008510129,0.00028537336,0.004653701],"genre_scores_gemma":[0.7521205,0.0002126019,0.24156831,0.00016826425,0.000033500397,0.00022999082,0.0001458862,0.00009856574,0.005422445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949443,0.00021071253,0.000017727898,0.00007879867,0.00013017052,0.000068040215],"domain_scores_gemma":[0.9991278,0.00060034735,0.00009567314,0.000041072955,0.00008771084,0.000047471527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012432223,0.001096891,0.0012402282,0.0010675966,0.00043757964,0.0011763631,0.0012885057,0.0016412594,0.0022910414],"category_scores_gemma":[0.0023219471,0.0005928529,0.00078529015,0.0010892214,0.0007334002,0.0012284443,0.00092959043,0.0009583562,0.00026914844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022680608,0.000024892226,0.0002729194,0.00001753834,0.000016731849,0.000027864044,0.000010844512,0.9873766,0.00047029593,0.0017343942,0.00025626866,0.009769058],"study_design_scores_gemma":[0.0000042979023,0.000017236327,0.00004989709,0.0000027917313,0.0000039073325,0.0000068300787,0.0000056515764,0.99866796,0.00018135227,0.00093302224,0.00012526984,0.00000179202],"about_ca_topic_score_codex":0.0035803006,"about_ca_topic_score_gemma":0.0024001386,"teacher_disagreement_score":0.0035803006,"about_ca_system_score_codex":0.0010553427,"about_ca_system_score_gemma":0.00094823405,"threshold_uncertainty_score":0.007664323},"labels":[],"label_agreement":null},{"id":"W2053454544","doi":"10.1007/s00500-014-1549-5","title":"Gaussian bare-bones artificial bee colony algorithm","year":2014,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Artificial bee colony algorithm; Benchmark (surveying); Mathematical optimization; Computer science; Evolutionary algorithm; Convergence (economics); Algorithm; Gaussian; Evolutionary computation; Inefficiency; Set (abstract data type); Artificial intelligence; Mathematics","score_opus":0.01978669454969349,"score_gpt":0.2815864520648099,"score_spread":0.2617997575151164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053454544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015133787,0.0007519684,0.96606296,0.00032211706,0.00027000447,0.000078090205,0.000062860745,0.00091158197,0.016406653],"genre_scores_gemma":[0.44902045,0.00080608117,0.52494645,0.0004937954,0.00014062863,0.00023950681,0.00023521135,0.0003018253,0.023816077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994849,0.00011033321,0.000019314459,0.00007017474,0.0002607743,0.000054443954],"domain_scores_gemma":[0.9995592,0.00012730631,0.000029634388,0.00004952751,0.00020254597,0.00003163298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069150265,0.000504,0.0010694799,0.000583482,0.0007131134,0.0011443387,0.0020886697,0.0016600128,0.004393185],"category_scores_gemma":[0.0021036481,0.00031740256,0.00059810217,0.0010735696,0.00076584745,0.00088281115,0.0011090317,0.0009125029,0.0013337218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026293064,0.00018514246,0.0010213647,0.0002257541,0.00013536349,0.00018287243,0.00009415082,0.59860414,0.0076385187,0.04539677,0.010383892,0.3358691],"study_design_scores_gemma":[0.00001970829,0.000028031254,0.00010481184,0.0000069175153,0.000010711023,0.00003880343,0.0000069015096,0.9936854,0.00063491106,0.0036710894,0.0017854866,0.0000072359626],"about_ca_topic_score_codex":0.0039709965,"about_ca_topic_score_gemma":0.004336858,"teacher_disagreement_score":0.004393185,"about_ca_system_score_codex":0.00051794644,"about_ca_system_score_gemma":0.0013474192,"threshold_uncertainty_score":0.014696658},"labels":[],"label_agreement":null},{"id":"W2053463274","doi":"10.3166/ria.22.63-85","title":"Résolution du problème de la patrouille multi-agent en utilisant des colonies compétitives de fourmis","year":2008,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Biology; Philosophy","score_opus":0.10273056392287812,"score_gpt":0.33222610198921454,"score_spread":0.22949553806633644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053463274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16246307,0.0008106734,0.82271254,0.00082660216,0.0000972648,0.0002457637,0.000033915145,0.00039259443,0.012417594],"genre_scores_gemma":[0.65740377,0.0003783674,0.3274725,0.00018701094,0.00005127663,0.00032337592,0.00007750468,0.00008809138,0.014018122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925476,0.00025225928,0.000037411344,0.00012033751,0.00022652694,0.00010864125],"domain_scores_gemma":[0.9984345,0.0008371691,0.000172935,0.00014276468,0.000288665,0.00012398773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016428846,0.0009479252,0.0011117513,0.0009304012,0.001373736,0.0015966865,0.001574122,0.0018507966,0.003273516],"category_scores_gemma":[0.0036427423,0.00050385017,0.00089470856,0.0008319336,0.0010089369,0.0011922909,0.0015354246,0.0011031138,0.0004758189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025180966,0.00019425599,0.0025916437,0.0002880244,0.00015039009,0.00042058548,0.00067928626,0.75118405,0.029839166,0.039707836,0.0020258161,0.17266709],"study_design_scores_gemma":[0.000045852677,0.00020992858,0.00057066133,0.000029171377,0.00004532505,0.00018104968,0.00018881027,0.97721076,0.0062791766,0.00873702,0.006481107,0.00002117494],"about_ca_topic_score_codex":0.005086712,"about_ca_topic_score_gemma":0.0044321595,"teacher_disagreement_score":0.005086712,"about_ca_system_score_codex":0.00097223447,"about_ca_system_score_gemma":0.0010290012,"threshold_uncertainty_score":0.010950983},"labels":[],"label_agreement":null},{"id":"W2055948327","doi":"10.1155/2012/793196","title":"An Empirical Investigation on System and Statement Level Parallelism Strategies for Accelerating Scatter Search Using Handel‐C and Impulse‐C","year":2012,"lang":"en","type":"article","venue":"VLSI design","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Parallelism (grammar); Parallel computing; Field-programmable gate array; Computer engineering; Population; Impulse (physics); Software; Gate array; Algorithm; Computer hardware; Programming language","score_opus":0.39832346553150794,"score_gpt":0.4102852528555367,"score_spread":0.01196178732402875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055948327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97537315,0.00056919054,0.01692388,0.00021756695,0.0000147856235,0.00012147062,0.00019506481,0.00053193636,0.0060530184],"genre_scores_gemma":[0.97170717,0.00015541774,0.026685089,0.00003705759,0.0000050187073,0.00008061682,0.00026560953,0.00007366613,0.0009902605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998444,0.00072701985,0.00008234511,0.0001564795,0.00042164032,0.00016855706],"domain_scores_gemma":[0.95996565,0.032985944,0.0016280201,0.0026565485,0.0023324892,0.00043139164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035074346,0.000535254,0.000261621,0.000906961,0.0003685459,0.0007176871,0.0007930717,0.0004719882,0.0020227376],"category_scores_gemma":[0.025493918,0.00018220705,0.00028327559,0.0013731152,0.0005261665,0.001202197,0.00038866402,0.00075954205,0.0003445921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001934006,0.0022921728,0.105773106,0.00086219196,0.00025786427,0.00020067806,0.0005041054,0.34827164,0.017249871,0.008380846,0.006466884,0.5078066],"study_design_scores_gemma":[0.00021452105,0.003173692,0.03837548,0.00006806547,0.00011433105,0.00032557774,0.00056248676,0.93459386,0.012419506,0.0028840299,0.0072340053,0.000034418717],"about_ca_topic_score_codex":0.0024698596,"about_ca_topic_score_gemma":0.004611299,"teacher_disagreement_score":0.0035074346,"about_ca_system_score_codex":0.00056390377,"about_ca_system_score_gemma":0.0008950658,"threshold_uncertainty_score":0.018549323},"labels":[],"label_agreement":null},{"id":"W2056005830","doi":"10.1109/sis.2014.7011769","title":"A social-spider optimization approach for support vector machines parameters tuning","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Support vector machine; Computer science; sort; Kernel (algebra); Particle swarm optimization; Hyperparameter optimization; Task (project management); Machine learning; Grid; Artificial intelligence; Optimization algorithm; Mathematical optimization; Mathematics; Engineering; Database","score_opus":0.04564684391735774,"score_gpt":0.30988012263347364,"score_spread":0.2642332787161159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056005830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013477817,0.00026163884,0.9839438,0.00011722434,0.000030699837,0.00004952224,0.000017603223,0.00018694633,0.0019147128],"genre_scores_gemma":[0.59609884,0.00028820048,0.40045786,0.00017545112,0.00008092767,0.0003384174,0.00011964384,0.00014105761,0.0022996343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.0002445783,0.000030264488,0.00007514344,0.00015148442,0.00004097433],"domain_scores_gemma":[0.999193,0.00042166497,0.0000890652,0.00005925144,0.00019546256,0.000041502233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011872341,0.00084049004,0.0010322841,0.0009911045,0.00046158474,0.00070256466,0.00086178386,0.0011706476,0.0014374371],"category_scores_gemma":[0.0030690285,0.00037646145,0.00069732236,0.00062800694,0.00058363075,0.0008705337,0.0010345816,0.00066093076,0.0003552848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006571048,0.000097033895,0.0007971183,0.00009293,0.00008364725,0.00007086536,0.000072248724,0.8772682,0.0029726329,0.013790963,0.0014166222,0.10327209],"study_design_scores_gemma":[0.000004928047,0.00002076642,0.000047199763,0.0000036519282,0.000003579518,0.0000125737115,0.000005284149,0.99683493,0.00026525685,0.0024728219,0.00032567713,0.0000033045924],"about_ca_topic_score_codex":0.00095393835,"about_ca_topic_score_gemma":0.0008251714,"teacher_disagreement_score":0.0014374371,"about_ca_system_score_codex":0.00041533538,"about_ca_system_score_gemma":0.0006679539,"threshold_uncertainty_score":0.0062787533},"labels":[],"label_agreement":null},{"id":"W2056678525","doi":"10.1016/j.ins.2006.09.016","title":"Exchange strategies for multiple Ant Colony System","year":2006,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ant colony optimization algorithms; Travelling salesman problem; Computer science; Weighting; Ant colony; Scheme (mathematics); Local search (optimization); Metaheuristic; Mathematical optimization; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.03510963660855574,"score_gpt":0.2952731545360752,"score_spread":0.26016351792751946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056678525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13475685,0.0014122474,0.82731414,0.0006949479,0.00018476928,0.00021623132,0.00004902351,0.00025050354,0.035121232],"genre_scores_gemma":[0.9177901,0.00038702652,0.06929144,0.00007599818,0.000035412446,0.00016902873,0.000033911823,0.00005146597,0.012165602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968743,0.0001331009,0.000014509085,0.000030460546,0.00009076243,0.0000437006],"domain_scores_gemma":[0.9995689,0.00022543507,0.000050078554,0.0000328629,0.00009015395,0.000032535903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006761959,0.00063427864,0.00067598006,0.0005905511,0.00067550095,0.00092969055,0.0011902637,0.0009578226,0.003979328],"category_scores_gemma":[0.0018814317,0.0002574486,0.00035047784,0.0005646416,0.00045751562,0.0010044278,0.0008475832,0.0005622081,0.00034446875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001691625,0.00012724075,0.00044878156,0.00016016317,0.00007664483,0.00017300056,0.00025892316,0.82255214,0.004924398,0.091105886,0.0025696908,0.07743397],"study_design_scores_gemma":[0.000020727077,0.000052193813,0.00007749219,0.0000055654864,0.000011402661,0.000035957568,0.000028128401,0.9857314,0.0003981051,0.012722961,0.00091069913,0.000005354829],"about_ca_topic_score_codex":0.0017209748,"about_ca_topic_score_gemma":0.0012447123,"teacher_disagreement_score":0.003979328,"about_ca_system_score_codex":0.0005509838,"about_ca_system_score_gemma":0.000475531,"threshold_uncertainty_score":0.013312161},"labels":[],"label_agreement":null},{"id":"W2057069530","doi":"10.1155/2012/186481","title":"Stabilizing of Subspaces Based on DPGA and Chaos Genetic Algorithm for Optimizing State Feedback Controller","year":2012,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hermite polynomials; Linear subspace; Control theory (sociology); Convergence (economics); Controller (irrigation); Algorithm; State (computer science); CHAOS (operating system); Genetic algorithm; Mathematical optimization; Population; Full state feedback; Domain (mathematical analysis); Mathematics; Computer science; Local optimum; Control (management); Artificial intelligence","score_opus":0.019537700497482366,"score_gpt":0.24975011349248302,"score_spread":0.23021241299500067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057069530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03679329,0.00026813662,0.9579792,0.000085952066,0.000028560215,0.00005498289,0.000014717783,0.00021587587,0.004559327],"genre_scores_gemma":[0.8062345,0.00031941602,0.18981609,0.000065338936,0.00002464491,0.00036373615,0.000058062793,0.000055168963,0.0030630636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.00009311027,0.0000101879705,0.000037531834,0.00009438273,0.000024279863],"domain_scores_gemma":[0.9997894,0.00008915108,0.000030146839,0.000015664185,0.00006431031,0.000011226624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004927818,0.0005565982,0.0005809776,0.0005857325,0.00043411748,0.0005224003,0.0005716763,0.0004490748,0.0007979905],"category_scores_gemma":[0.0009086845,0.00023297875,0.0004528016,0.0005022771,0.00045985746,0.00036109384,0.0006244816,0.00047117754,0.000106316584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003116002,0.000033685494,0.0005362892,0.000055579316,0.00003950345,0.00003980713,0.00008334203,0.93696654,0.0042930474,0.012707258,0.0005053614,0.04470844],"study_design_scores_gemma":[0.000007738115,0.000026561378,0.0000829894,0.0000037071377,0.000004704728,0.000009756524,0.0000062292343,0.9975925,0.0004492626,0.001455445,0.00035743846,0.0000036982074],"about_ca_topic_score_codex":0.00377044,"about_ca_topic_score_gemma":0.0028217472,"teacher_disagreement_score":0.00377044,"about_ca_system_score_codex":0.0005583179,"about_ca_system_score_gemma":0.0008487777,"threshold_uncertainty_score":0.0074970126},"labels":[],"label_agreement":null},{"id":"W2058294560","doi":"10.1145/568438.568443","title":"Review of <b>How to Solve It: Modern Heuristics</b>","year":2001,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Computer science; Heuristic; Key (lock); Fuzzy logic; Presentation (obstetrics); Process (computing); Artificial intelligence; Management science; Programming language","score_opus":0.06339484273346335,"score_gpt":0.34172868629628994,"score_spread":0.2783338435628266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058294560","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048564948,0.91263604,0.022377403,0.016802704,0.011667771,0.000044301072,0.00016559131,0.00022623438,0.035594314],"genre_scores_gemma":[0.0075317635,0.8855262,0.025307506,0.013101706,0.0135985995,0.00008458697,0.00046295527,0.00033201984,0.054054722],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993494,0.00012579314,0.000056571513,0.00010069308,0.00031492,0.000052626358],"domain_scores_gemma":[0.9983765,0.0007309507,0.000107298874,0.000068849964,0.0006144705,0.00010182695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007712109,0.00091460714,0.0011012994,0.0013949436,0.0007016647,0.0029707092,0.0014947853,0.0016451378,0.012388736],"category_scores_gemma":[0.0034412718,0.0006317632,0.0007858097,0.003407635,0.001456461,0.004440672,0.00065817346,0.003428597,0.013001894],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002695226,0.00004662724,0.000106418374,0.0031173741,0.00005593097,0.000046036002,0.00008904206,0.003705461,0.0005233053,0.03509418,0.58677137,0.3704174],"study_design_scores_gemma":[0.000004187153,0.00002523311,0.00021753534,0.00080869364,0.0000118922535,0.00013747536,0.0000497063,0.000836792,0.0001739818,0.016060041,0.981655,0.000019467903],"about_ca_topic_score_codex":0.003562174,"about_ca_topic_score_gemma":0.00471415,"teacher_disagreement_score":0.012388736,"about_ca_system_score_codex":0.001792905,"about_ca_system_score_gemma":0.002123468,"threshold_uncertainty_score":0.04144448},"labels":[],"label_agreement":null},{"id":"W2058621231","doi":"10.1504/ijmmno.2014.065404","title":"Coupling a chaotically encoded firefly algorithm with ranking to a physics-based mathematical model for robust optimisation of a gas turbine energy system","year":2014,"lang":"en","type":"article","venue":"International Journal of Mathematical Modelling and Numerical Optimisation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Firefly algorithm; Chaotic; Computer science; Particle swarm optimization; Energy (signal processing); Chaos theory; Algorithm; Firefly protocol; Ranking (information retrieval); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.035475518875267203,"score_gpt":0.2725561610619726,"score_spread":0.2370806421867054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058621231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045766644,0.0002684311,0.94832104,0.00015373298,0.000041420222,0.00005392805,0.000020365582,0.00016256156,0.0052119833],"genre_scores_gemma":[0.869045,0.0002745202,0.12703101,0.00005741768,0.00002681999,0.00014529715,0.000041974115,0.000045635352,0.0033323253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998628,0.00005037089,0.000006060642,0.000020164896,0.000045813733,0.0000148625795],"domain_scores_gemma":[0.99979895,0.00011060665,0.000036395948,0.000014606045,0.000031786494,0.000007693888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004830707,0.0005642268,0.00067841413,0.00035558842,0.00027975772,0.00070276286,0.00062681607,0.0008859121,0.0007984624],"category_scores_gemma":[0.0009121238,0.00027153932,0.0006452337,0.0003202366,0.0005227988,0.00047477664,0.00044255733,0.0005411088,0.00014187583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008732531,0.000007636453,0.00009546646,0.000017686622,0.000009907859,0.000016599062,0.000010996461,0.99235356,0.0011846112,0.0031455944,0.00005791057,0.0030913113],"study_design_scores_gemma":[0.0000014944003,0.00000943777,0.000021123873,0.0000010430845,0.0000016494434,0.0000033817605,0.0000012047693,0.9994399,0.000114220275,0.00033166457,0.00007350974,0.000001412066],"about_ca_topic_score_codex":0.0031827863,"about_ca_topic_score_gemma":0.0020138887,"teacher_disagreement_score":0.0031827863,"about_ca_system_score_codex":0.0004977555,"about_ca_system_score_gemma":0.0006850619,"threshold_uncertainty_score":0.006328523},"labels":[],"label_agreement":null},{"id":"W2059176872","doi":"10.1145/1570256.1570315","title":"Black-box optimization benchmarking for noiseless function testbed using an EDA and PSO hybrid","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Testbed; Benchmarking; Particle swarm optimization; Computer science; Black box; Benchmark (surveying); Mathematical optimization; Estimation of distribution algorithm; Noise (video); Algorithm; Multi-swarm optimization; Function (biology); Mathematics; Artificial intelligence","score_opus":0.0382141392182351,"score_gpt":0.3030817286101948,"score_spread":0.2648675893919597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059176872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79999715,0.00043648895,0.18192527,0.00035171848,0.00011664958,0.00017004005,0.00038213725,0.0033674676,0.013253068],"genre_scores_gemma":[0.9697595,0.000049511946,0.028923068,0.000029795623,0.0000035438911,0.00004453061,0.00016308734,0.000077981,0.00094885053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990295,0.00037820588,0.00004078135,0.00012050226,0.00031927013,0.00011171825],"domain_scores_gemma":[0.9983229,0.0008974829,0.00011688818,0.00023566552,0.00032789324,0.000099188466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135959,0.00080198655,0.0006552341,0.0006137301,0.00043872884,0.00067541207,0.00081828516,0.0006212951,0.0010704992],"category_scores_gemma":[0.0034528,0.00016620969,0.00029114375,0.00051699125,0.0005574285,0.0007420923,0.00039655252,0.00045767025,0.00022512273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005449149,0.00036327727,0.0030196512,0.00012599288,0.000076623546,0.00013373456,0.00005090311,0.9382673,0.011663901,0.0036745907,0.0013958365,0.040683307],"study_design_scores_gemma":[0.00005006159,0.00040302475,0.0014427738,0.0000096186195,0.0000119365595,0.000033413693,0.000023583369,0.98254883,0.013717132,0.00076532207,0.0009804516,0.000013763577],"about_ca_topic_score_codex":0.0036544395,"about_ca_topic_score_gemma":0.0029740327,"teacher_disagreement_score":0.0036544395,"about_ca_system_score_codex":0.0010083051,"about_ca_system_score_gemma":0.00067486294,"threshold_uncertainty_score":0.011296213},"labels":[],"label_agreement":null},{"id":"W2059342249","doi":"10.1145/2598394.2609855","title":"An evaluation of particle swarm optimization techniques in segmentation of biomedical images","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Particle swarm optimization; Image segmentation; Artificial intelligence; Segmentation; Otsu's method; Scale-space segmentation; Parametric statistics; Computer science; Pattern recognition (psychology); Pixel; Segmentation-based object categorization; Multi-swarm optimization; Computer vision; Mathematics; Algorithm; Statistics","score_opus":0.03538666463020891,"score_gpt":0.36727561634352845,"score_spread":0.33188895171331956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059342249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2745416,0.0083668325,0.7061705,0.00067960104,0.00020982302,0.00029730258,0.00014596272,0.0009804027,0.00860791],"genre_scores_gemma":[0.65710956,0.0032901254,0.3370699,0.000094462266,0.000051294857,0.00015962515,0.00025325504,0.00011848155,0.001853184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989247,0.0004547612,0.00007510229,0.000113576185,0.0003870112,0.000044823006],"domain_scores_gemma":[0.99783117,0.0014308811,0.0001343584,0.00012220154,0.00043619203,0.00004508725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029466976,0.0007815463,0.0008252265,0.0013630607,0.0003823114,0.0007131922,0.00051323144,0.0011897846,0.000635033],"category_scores_gemma":[0.0055464753,0.00023950364,0.0005961324,0.0013609792,0.0003943374,0.00078432885,0.000392293,0.00037826918,0.00014710079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011753511,0.00038353945,0.0052626445,0.0011385756,0.0003397804,0.00021739984,0.00033556847,0.50162786,0.032063592,0.0036992333,0.0017661096,0.45199043],"study_design_scores_gemma":[0.0000366519,0.0006142773,0.004866733,0.000041913074,0.00008619759,0.00015464851,0.000087287386,0.977539,0.014033572,0.00066770014,0.0018476149,0.00002441855],"about_ca_topic_score_codex":0.00317702,"about_ca_topic_score_gemma":0.0027395203,"teacher_disagreement_score":0.00317702,"about_ca_system_score_codex":0.0005384904,"about_ca_system_score_gemma":0.0006062932,"threshold_uncertainty_score":0.015583873},"labels":[],"label_agreement":null},{"id":"W2060355705","doi":"10.1504/ijica.2011.039593","title":"Particle swarm optimisation with simple and efficient neighbourhood search strategies","year":2011,"lang":"en","type":"article","venue":"International Journal of Innovative Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Particle swarm optimization; Neighbourhood (mathematics); Computer science; Locality; Mathematical optimization; Benchmark (surveying); Simple (philosophy); Local search (optimization); Swarm behaviour; Algorithm; Artificial intelligence; Mathematics","score_opus":0.038486688120589314,"score_gpt":0.3250332525350805,"score_spread":0.28654656441449117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060355705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014793493,0.00076174096,0.9788344,0.00009062203,0.0000787003,0.00011260619,0.00003136064,0.00022589287,0.0050710863],"genre_scores_gemma":[0.40868768,0.0012342473,0.5808642,0.00012256733,0.00012193543,0.00048682673,0.00018599529,0.00010038613,0.008196119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992106,0.00024220579,0.000050004634,0.00008417943,0.0003772074,0.000035714485],"domain_scores_gemma":[0.9996376,0.0001443576,0.000059898244,0.000058765763,0.0000804223,0.000018933482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008719611,0.0007057253,0.0012153601,0.0005903339,0.00034149698,0.00073351344,0.0010417507,0.0010852835,0.0008688403],"category_scores_gemma":[0.0019768868,0.00035798282,0.00081307173,0.0008717062,0.0005579936,0.00089552096,0.001007119,0.0006194235,0.0004863446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097721975,0.000100879115,0.0008106906,0.00029341894,0.00013780298,0.00021422935,0.00011831105,0.80460006,0.010699753,0.02457308,0.0019484861,0.15640554],"study_design_scores_gemma":[0.00008290628,0.00012325394,0.0003907946,0.000015924199,0.000031458763,0.00012442643,0.000010974507,0.98245347,0.002205764,0.008327523,0.006210966,0.000022464988],"about_ca_topic_score_codex":0.0015069828,"about_ca_topic_score_gemma":0.0015022684,"teacher_disagreement_score":0.0015069828,"about_ca_system_score_codex":0.00029195735,"about_ca_system_score_gemma":0.00055497186,"threshold_uncertainty_score":0.004611373},"labels":[],"label_agreement":null},{"id":"W2060611557","doi":"10.1155/2013/749256","title":"Predatory Search Strategy Based on Swarm Intelligence for Continuous Optimization Problems","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Fundamental Research Funds for the Central Universities; Hong Kong Polytechnic University; East China University of Science and Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Swarm intelligence; Particle swarm optimization; Mathematical optimization; Computer science; Multi-swarm optimization; Variable (mathematics); Swarm behaviour; Metaheuristic; Variable neighborhood search; Artificial intelligence; Mathematics","score_opus":0.03208382069360572,"score_gpt":0.26648784778753665,"score_spread":0.23440402709393093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060611557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011287634,0.0011086442,0.9810357,0.00024512128,0.00008570325,0.000059980932,0.000011308907,0.000096785814,0.006069096],"genre_scores_gemma":[0.51992786,0.002427012,0.4705414,0.000289516,0.00014246462,0.00048053596,0.000079951235,0.00005133184,0.0060599516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997019,0.00009934528,0.000017368897,0.000033006425,0.00012847116,0.000019823725],"domain_scores_gemma":[0.9998092,0.000091666814,0.000022395257,0.000013600208,0.000047536163,0.000015568883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005493857,0.0006252308,0.0007091698,0.00057862676,0.00034589827,0.0008350955,0.00090793334,0.0007572583,0.0009966182],"category_scores_gemma":[0.00095349853,0.00023709642,0.0007438329,0.0006118926,0.00079466903,0.00076237414,0.00072184135,0.0007154853,0.0002029858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004865052,0.00008539646,0.0011642567,0.00037553915,0.00022462415,0.0003538468,0.00027952608,0.662516,0.0071000042,0.1874349,0.0026325607,0.13778473],"study_design_scores_gemma":[0.00003763796,0.0001261874,0.00017582084,0.000024517147,0.00003120737,0.00009342539,0.000022081316,0.9648846,0.0010839179,0.028122295,0.0053816675,0.000016657492],"about_ca_topic_score_codex":0.0017832248,"about_ca_topic_score_gemma":0.0012988466,"teacher_disagreement_score":0.0017832248,"about_ca_system_score_codex":0.00043364763,"about_ca_system_score_gemma":0.0008938011,"threshold_uncertainty_score":0.003545761},"labels":[],"label_agreement":null},{"id":"W2061212936","doi":"10.1145/2725494.2725499","title":"Parallel Evolutionary Algorithms Performing Pairwise Comparisons","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"Center of Mathematical Sciences and Applications, Harvard University","keywords":"Differential evolution; Dimension (graph theory); Particle swarm optimization; Pairwise comparison; Logarithm; Population; Population size; Upper and lower bounds; Algorithm; Mathematical optimization; Evolutionary algorithm; Convergence (economics); Computer science; Evolutionary computation; Speedup; Mathematics; Simple (philosophy); Parallel computing; Combinatorics; Statistics; Mathematical analysis","score_opus":0.09041547469194562,"score_gpt":0.33254075602749167,"score_spread":0.24212528133554606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061212936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035360504,0.00021821795,0.954349,0.00018330199,0.00013250807,0.00015752208,0.000092425646,0.0011703307,0.008336265],"genre_scores_gemma":[0.2855175,0.00017672703,0.70725787,0.00011645861,0.00007503388,0.0003957099,0.00027800375,0.00040209212,0.005780595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961654,0.0012339295,0.00017741925,0.00091991154,0.0012453853,0.0002579616],"domain_scores_gemma":[0.9880861,0.006622491,0.0007423143,0.0027398292,0.0015649886,0.00024429068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004845058,0.0017793304,0.002062348,0.0014420267,0.0012561573,0.0018618903,0.0032799605,0.0016721133,0.007387088],"category_scores_gemma":[0.024108525,0.0007592237,0.0011275031,0.0028424542,0.0012178145,0.0032698244,0.0024972921,0.0018515086,0.0018595594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026442393,0.00021008487,0.0014636952,0.00027468518,0.00017796786,0.000119077675,0.00021552663,0.6878235,0.0080024535,0.060977235,0.0026557168,0.2378156],"study_design_scores_gemma":[0.00006268659,0.00009639947,0.00034362834,0.000011499383,0.000029370472,0.00006617722,0.00003777514,0.9317643,0.005778835,0.059699528,0.0020935903,0.000016310658],"about_ca_topic_score_codex":0.001740997,"about_ca_topic_score_gemma":0.002239097,"teacher_disagreement_score":0.007387088,"about_ca_system_score_codex":0.0012450484,"about_ca_system_score_gemma":0.0016703717,"threshold_uncertainty_score":0.025623381},"labels":[],"label_agreement":null},{"id":"W2062355752","doi":"10.1016/j.ins.2012.10.012","title":"Diversity enhanced particle swarm optimization with neighborhood search","year":2012,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":402,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"Nanchang Institute of Technology; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Particle swarm optimization; Premature convergence; Convergence (economics); Mathematical optimization; Computer science; Set (abstract data type); Diversity (politics); Multi-swarm optimization; Metaheuristic; Local search (optimization); Swarm behaviour; Artificial intelligence; Mathematics; Geography","score_opus":0.040763551329150466,"score_gpt":0.2876941417484873,"score_spread":0.24693059041933682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062355752","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039329913,0.00092045957,0.94740456,0.00020573633,0.00021587772,0.00006851181,0.00003061041,0.00012543314,0.011698872],"genre_scores_gemma":[0.7054039,0.00047571937,0.28639776,0.00012253995,0.00016367613,0.0002582414,0.000073128205,0.0000741061,0.0070308675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996352,0.00013875791,0.000014557612,0.000041303745,0.0001485038,0.000021659009],"domain_scores_gemma":[0.99937797,0.0003444698,0.000051247396,0.000056763358,0.0001472425,0.000022241575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009028745,0.00047261966,0.00090609427,0.00063841365,0.0004810097,0.00077337463,0.0009113143,0.0011639888,0.0015707742],"category_scores_gemma":[0.0027620357,0.000334069,0.0005073816,0.0007425698,0.00044307063,0.0010971136,0.0010071041,0.0006919664,0.0002477513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015190677,0.00008885039,0.0006669632,0.00011326324,0.00007423006,0.00008561657,0.00006881546,0.8903753,0.0027851264,0.025917828,0.0014645057,0.07820754],"study_design_scores_gemma":[0.000015887088,0.000034065266,0.00008695238,0.0000047576114,0.000009355449,0.00001836308,0.0000038332378,0.9967715,0.00040130733,0.0021751118,0.00047504934,0.0000037640252],"about_ca_topic_score_codex":0.0013506224,"about_ca_topic_score_gemma":0.0010154644,"teacher_disagreement_score":0.0015707742,"about_ca_system_score_codex":0.0003832664,"about_ca_system_score_gemma":0.00043246386,"threshold_uncertainty_score":0.0052547455},"labels":[],"label_agreement":null},{"id":"W2063070522","doi":"10.1145/2001576.2001787","title":"Collaborative multi-swarm PSO for task matching using graphics processing units","year":2011,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Particle swarm optimization; Speedup; Swarm behaviour; Matching (statistics); Curse of dimensionality; Task (project management); Swarm intelligence; Parallel computing; General-purpose computing on graphics processing units; CUDA; Graphics; Algorithm; Artificial intelligence; Mathematics","score_opus":0.13808964971586574,"score_gpt":0.3499413989395768,"score_spread":0.21185174922371108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063070522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24276732,0.000329267,0.746202,0.0003682418,0.00012277495,0.0001365471,0.00004303883,0.0010738674,0.008957001],"genre_scores_gemma":[0.7603713,0.000091676644,0.23730353,0.00005819725,0.000018736711,0.00012140133,0.00006209745,0.000089581314,0.0018834512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963415,0.000105121224,0.000016866521,0.000064706386,0.00012450047,0.000054538563],"domain_scores_gemma":[0.9989911,0.0005224152,0.00009319063,0.00015945236,0.00015756761,0.000076276294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000829917,0.0005943366,0.00076834054,0.00048794923,0.0005545206,0.0009152139,0.0011157666,0.0011659436,0.0017113204],"category_scores_gemma":[0.0033196877,0.00028208623,0.00059338147,0.00075027964,0.00050156045,0.00090382644,0.0006430225,0.00070477393,0.0003248729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018892252,0.0001959753,0.0013240658,0.00005549594,0.00005206922,0.0000912007,0.00007169329,0.9460855,0.00917882,0.005203797,0.00084225857,0.03671016],"study_design_scores_gemma":[0.000015942975,0.000036181453,0.00012901862,8.4250536e-7,0.0000030647311,0.0000056558843,0.0000053812023,0.9979796,0.0010405384,0.00054782734,0.00023360449,0.0000024422402],"about_ca_topic_score_codex":0.005329419,"about_ca_topic_score_gemma":0.0034207578,"teacher_disagreement_score":0.005329419,"about_ca_system_score_codex":0.0006921425,"about_ca_system_score_gemma":0.00080190704,"threshold_uncertainty_score":0.010596812},"labels":[],"label_agreement":null},{"id":"W2063574152","doi":"10.1109/cec.2014.6900591","title":"Genetic algorithm with self-adaptive mutation controlled by chromosome similarity","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Adaptive mutation; Mutation; Computer science; Genetic algorithm; Algorithm; Mathematical optimization; Local optimum; Benchmarking; Chromosome; Mutation rate; Mathematics; Population","score_opus":0.007581648286463548,"score_gpt":0.23016002364458596,"score_spread":0.22257837535812242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063574152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045359693,0.00025600038,0.94926345,0.00008864796,0.00005426331,0.00010349182,0.000017921517,0.0005761695,0.0042804074],"genre_scores_gemma":[0.53321606,0.0002642492,0.46170312,0.00013819429,0.000041401192,0.0002678031,0.000090490976,0.00009008765,0.0041886484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999549,0.00009974957,0.000020481097,0.00008844387,0.00021149857,0.000030870695],"domain_scores_gemma":[0.9996588,0.00011717136,0.00005858146,0.000059251877,0.000089568755,0.000016482049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005234423,0.00041250998,0.0005719297,0.00069206866,0.00033853343,0.0005425546,0.001413194,0.00076011516,0.0006644438],"category_scores_gemma":[0.0012068368,0.0001999452,0.0005343202,0.0007746004,0.0005654134,0.0005903409,0.0006793406,0.0005451239,0.0002474996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065061606,0.00012148363,0.0015128776,0.000060552426,0.00010618326,0.00015122142,0.00012701952,0.7818317,0.021849222,0.024663894,0.0010900211,0.16842082],"study_design_scores_gemma":[0.000022790337,0.000050414656,0.00021759668,0.0000045045213,0.000014304327,0.00008431167,0.0000069960147,0.99247426,0.0028626698,0.0026324783,0.0016223047,0.0000073484352],"about_ca_topic_score_codex":0.00165888,"about_ca_topic_score_gemma":0.0013015486,"teacher_disagreement_score":0.00165888,"about_ca_system_score_codex":0.00050173135,"about_ca_system_score_gemma":0.000678742,"threshold_uncertainty_score":0.0036403537},"labels":[],"label_agreement":null},{"id":"W2064393454","doi":"10.1145/2739480.2754813","title":"Towards an Augmented Lagrangian Constraint Handling Approach for the (1+1)-ES","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Augmented Lagrangian method; Constraint (computer-aided design); Lagrangian; Ellipsoid; Mathematical optimization; Computer science; Function (biology); Mathematics; Applied mathematics; Physics","score_opus":0.10361272005759743,"score_gpt":0.3342784775280701,"score_spread":0.2306657574704727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064393454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051530874,0.00013436287,0.9912497,0.00019232409,0.00003501934,0.000034845743,0.000025212279,0.00013286527,0.0030426825],"genre_scores_gemma":[0.17249687,0.00027254102,0.8225755,0.00026964932,0.00010177211,0.000220641,0.00009906457,0.00014710607,0.0038167855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995247,0.00022304969,0.000023117964,0.00004539341,0.00014992383,0.000033818233],"domain_scores_gemma":[0.99912447,0.0005346736,0.00009718798,0.00008201839,0.00012544406,0.000036218196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013107618,0.00093735167,0.0008438239,0.0005311164,0.00036671295,0.001304818,0.0014780149,0.0013752712,0.0033113745],"category_scores_gemma":[0.002830296,0.00041847784,0.00074486434,0.0005548899,0.00083397614,0.0012291735,0.0018876087,0.001816261,0.0006847281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030545783,0.000029495912,0.0001738762,0.00009691798,0.000024829618,0.00007314093,0.000069711874,0.91031104,0.002529412,0.04853628,0.00095983315,0.03716498],"study_design_scores_gemma":[0.0000055319892,0.000014498215,0.000015255432,0.0000056624476,0.0000024006401,0.0000095505475,0.0000032809508,0.993182,0.00024330901,0.005803995,0.00071076606,0.0000037230413],"about_ca_topic_score_codex":0.0017250953,"about_ca_topic_score_gemma":0.002106949,"teacher_disagreement_score":0.0033113745,"about_ca_system_score_codex":0.00050514855,"about_ca_system_score_gemma":0.00075590715,"threshold_uncertainty_score":0.011077642},"labels":[],"label_agreement":null},{"id":"W2064449485","doi":"10.1007/978-3-642-13495-1_50","title":"Biogeography Migration Algorithm for Traveling Salesman Problem","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence","funders":"","keywords":"Travelling salesman problem; Computer science; Algorithm; Mathematical optimization; Optimization problem; Operator (biology); Optimization algorithm; Mathematics","score_opus":0.019123667480578303,"score_gpt":0.26789473001227876,"score_spread":0.24877106253170045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064449485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058523577,0.002360812,0.90750337,0.0007493223,0.0005916535,0.0001522605,0.000120970595,0.00087968,0.029118406],"genre_scores_gemma":[0.3520959,0.0016887975,0.6187093,0.0002330317,0.00016778226,0.00038662893,0.00047501325,0.00021325934,0.026030358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990726,0.000020450214,0.0000046384243,0.000023088336,0.000028744997,0.00001588099],"domain_scores_gemma":[0.9999279,0.000023174778,0.000006878346,0.000007341182,0.000026955611,0.000007784055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948908,0.0004921132,0.0006893428,0.0005659102,0.00059025397,0.0005648144,0.00085513195,0.00079193176,0.0039636553],"category_scores_gemma":[0.0004174097,0.000186421,0.000499337,0.00066853955,0.00026047014,0.0005754774,0.00055189733,0.00068962737,0.00061669556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014884624,0.00016784316,0.0014953965,0.00024127227,0.00011013189,0.00024122467,0.00020399695,0.45805928,0.010621801,0.038971804,0.012074549,0.47766384],"study_design_scores_gemma":[0.00006131549,0.00007275773,0.0004226631,0.00002733689,0.000024675894,0.00012497736,0.000044441516,0.9781674,0.0017444494,0.0104696825,0.008828539,0.000011773494],"about_ca_topic_score_codex":0.0044114515,"about_ca_topic_score_gemma":0.002870308,"teacher_disagreement_score":0.0044114515,"about_ca_system_score_codex":0.000422608,"about_ca_system_score_gemma":0.0006802736,"threshold_uncertainty_score":0.013259709},"labels":[],"label_agreement":null},{"id":"W2064875201","doi":"10.1109/cec.2013.6557583","title":"Heterogeneous Multi-Population Cultural Algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Benchmark (surveying); Local search (optimization); Population; Heuristic; Computer science; Convergence (economics); Set (abstract data type); Architecture; Mathematical optimization; Cultural algorithm; State (computer science); Space (punctuation); Algorithm; State space; Theoretical computer science; Optimization problem; Mathematics; Artificial intelligence; Geography; Statistics; Meta-optimization","score_opus":0.031539383830975945,"score_gpt":0.3002613613897944,"score_spread":0.2687219775588185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064875201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018408578,0.00052965863,0.97264254,0.00024556756,0.00010127528,0.000114685085,0.000040532308,0.0003044368,0.007612659],"genre_scores_gemma":[0.4675301,0.0006220219,0.52268505,0.00042713227,0.000097620694,0.00058080425,0.00025205416,0.00011095293,0.0076942267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.0003383247,0.000045286688,0.00017810905,0.0002658787,0.00009972011],"domain_scores_gemma":[0.999275,0.0002579132,0.00006920164,0.00011694399,0.00022590849,0.000055078253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188306,0.00085776945,0.0009922415,0.0009920913,0.0010610233,0.0014842687,0.0023504929,0.0014311294,0.0025211351],"category_scores_gemma":[0.0030718865,0.00034364854,0.00089243957,0.0010839072,0.0008556063,0.0016744463,0.0016578932,0.0012869573,0.00052184367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076891345,0.00009228167,0.0015048258,0.00010778609,0.00014407781,0.00014270637,0.0002128591,0.7837614,0.0037216302,0.051042993,0.0029956717,0.1561969],"study_design_scores_gemma":[0.000025493056,0.000043626314,0.00015693127,0.000011873294,0.000020941097,0.000057581292,0.000031947475,0.986602,0.00088706095,0.008898596,0.0032513184,0.000012746644],"about_ca_topic_score_codex":0.0042677945,"about_ca_topic_score_gemma":0.00356069,"teacher_disagreement_score":0.0042677945,"about_ca_system_score_codex":0.0011046396,"about_ca_system_score_gemma":0.0015663257,"threshold_uncertainty_score":0.008485854},"labels":[],"label_agreement":null},{"id":"W2066173509","doi":"10.1109/tsmcb.2012.2213808","title":"Gaussian Bare-Bones Differential Evolution","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":268,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Differential evolution; Gaussian; Task (project management); Mathematical optimization; Algorithm; Computer science; Differential (mechanical device); Gaussian process; Optimization problem; Mathematics; Engineering; Physics; Geology","score_opus":0.02244593156429011,"score_gpt":0.26915121364483263,"score_spread":0.24670528208054252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066173509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012338449,0.00020143895,0.9797729,0.00010497061,0.000069335234,0.000042440042,0.00007109714,0.00043947212,0.006959848],"genre_scores_gemma":[0.4134485,0.00041755638,0.57256514,0.00031632395,0.000073991905,0.00022510916,0.00039524244,0.0003557338,0.012202396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.00007342926,0.00001629669,0.00007004344,0.00021355921,0.00004241022],"domain_scores_gemma":[0.9994905,0.00021706687,0.0000438099,0.00007736407,0.00013564719,0.000035572928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650216,0.0006109323,0.00096359605,0.00050261716,0.0003306583,0.00071337,0.0016713884,0.0012615733,0.0036008526],"category_scores_gemma":[0.0020004867,0.00036006875,0.00074976723,0.0006518914,0.0007801991,0.0007333873,0.0012568622,0.00095757126,0.0008706892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014136548,0.000063762054,0.0006919042,0.00013515302,0.0000661318,0.00016471941,0.000081983206,0.855106,0.008501227,0.04131633,0.003155184,0.09057625],"study_design_scores_gemma":[0.000012387286,0.000024532275,0.00008534309,0.000005783346,0.000005379511,0.00004314509,0.000005091218,0.9921003,0.0009018072,0.0043228045,0.0024851111,0.000008324825],"about_ca_topic_score_codex":0.0019150485,"about_ca_topic_score_gemma":0.0020014036,"teacher_disagreement_score":0.0036008526,"about_ca_system_score_codex":0.0004267486,"about_ca_system_score_gemma":0.0006243147,"threshold_uncertainty_score":0.012046099},"labels":[],"label_agreement":null},{"id":"W2066935518","doi":"10.1108/compel-08-2013-0285","title":"Ant colony optimization for the topological design of interior permanent magnet (IPM) machines","year":2014,"lang":"en","type":"article","venue":"COMPEL The International Journal for Computation and Mathematics in Electrical and Electronic Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Maximization; Computer science; Ant colony optimization algorithms; Topology optimization; Mathematical optimization; Graph; Discretization; Rotor (electric); Topology (electrical circuits); Magnet; Mathematics; Theoretical computer science; Engineering; Mechanical engineering; Finite element method","score_opus":0.022395498822614737,"score_gpt":0.293959789352444,"score_spread":0.2715642905298293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066935518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032871403,0.00026057896,0.9594819,0.00014720873,0.00005006624,0.00007582196,0.000025397974,0.00014517768,0.0069424734],"genre_scores_gemma":[0.6586739,0.00022955544,0.337813,0.000065058164,0.000018648348,0.00024344439,0.000059543112,0.00006207799,0.0028347706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997782,0.00009868616,0.0000081901635,0.000025726913,0.000070487346,0.000018689296],"domain_scores_gemma":[0.9996264,0.00019691572,0.000056644967,0.000024579922,0.000075046395,0.00002040855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043435424,0.0005098573,0.0004942837,0.00047283235,0.00028066416,0.0005641123,0.0006082281,0.0005917185,0.0016151929],"category_scores_gemma":[0.0011080492,0.00027694838,0.00052559585,0.0003285761,0.0005218685,0.000351962,0.0005137897,0.00045274055,0.00022479157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021838938,0.000018409974,0.00019150911,0.000056253873,0.000011571239,0.00004058269,0.000021366595,0.97767514,0.002028465,0.0046134335,0.00028405452,0.0150374435],"study_design_scores_gemma":[0.0000044924514,0.000017690923,0.000034328357,0.0000028903166,0.0000026751588,0.000008988583,0.000005163487,0.99815947,0.0002477657,0.0011161346,0.0003989767,0.0000014718588],"about_ca_topic_score_codex":0.0010089633,"about_ca_topic_score_gemma":0.0010605024,"teacher_disagreement_score":0.0016151929,"about_ca_system_score_codex":0.00037616692,"about_ca_system_score_gemma":0.0005348527,"threshold_uncertainty_score":0.0054033995},"labels":[],"label_agreement":null},{"id":"W2069636537","doi":"10.1145/2576768.2598387","title":"Dynamic multi-dimensional PSO with indirect encoding for proportional fair constrained resource allocation","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Particle swarm optimization; Mathematical optimization; Encoding (memory); Curse of dimensionality; Resource allocation; Proportionally fair; Orthogonal frequency-division multiple access; Quality of service; Algorithm; Orthogonal frequency-division multiplexing; Dynamic priority scheduling; Mathematics; Channel (broadcasting); Artificial intelligence; Computer network","score_opus":0.02317714564806146,"score_gpt":0.2839868515226085,"score_spread":0.26080970587454705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069636537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01979081,0.000098778284,0.9769289,0.00013243382,0.00004761143,0.000048921935,0.000010433878,0.0001047451,0.0028373676],"genre_scores_gemma":[0.6784758,0.00010764051,0.3191928,0.000091691174,0.000032438547,0.00017427429,0.00004167401,0.000032565666,0.0018510836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996265,0.00014655055,0.00001951244,0.000037011476,0.0001383785,0.000032033113],"domain_scores_gemma":[0.9994685,0.0002830513,0.000051424428,0.00007616029,0.00009422387,0.000026567563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083331246,0.00042740768,0.00047767622,0.00034201113,0.0003027127,0.00070816284,0.0006703748,0.0005621159,0.0009867051],"category_scores_gemma":[0.0030901532,0.00018209225,0.00039293955,0.00037169873,0.0005391851,0.0006575656,0.0008489969,0.0008248755,0.000119753786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005477923,0.000059306603,0.00071372045,0.000040042156,0.000028101284,0.000046751873,0.0000773414,0.9174094,0.00409468,0.023428127,0.0005696864,0.05347806],"study_design_scores_gemma":[0.000005634525,0.000017757784,0.0000466427,0.0000020760544,0.0000025667462,0.000007737667,0.0000026585806,0.9981343,0.00035083847,0.0012045371,0.00022286904,0.0000023183288],"about_ca_topic_score_codex":0.0013642943,"about_ca_topic_score_gemma":0.001350509,"teacher_disagreement_score":0.0013642943,"about_ca_system_score_codex":0.0004443501,"about_ca_system_score_gemma":0.00065096107,"threshold_uncertainty_score":0.004407048},"labels":[],"label_agreement":null},{"id":"W2070951675","doi":"10.1109/epec.2010.5697204","title":"A new meta-heuristic optimization technique: a sensory-deprived optimization algorithm","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Metaheuristic; Benchmark (surveying); Computer science; Optimization algorithm; Algorithm; Mathematical optimization; Population; Set (abstract data type); Heuristic; Meta heuristic; Parallel metaheuristic; Meta-optimization; Artificial intelligence; Mathematics","score_opus":0.031068278192772927,"score_gpt":0.29058848322193426,"score_spread":0.25952020502916134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070951675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060834987,0.00034844023,0.9904406,0.00014388382,0.00006766873,0.000060677994,0.00002810474,0.00013414504,0.0026929856],"genre_scores_gemma":[0.18308656,0.00058729073,0.81180227,0.00025632718,0.00009621449,0.0004738886,0.00015679054,0.0001031903,0.003437401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957806,0.00015406251,0.000026981848,0.00006270776,0.00014836324,0.000029926368],"domain_scores_gemma":[0.9997167,0.00013038312,0.000041577638,0.000029560866,0.00006588084,0.000015810694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071386783,0.00073336734,0.0007193445,0.0008972821,0.00041238967,0.000768665,0.0012937757,0.0011706087,0.002030335],"category_scores_gemma":[0.0016043428,0.00033418427,0.00094509975,0.00095734454,0.00051714305,0.00088279945,0.0010607085,0.0011298292,0.0004721887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009074422,0.000127794,0.0008086564,0.00024958747,0.00020283945,0.00011828485,0.00012015673,0.78262395,0.008980788,0.023519132,0.0022718294,0.18088628],"study_design_scores_gemma":[0.00003715853,0.00006236975,0.00013311015,0.000023485169,0.000023899136,0.0000704196,0.000016386395,0.98990625,0.0014089671,0.0037705123,0.0045373924,0.000010028578],"about_ca_topic_score_codex":0.0013702518,"about_ca_topic_score_gemma":0.0014661868,"teacher_disagreement_score":0.002030335,"about_ca_system_score_codex":0.00044646068,"about_ca_system_score_gemma":0.0009145936,"threshold_uncertainty_score":0.0067921877},"labels":[],"label_agreement":null},{"id":"W2073491843","doi":"10.1007/s11590-008-0089-2","title":"Mesh adaptive direct search algorithms for mixed variable optimization","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsequence; Variable (mathematics); Algorithm; Iterated function; Convergence (economics); Mathematics; Categorical variable; Mathematical optimization; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.04295862349070323,"score_gpt":0.27375931317915003,"score_spread":0.2308006896884468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073491843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004479685,0.0008708935,0.98831534,0.00017772292,0.00015224601,0.0000301686,0.000033430173,0.00017664906,0.005763876],"genre_scores_gemma":[0.22986719,0.0010545108,0.75481224,0.0002431503,0.00023943403,0.00051097403,0.00017535352,0.00029830175,0.012798886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996264,0.00018205403,0.000014095233,0.000028607257,0.00012683509,0.000022053566],"domain_scores_gemma":[0.99884415,0.00082231767,0.00006386678,0.000089422894,0.00015032654,0.000029998888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223174,0.00076489896,0.0009776424,0.0007214831,0.00043658967,0.00089168304,0.0013236615,0.0014914995,0.0049794717],"category_scores_gemma":[0.0048743603,0.0005448836,0.00054539536,0.0010398775,0.0006807603,0.0010064834,0.0014501668,0.001704527,0.00089512975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111777794,0.0000495522,0.00033657538,0.00013996976,0.000080345155,0.000045264413,0.000061024122,0.8044745,0.0014973441,0.057954144,0.004506757,0.13074265],"study_design_scores_gemma":[0.000013370253,0.000009456747,0.000030329113,0.0000062773083,0.0000040792174,0.0000064508167,0.000003668841,0.9884343,0.00014018676,0.010167592,0.0011814145,0.0000028412505],"about_ca_topic_score_codex":0.0022948224,"about_ca_topic_score_gemma":0.0027518913,"teacher_disagreement_score":0.0049794717,"about_ca_system_score_codex":0.00049382285,"about_ca_system_score_gemma":0.00052001094,"threshold_uncertainty_score":0.016657948},"labels":[],"label_agreement":null},{"id":"W2075441601","doi":"10.1007/s10489-008-0137-8","title":"The property analysis of evolutionary algorithms applied to spanning tree problems","year":2008,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Computer science; Locality; Encoding (memory); Evolutionary algorithm; Tree (set theory); Property (philosophy); Spanning tree; Minimum spanning tree; Algorithm; Set (abstract data type); Population; Enhanced Data Rates for GSM Evolution; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Discrete mathematics","score_opus":0.05081212352583217,"score_gpt":0.28260524929510505,"score_spread":0.23179312576927288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075441601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04653316,0.0012461175,0.938197,0.0006813551,0.00008396446,0.00005377447,0.000069478076,0.00014161634,0.0129935825],"genre_scores_gemma":[0.8359869,0.002848523,0.1546384,0.00021384122,0.0004077996,0.00015656048,0.00024014561,0.00033425982,0.0051735197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987658,0.0005745992,0.00006818373,0.00011745036,0.00035791297,0.00011600599],"domain_scores_gemma":[0.98682845,0.010487526,0.0006190452,0.0008320597,0.0010570481,0.00017582589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038726085,0.0006626043,0.00093537255,0.0018558078,0.00084837864,0.0022267608,0.00137945,0.0012943908,0.0041143545],"category_scores_gemma":[0.026320163,0.00039911093,0.0015865051,0.002247782,0.0016140061,0.006394159,0.0010897145,0.0021914376,0.0005516273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011153521,0.00010564515,0.002178491,0.00028040956,0.00009360089,0.00021716498,0.00025180198,0.21295847,0.004760779,0.6949145,0.0029601464,0.081167445],"study_design_scores_gemma":[0.000010004287,0.000052938376,0.000529404,0.000033408036,0.000031198782,0.00013757503,0.000034015695,0.7876679,0.0011672586,0.20884986,0.0014758857,0.000010559611],"about_ca_topic_score_codex":0.0008008975,"about_ca_topic_score_gemma":0.00030785752,"teacher_disagreement_score":0.0041143545,"about_ca_system_score_codex":0.00085216464,"about_ca_system_score_gemma":0.00072097406,"threshold_uncertainty_score":0.020480514},"labels":[],"label_agreement":null},{"id":"W2076520672","doi":"10.1023/b:anor.0000039518.73626.a5","title":"GENI Ants for the Traveling Salesman Problem","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Travelling salesman problem; Heuristic; Theory of computation; Benchmark (surveying); Mathematical optimization; Ant colony optimization algorithms; Probabilistic logic; Computer science; Ant colony; Bottleneck traveling salesman problem; Set (abstract data type); Nearest neighbour algorithm; Traveling purchaser problem; 2-opt; Mathematics; Algorithm; Artificial intelligence","score_opus":0.3811311709820421,"score_gpt":0.4971652540370582,"score_spread":0.11603408305501611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076520672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0677898,0.010324161,0.7943999,0.008585299,0.0017492652,0.00020169695,0.0004629265,0.0004410927,0.116045974],"genre_scores_gemma":[0.61681145,0.009553143,0.29632834,0.00072658976,0.0017342552,0.00039890682,0.0006634123,0.0004673292,0.07331654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994117,0.00028817615,0.000019297635,0.000081631224,0.00012994296,0.000069238304],"domain_scores_gemma":[0.9985247,0.0010780579,0.00011717345,0.00007497298,0.00012537533,0.00007984608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009550497,0.0008869371,0.0010796804,0.00081376196,0.00084618345,0.002259142,0.001400095,0.0024501162,0.010277247],"category_scores_gemma":[0.005607933,0.0005191319,0.00078615046,0.0015545024,0.0014384388,0.0023159294,0.0012600452,0.0039325017,0.0014683931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022135292,0.00008727082,0.00041084134,0.00032225126,0.00007278854,0.0001896856,0.00019648764,0.37549645,0.00065888313,0.5473084,0.020388031,0.05464767],"study_design_scores_gemma":[0.000053968135,0.000035350666,0.00017660909,0.000038043025,0.000022261094,0.00007139662,0.000052612246,0.5802231,0.00014366492,0.40764773,0.011519351,0.000016000336],"about_ca_topic_score_codex":0.003847504,"about_ca_topic_score_gemma":0.0039304085,"teacher_disagreement_score":0.010277247,"about_ca_system_score_codex":0.0013208311,"about_ca_system_score_gemma":0.0016011671,"threshold_uncertainty_score":0.034380794},"labels":[],"label_agreement":null},{"id":"W2077028432","doi":"10.1115/detc2007-35506","title":"Multi Agent Normal Sampling Technique (MANST) for Global Optimization","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Benchmark (surveying); MATLAB; Global optimization; Computer science; Toolbox; Sampling (signal processing); Mathematical optimization; Process (computing); Function (biology); Algorithm; Mathematics","score_opus":0.06185688797893931,"score_gpt":0.36301841971031407,"score_spread":0.3011615317313748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077028432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046998505,0.00019649915,0.99374324,0.000037122558,0.00003258114,0.00003710741,0.00000937698,0.00015028557,0.0010939377],"genre_scores_gemma":[0.3475824,0.00053512375,0.64853907,0.00007883003,0.000076415534,0.00033218192,0.00012227903,0.00012381426,0.002609878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913895,0.00041472947,0.000030318148,0.00007909041,0.00029787526,0.000038978607],"domain_scores_gemma":[0.99902105,0.00055312546,0.000110743094,0.00011244715,0.0001697113,0.000032885888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001367897,0.0008253822,0.0009386802,0.00076530466,0.0003741384,0.0004872074,0.00088359794,0.00060826284,0.0013451107],"category_scores_gemma":[0.0028567351,0.00033537793,0.00096524676,0.00066838186,0.00062921504,0.00080606516,0.00075625227,0.0008820229,0.0003140584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094825984,0.000057286816,0.0011201809,0.00017529966,0.0001045839,0.00010225899,0.000094729185,0.82703114,0.0077862754,0.024428906,0.0013670755,0.13763747],"study_design_scores_gemma":[0.000008719859,0.00005355726,0.00011711142,0.0000054826005,0.000009984904,0.00003651992,0.0000056784943,0.9943803,0.001222129,0.0028308388,0.0013231143,0.0000065610498],"about_ca_topic_score_codex":0.0017310904,"about_ca_topic_score_gemma":0.0017708637,"teacher_disagreement_score":0.0017310904,"about_ca_system_score_codex":0.00043277172,"about_ca_system_score_gemma":0.0007409991,"threshold_uncertainty_score":0.0072342157},"labels":[],"label_agreement":null},{"id":"W2077471743","doi":"10.1115/imece2013-63877","title":"A New Particle Swarm Optimization and Differential Evolution Technique for Constrained Optimization Problems","year":2013,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Particle swarm optimization; Differential evolution; Mathematical optimization; Computer science; Optimization problem; Multi-swarm optimization; Metaheuristic; Benchmark (surveying); Imperialist competitive algorithm; Swarm intelligence; Evolutionary computation; Artificial intelligence; Mathematics","score_opus":0.018036547812713848,"score_gpt":0.25634121221376166,"score_spread":0.2383046644010478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077471743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001511708,0.00072373555,0.994926,0.0001509737,0.00012514979,0.000048713602,0.000024456738,0.00009611228,0.0023932215],"genre_scores_gemma":[0.11623966,0.0022655895,0.87293357,0.00030700277,0.00024942946,0.00050362543,0.000233696,0.00007773276,0.007189675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995142,0.0001247841,0.00003552035,0.00006484168,0.00023535926,0.000025338906],"domain_scores_gemma":[0.99968195,0.00014085489,0.00003757644,0.000027230966,0.00009160639,0.000020743471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074646884,0.0010246793,0.0010950597,0.00074236176,0.00045038492,0.0008612568,0.0010820157,0.0013365096,0.0015454722],"category_scores_gemma":[0.001545646,0.00040613866,0.0009914006,0.001184654,0.0005118967,0.0010356392,0.0011843848,0.0017895288,0.00044928657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057986545,0.0000830813,0.0007791748,0.0003633313,0.00014264669,0.00029460443,0.00013677793,0.73227465,0.008691548,0.057453338,0.0066703926,0.19305247],"study_design_scores_gemma":[0.000022553764,0.000042405307,0.00015086567,0.00001875169,0.000013752827,0.0000772968,0.000007230911,0.9834448,0.0006893302,0.004432301,0.011088619,0.000012052407],"about_ca_topic_score_codex":0.0027646571,"about_ca_topic_score_gemma":0.0021601254,"teacher_disagreement_score":0.0027646571,"about_ca_system_score_codex":0.0004340045,"about_ca_system_score_gemma":0.0008242163,"threshold_uncertainty_score":0.005497098},"labels":[],"label_agreement":null},{"id":"W2081465218","doi":"10.1007/s00500-014-1244-6","title":"An improved hybrid immune algorithm for mechanism kinematic chain isomorphism identification in intelligent design","year":2014,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Clonal selection; Crossover; Computer science; Robustness (evolution); Algorithm; Genetic algorithm; Artificial immune system; Clonal selection algorithm; Operator (biology); Identification (biology); Mechanism (biology); Algorithm design; Isomorphism (crystallography); Mathematical optimization; Artificial intelligence; Mathematics; Machine learning; Biology","score_opus":0.02657711055640221,"score_gpt":0.2913296776285376,"score_spread":0.2647525670721354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081465218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110193,0.00012967442,0.9861481,0.00004727764,0.000043850618,0.000036711033,0.000011849421,0.0002843888,0.0022787335],"genre_scores_gemma":[0.3150187,0.00014372969,0.6798577,0.00016922066,0.000041215862,0.00026288637,0.00008132656,0.000103305676,0.004321924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967825,0.00007477295,0.000017421604,0.00006274222,0.00012877981,0.000037999773],"domain_scores_gemma":[0.999676,0.00012456896,0.000031181884,0.000038033406,0.000114040115,0.000016116093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007321729,0.00060456933,0.00095376343,0.0010895794,0.0005612521,0.0007128847,0.0014770215,0.0013245941,0.0031454319],"category_scores_gemma":[0.0011136375,0.00042264568,0.00087408576,0.0007947156,0.00040162003,0.00088756974,0.001016661,0.0006396369,0.0004846301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010887204,0.00012127521,0.0007638297,0.000083369356,0.000116780146,0.00006886685,0.00006376971,0.6847158,0.007841359,0.012097118,0.0017831462,0.2922358],"study_design_scores_gemma":[0.000009852612,0.000022245124,0.00006451363,0.0000027790988,0.000008909433,0.00001512913,0.0000037023517,0.99809915,0.00044560828,0.0009544594,0.00037052803,0.0000032228766],"about_ca_topic_score_codex":0.002152948,"about_ca_topic_score_gemma":0.0023145834,"teacher_disagreement_score":0.0031454319,"about_ca_system_score_codex":0.00042429834,"about_ca_system_score_gemma":0.00079892785,"threshold_uncertainty_score":0.010522485},"labels":[],"label_agreement":null},{"id":"W2081879218","doi":"10.1109/ccece.2014.6901057","title":"Optimizing Particle Swarm Optimization algorithm","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Particle swarm optimization; Computer science; Artificial neural network; Algorithm; Character (mathematics); Multi-swarm optimization; Swarm behaviour; Sample (material); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.019699099367677105,"score_gpt":0.27070962070841587,"score_spread":0.25101052134073876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081879218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010337329,0.0006569762,0.9785452,0.00015581043,0.0001150702,0.000090491376,0.000048482114,0.00029913595,0.009751475],"genre_scores_gemma":[0.43784925,0.0015244134,0.5491745,0.000253194,0.00014485317,0.00048785063,0.00032462328,0.00020313244,0.010038232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.00020763004,0.00003756001,0.000101951875,0.0001715301,0.000050543964],"domain_scores_gemma":[0.9993718,0.00029857983,0.000059320686,0.00005164971,0.00020047424,0.00001812674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096209295,0.0009630329,0.0010640201,0.00062784774,0.000549364,0.001092123,0.00072302826,0.001219457,0.0023228386],"category_scores_gemma":[0.0027233697,0.00033780193,0.0005933198,0.00078143534,0.0004308209,0.0006829014,0.00067961484,0.0007007108,0.0007753163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050878454,0.00004397972,0.0008153602,0.00016643852,0.000063027604,0.0000663539,0.000058604717,0.8827278,0.002442902,0.00868668,0.002562263,0.102315746],"study_design_scores_gemma":[0.000013751994,0.000035949037,0.00021109752,0.000012993556,0.000013957451,0.00002281382,0.000012459475,0.9937651,0.0007416063,0.0025287205,0.0026343842,0.000007074405],"about_ca_topic_score_codex":0.0036551391,"about_ca_topic_score_gemma":0.0019530263,"teacher_disagreement_score":0.0036551391,"about_ca_system_score_codex":0.00048786175,"about_ca_system_score_gemma":0.0010181852,"threshold_uncertainty_score":0.007770717},"labels":[],"label_agreement":null},{"id":"W2081987765","doi":"10.1109/fskd.2010.5569440","title":"Sparse optimization using a mixed GA-PSO optimization framework","year":2010,"lang":"en","type":"article","venue":"2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Computer science; Mathematical optimization; Multi-swarm optimization; Metaheuristic; Flexibility (engineering); Optimization problem; Position (finance); Genetic algorithm; Evolutionary algorithm; Algorithm; Artificial intelligence; Mathematics","score_opus":0.05956056914101535,"score_gpt":0.3275770337436953,"score_spread":0.2680164646026799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081987765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035212785,0.00016896623,0.9928052,0.00013460143,0.00002297946,0.000025642139,0.000011812274,0.00010267092,0.0032068545],"genre_scores_gemma":[0.28230458,0.0005531694,0.711539,0.0001671379,0.000105443825,0.00027466597,0.000079937614,0.000094546274,0.0048815515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962723,0.00015090506,0.000013140243,0.000032071315,0.00015620096,0.00002039627],"domain_scores_gemma":[0.9997223,0.00015597005,0.000027185153,0.000027533473,0.00004916219,0.00001778546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063921243,0.0006565846,0.0007556356,0.00047550583,0.00031848258,0.0008385929,0.00082539866,0.001014948,0.0014858589],"category_scores_gemma":[0.0015804869,0.00034735806,0.0006190573,0.00049440714,0.00041948812,0.00086428045,0.0011152682,0.0008886225,0.0003264946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003346575,0.00004405837,0.00026577213,0.00007114707,0.000044651624,0.00007867666,0.000033640303,0.881021,0.0034680055,0.06485325,0.00094231416,0.049144074],"study_design_scores_gemma":[0.000004758309,0.000013932424,0.000023976612,0.0000033362169,0.0000032440867,0.000015719119,0.0000028929962,0.9947419,0.00018387655,0.0044189626,0.0005851007,0.0000022684421],"about_ca_topic_score_codex":0.00133982,"about_ca_topic_score_gemma":0.0019030583,"teacher_disagreement_score":0.0014858589,"about_ca_system_score_codex":0.00025811567,"about_ca_system_score_gemma":0.0005306496,"threshold_uncertainty_score":0.0049706697},"labels":[],"label_agreement":null},{"id":"W2082820221","doi":"10.1115/detc2008-49991","title":"Enhanced Multi-Agent Normal Sampling Technique for Global Optimization","year":2008,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Manitoba","funders":"","keywords":"Mathematical optimization; Computer science; Sampling (signal processing); Global optimization; Standard deviation; Normal distribution; Algorithm; Mathematics; Statistics","score_opus":0.07399700246656397,"score_gpt":0.3443902893398757,"score_spread":0.2703932868733117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082820221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003057387,0.0001613587,0.9948211,0.000033080923,0.0000381366,0.000029520817,0.000010721751,0.00016083848,0.0016878272],"genre_scores_gemma":[0.28076962,0.0004199142,0.7136062,0.00008506248,0.0000955559,0.00023614567,0.00013188335,0.00016495139,0.004490772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992861,0.00024585583,0.000022367534,0.000078599434,0.00032534843,0.000041693118],"domain_scores_gemma":[0.9995016,0.00020640527,0.00005279162,0.00006809166,0.00014843806,0.000022633227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009905745,0.0007814406,0.0009317061,0.000709113,0.00034067268,0.00053304795,0.0010224904,0.00054427574,0.0021184515],"category_scores_gemma":[0.0016209765,0.00030384207,0.0008951775,0.0006229289,0.0005044434,0.0008788749,0.00081872236,0.0010460886,0.00043280039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008054385,0.000050447245,0.0005482673,0.00013335682,0.00006504129,0.00008675742,0.00008569352,0.8303897,0.0075663626,0.021798413,0.0015341234,0.13766134],"study_design_scores_gemma":[0.0000076250617,0.00003955504,0.00007011436,0.00000455065,0.0000062831255,0.000027483793,0.0000042496727,0.99497825,0.0009100488,0.001887412,0.0020590762,0.000005300457],"about_ca_topic_score_codex":0.0022785575,"about_ca_topic_score_gemma":0.0020291498,"teacher_disagreement_score":0.0022785575,"about_ca_system_score_codex":0.0005084666,"about_ca_system_score_gemma":0.0007680715,"threshold_uncertainty_score":0.007086873},"labels":[],"label_agreement":null},{"id":"W2083028490","doi":"10.1016/j.jpdc.2012.02.019","title":"Parallel differential evolution with self-adapting control parameters and generalized opposition-based learning for solving high-dimensional optimization problems","year":2012,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Differential evolution; Speedup; Benchmark (surveying); Computational complexity theory; Graphics; Parallel computing; Optimization problem; Execution time; Mathematical optimization; Algorithm; Mathematics; Computer graphics (images)","score_opus":0.014252950860160355,"score_gpt":0.2382615037605564,"score_spread":0.22400855290039606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083028490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05160889,0.0005259758,0.9414863,0.00020779678,0.00013621655,0.0000793643,0.000015906453,0.0002064264,0.0057331235],"genre_scores_gemma":[0.75224274,0.00028701473,0.2440888,0.00012626535,0.000059103015,0.000248066,0.000044186014,0.00007055204,0.0028331378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964404,0.00013692482,0.000020726015,0.0000374771,0.00013142501,0.000029404475],"domain_scores_gemma":[0.99926573,0.00043734667,0.00006981775,0.000053116462,0.00014665366,0.000027350306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00141381,0.0005892972,0.001018337,0.00057138427,0.0004232609,0.0006317403,0.0011506288,0.0009492646,0.0009941903],"category_scores_gemma":[0.0026119195,0.00041501183,0.00061021914,0.0007809838,0.0007925735,0.00070860534,0.0009840046,0.0010246793,0.00015400436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056898894,0.0000661184,0.00023048316,0.000049353966,0.000040635117,0.00003351229,0.000037481692,0.95568216,0.0014795936,0.0055763717,0.0002902811,0.03645718],"study_design_scores_gemma":[0.000008658118,0.00001568028,0.000027289912,0.0000015881362,0.0000030101455,0.000005199056,0.0000017449619,0.9988275,0.00016247702,0.0008388064,0.0001062718,0.0000017675071],"about_ca_topic_score_codex":0.0025749137,"about_ca_topic_score_gemma":0.0025903091,"teacher_disagreement_score":0.0025749137,"about_ca_system_score_codex":0.0005382113,"about_ca_system_score_gemma":0.0006028435,"threshold_uncertainty_score":0.007477045},"labels":[],"label_agreement":null},{"id":"W2083110812","doi":"10.1016/j.amc.2010.03.123","title":"A real-coded biogeography-based optimization with mutation","year":2010,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Benchmark (surveying); Mutation; Computer science; Operator (biology); Range (aeronautics); Domain (mathematical analysis); Global optimization; Mathematical optimization; Population; Optimization problem; Algorithm; Mathematics; Engineering; Biology; Genetics; Geography; Cartography","score_opus":0.012634191332126128,"score_gpt":0.2575149655768707,"score_spread":0.24488077424474458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083110812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032642122,0.00030081772,0.953689,0.0002715154,0.00020753621,0.00015401028,0.00004386832,0.00033641202,0.012354721],"genre_scores_gemma":[0.509058,0.00019759526,0.48368818,0.00017927999,0.00006708794,0.0003368878,0.00005910939,0.00013020018,0.006283749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978393,0.00007174075,0.000008713663,0.000034357963,0.00008198852,0.000019281548],"domain_scores_gemma":[0.99977,0.00010203464,0.000019705605,0.000028245126,0.00006234713,0.00001770099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006464103,0.00059298513,0.00074933824,0.00055880257,0.0004215592,0.00074652757,0.0015070573,0.0013918021,0.0027107939],"category_scores_gemma":[0.0012326045,0.00031035388,0.0006279381,0.0005969398,0.00074056315,0.00059031753,0.0009432233,0.00067164673,0.00029765323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006278556,0.00005858893,0.00034478327,0.00008120485,0.000050895753,0.00007577156,0.000046570603,0.93231565,0.006153544,0.018714756,0.00069605006,0.041399423],"study_design_scores_gemma":[0.000019044764,0.000023623266,0.000058732596,0.0000044150215,0.00000817893,0.000017874683,0.0000024528294,0.9979479,0.0004961046,0.00095310644,0.0004642501,0.000004227045],"about_ca_topic_score_codex":0.003114693,"about_ca_topic_score_gemma":0.002159257,"teacher_disagreement_score":0.003114693,"about_ca_system_score_codex":0.00060726854,"about_ca_system_score_gemma":0.00072570314,"threshold_uncertainty_score":0.009068489},"labels":[],"label_agreement":null},{"id":"W2083377062","doi":"10.1109/ccece.2012.6334942","title":"Strategic iniitialization of a hybrid particle swarm optimization-simullated annealing algorithm (HPSOSA) for PID controller design for a nonlinear system","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Simulated annealing; Particle swarm optimization; PID controller; Initialization; Benchmark (surveying); Hybrid algorithm (constraint satisfaction); Nonlinear system; Algorithm; Computer science; Control theory (sociology); Adaptive simulated annealing; Mathematical optimization; Mathematics; Control engineering; Engineering; Temperature control; Control (management); Artificial intelligence; Physics","score_opus":0.0775387255435752,"score_gpt":0.31751024152109675,"score_spread":0.23997151597752153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083377062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031655572,0.00011063984,0.96242446,0.00010377943,0.000044322394,0.000048766262,0.0000070867763,0.00020882688,0.0053965803],"genre_scores_gemma":[0.7528442,0.00011498236,0.24417756,0.000074905554,0.000016802771,0.00015227169,0.000024447188,0.000030594474,0.0025643487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998054,0.00007494017,0.0000105945,0.000027623479,0.00006740613,0.000013960834],"domain_scores_gemma":[0.9998006,0.000078580226,0.000024581534,0.000028507628,0.00005765392,0.000010101468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036641172,0.00030848687,0.00031661193,0.0001703475,0.00020008309,0.0004226213,0.0004901911,0.00048096158,0.0009381107],"category_scores_gemma":[0.00081670383,0.00019702471,0.00037616657,0.0001476832,0.0003771815,0.00024037434,0.00038501978,0.00042673334,0.00013810454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006879202,0.00004441542,0.00051122403,0.000058843794,0.00003976387,0.00005431677,0.000080939004,0.9214587,0.01371068,0.011466518,0.0003989379,0.052106783],"study_design_scores_gemma":[0.000009690664,0.000053426545,0.00007664174,0.0000031168229,0.0000063867724,0.000012411049,0.0000054926827,0.9972052,0.0015204763,0.0004797083,0.0006245592,0.000002920602],"about_ca_topic_score_codex":0.0020396602,"about_ca_topic_score_gemma":0.0019416404,"teacher_disagreement_score":0.0020396602,"about_ca_system_score_codex":0.00022283432,"about_ca_system_score_gemma":0.0006053125,"threshold_uncertainty_score":0.0040556192},"labels":[],"label_agreement":null},{"id":"W2084993914","doi":"10.1016/j.camwa.2006.07.013","title":"A novel population initialization method for accelerating evolutionary algorithms","year":2007,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":377,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Initialization; Population; Benchmark (surveying); Convergence (economics); Computer science; Mathematical optimization; Evolutionary algorithm; Algorithm; Set (abstract data type); Mathematics; Artificial intelligence","score_opus":0.0573682288893775,"score_gpt":0.35696257867430053,"score_spread":0.29959434978492305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084993914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037438085,0.00029267173,0.99066496,0.00009495293,0.00033032647,0.00006712769,0.000032011558,0.00064294145,0.0041312394],"genre_scores_gemma":[0.053668305,0.0002824742,0.9382101,0.00015217792,0.00014149304,0.00030603562,0.00011972614,0.00023176339,0.006887927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999637,0.00008650971,0.00001784541,0.000049424674,0.00018117267,0.000028048062],"domain_scores_gemma":[0.9995666,0.00012981867,0.000032276785,0.000054980424,0.00019004724,0.000026195683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006455357,0.00082635885,0.0007851514,0.00092221005,0.0006848753,0.0007741141,0.001506528,0.0012257443,0.0045611835],"category_scores_gemma":[0.0018114762,0.00043164464,0.0005743024,0.0012267347,0.00036315067,0.0009829383,0.0010360611,0.00118917,0.001663647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017526363,0.00013296035,0.00076227024,0.00024582332,0.00013533473,0.00022274909,0.00018480238,0.2166878,0.03448196,0.039567266,0.017133312,0.6902704],"study_design_scores_gemma":[0.00006239369,0.000064300286,0.0002456584,0.00002132314,0.000037863687,0.0001653627,0.000012625556,0.97623956,0.006082026,0.003935791,0.013107441,0.000025529705],"about_ca_topic_score_codex":0.0015313195,"about_ca_topic_score_gemma":0.0024195,"teacher_disagreement_score":0.0045611835,"about_ca_system_score_codex":0.00044613925,"about_ca_system_score_gemma":0.0006478794,"threshold_uncertainty_score":0.01525867},"labels":[],"label_agreement":null},{"id":"W2085361024","doi":"10.1162/evco_a_00139","title":"Comparison of Constraint-Handling Mechanisms for the (1,λ)-ES on a Simple Constrained Problem","year":2014,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Constraint (computer-aided design); Mathematical optimization; Truncation (statistics); Computation; Computer science; Simple (philosophy); Adaptation (eye); Fitness function; Mathematics; Evolutionary computation; Function (biology); Field (mathematics); Algorithm; Genetic algorithm; Machine learning","score_opus":0.041268766819345236,"score_gpt":0.3392185741248197,"score_spread":0.2979498073054745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085361024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21355362,0.0014603363,0.772787,0.0002682024,0.0000630251,0.00018200325,0.000045437853,0.00039971757,0.01124069],"genre_scores_gemma":[0.7613796,0.0007392133,0.2354787,0.000088749046,0.000028745791,0.00016166727,0.00005298573,0.00011209722,0.0019582543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942577,0.0002560504,0.000034727287,0.00006717893,0.00015576283,0.00006060262],"domain_scores_gemma":[0.9956858,0.00357916,0.00024115214,0.00022241543,0.00019762634,0.00007379688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021444336,0.00072864705,0.00075203663,0.0008362732,0.00030505419,0.00096672436,0.001490424,0.0015722818,0.0016836806],"category_scores_gemma":[0.007514602,0.00022360349,0.00061925466,0.00081678515,0.0006079027,0.0013058293,0.00073622394,0.00080912886,0.00020484785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022194468,0.00012544218,0.0005404061,0.00022388603,0.00006372019,0.00008407825,0.00012306131,0.899199,0.0040799496,0.033003464,0.000353709,0.061981365],"study_design_scores_gemma":[0.000024690966,0.00009934217,0.00017777443,0.000012402534,0.000012344593,0.000029266517,0.000022056793,0.9954951,0.0011493217,0.0025771172,0.00039066427,0.000009906],"about_ca_topic_score_codex":0.0013236445,"about_ca_topic_score_gemma":0.0012125057,"teacher_disagreement_score":0.0021444336,"about_ca_system_score_codex":0.00075665413,"about_ca_system_score_gemma":0.00069438654,"threshold_uncertainty_score":0.011341035},"labels":[],"label_agreement":null},{"id":"W2087109584","doi":"10.1007/s00500-013-1090-y","title":"A prediction-based adaptive grouping differential evolution algorithm for constrained numerical optimization","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Crossover; Differential evolution; Mathematical optimization; Convergence (economics); Population; Constraint (computer-aided design); Mutation; Evolutionary algorithm; Selection (genetic algorithm); Computer science; Adaptive mutation; Algorithm; Lipschitz continuity; Optimization problem; Mathematics; Genetic algorithm; Artificial intelligence","score_opus":0.02297026447037997,"score_gpt":0.25480975874239786,"score_spread":0.2318394942720179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087109584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010184384,0.000119493394,0.9872306,0.00008743716,0.000072659255,0.000054582888,0.000018458699,0.0002780104,0.0019544424],"genre_scores_gemma":[0.26087177,0.00015561406,0.7343598,0.00016626391,0.00006161253,0.00037673418,0.000115902236,0.00015420851,0.003738151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996991,0.00007539836,0.000016036955,0.000049336664,0.00013561406,0.000024510033],"domain_scores_gemma":[0.99939203,0.00028298242,0.00004567719,0.00006496688,0.00017995057,0.000034518893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010035521,0.00057366065,0.0011362415,0.0005954127,0.00058302673,0.0006525317,0.0019528489,0.0014288457,0.0025115018],"category_scores_gemma":[0.0024122796,0.0004628623,0.00048475713,0.00091158686,0.0005915981,0.00087181537,0.0015553619,0.0010911854,0.0005621087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102940925,0.00010289509,0.00054367824,0.00005424647,0.00004839472,0.000046521665,0.0000678968,0.8221535,0.003686822,0.009030785,0.0017180343,0.16244423],"study_design_scores_gemma":[0.000005725998,0.000010126675,0.000024526882,0.0000012380458,0.000001951276,0.0000031506374,0.000001134143,0.99924505,0.00013233502,0.00039027925,0.00018284222,0.000001606474],"about_ca_topic_score_codex":0.0038237222,"about_ca_topic_score_gemma":0.0037900296,"teacher_disagreement_score":0.0038237222,"about_ca_system_score_codex":0.00054022163,"about_ca_system_score_gemma":0.0009710552,"threshold_uncertainty_score":0.008401811},"labels":[],"label_agreement":null},{"id":"W2088134026","doi":"10.1007/s10957-010-9716-z","title":"Annealing a Genetic Algorithm for Constrained Optimization","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematical optimization; Simulated annealing; Penalty method; Convergence (economics); Computer science; Optimization problem; Genetic algorithm; Forcing (mathematics); Algorithm; Mathematics","score_opus":0.01071977768036943,"score_gpt":0.28486966622273735,"score_spread":0.27414988854236794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088134026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004091067,0.0005462745,0.98961604,0.00016191135,0.000116013915,0.000038652113,0.000023700186,0.00024167045,0.005164666],"genre_scores_gemma":[0.15561938,0.0008423514,0.8355592,0.00019142195,0.00013145589,0.00024815678,0.000094668954,0.0002109911,0.007102462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953127,0.00020677687,0.00001826336,0.00005372468,0.00016705123,0.000022967715],"domain_scores_gemma":[0.9995016,0.00030584654,0.000025681464,0.000059060352,0.00009461654,0.000013170909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006464454,0.0005935924,0.0010291116,0.00055948825,0.0006052277,0.0007880308,0.0009819734,0.0019379937,0.0029691064],"category_scores_gemma":[0.0023750644,0.00046848232,0.00081997266,0.0012350566,0.0009314114,0.0007600855,0.00084313186,0.0015397378,0.00064617407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053213473,0.000048361166,0.00020938429,0.00009046117,0.000072911425,0.000046439385,0.00007314802,0.8476739,0.0033383677,0.052760687,0.0026381738,0.092994906],"study_design_scores_gemma":[0.0000153379,0.000021579015,0.00007944926,0.000010059733,0.00001485876,0.0000137107545,0.000004236863,0.98540527,0.0003263495,0.011664126,0.0024385138,0.0000065687937],"about_ca_topic_score_codex":0.0047470783,"about_ca_topic_score_gemma":0.00398827,"teacher_disagreement_score":0.0047470783,"about_ca_system_score_codex":0.00048041256,"about_ca_system_score_gemma":0.0009814247,"threshold_uncertainty_score":0.009932697},"labels":[],"label_agreement":null},{"id":"W2088999732","doi":"10.1080/15732470500254535","title":"A modified shuffled frog-leaping optimization algorithm: applications to project management","year":2006,"lang":"en","type":"article","venue":"Structure and Infrastructure Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmark (surveying); Computer science; Algorithm; Particle swarm optimization; Flowchart; Range (aeronautics); Mathematical optimization; USable; Domain (mathematical analysis); Evolutionary algorithm; Mathematics; Artificial intelligence; Engineering","score_opus":0.0059884908602278585,"score_gpt":0.23296183450079436,"score_spread":0.2269733436405665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088999732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006806046,0.0004617858,0.9882979,0.00024296416,0.00004832424,0.00007088755,0.000045812812,0.0003538079,0.0036724776],"genre_scores_gemma":[0.13184118,0.0007446803,0.8609252,0.00013894525,0.00004462384,0.0003361403,0.00010465637,0.0001257124,0.005738808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.00011530293,0.000016407343,0.000037573478,0.000095596326,0.000017485676],"domain_scores_gemma":[0.99964213,0.00016979527,0.00004290751,0.000037677102,0.000084825886,0.000022598662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061063946,0.00061103766,0.0006848224,0.00045230382,0.0004744776,0.0006567367,0.0011340539,0.0014383895,0.0028302006],"category_scores_gemma":[0.0017199839,0.00026603843,0.00058597623,0.0010361801,0.0004158072,0.0007455582,0.0007449126,0.0008306816,0.00066983514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004797898,0.000049165414,0.00052818854,0.00012120307,0.000057442492,0.0001274669,0.00007530322,0.7770162,0.0038077566,0.022511072,0.0026842242,0.19297394],"study_design_scores_gemma":[0.000022845661,0.00005356342,0.00018782467,0.000015984977,0.000010365617,0.00011572347,0.000010540043,0.9789242,0.0013241721,0.01050039,0.008816583,0.000017791457],"about_ca_topic_score_codex":0.0020650544,"about_ca_topic_score_gemma":0.0017342255,"teacher_disagreement_score":0.0028302006,"about_ca_system_score_codex":0.00034616975,"about_ca_system_score_gemma":0.00071864144,"threshold_uncertainty_score":0.009467959},"labels":[],"label_agreement":null},{"id":"W2090217814","doi":"10.1109/cec.2012.6256517","title":"Two phased cellular PSO: A new collaborative cellular algorithm for optimization in dynamic environments","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Particle swarm optimization; Mathematical optimization; Robustness (evolution); Benchmark (surveying); Optimization problem; Evolutionary algorithm; Scheduling (production processes); Algorithm; Artificial intelligence; Mathematics","score_opus":0.016705859204851993,"score_gpt":0.29199507160778876,"score_spread":0.27528921240293674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090217814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008104927,0.00025690356,0.988159,0.00012411308,0.000096821095,0.000040229537,0.000027236401,0.00019705576,0.0029937653],"genre_scores_gemma":[0.5011644,0.00067138666,0.49051446,0.00025761154,0.00013508857,0.0004053603,0.00023993565,0.00012199128,0.006489793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970764,0.00008259822,0.000016058242,0.000048620477,0.00011138299,0.000033573877],"domain_scores_gemma":[0.99955994,0.00015859776,0.000054683096,0.00006183408,0.00012954387,0.000035360954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045117683,0.00065406144,0.00080339436,0.0005887202,0.00037296288,0.0009170046,0.001331019,0.0011580327,0.0014490188],"category_scores_gemma":[0.0015203108,0.00025117674,0.0006010827,0.0008603184,0.00049526605,0.000801312,0.0010431057,0.0007846588,0.00039236463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009131151,0.000081107006,0.0010961045,0.00011073662,0.00010174194,0.000120910656,0.00008597045,0.83013403,0.006055651,0.02177999,0.0041467627,0.13619566],"study_design_scores_gemma":[0.000015299342,0.000028947674,0.00007675416,0.0000029333498,0.000006228537,0.000031135085,0.000005338872,0.9960664,0.00039447323,0.0015449593,0.0018221273,0.00000549395],"about_ca_topic_score_codex":0.0028645576,"about_ca_topic_score_gemma":0.00251933,"teacher_disagreement_score":0.0028645576,"about_ca_system_score_codex":0.0004096413,"about_ca_system_score_gemma":0.0007063137,"threshold_uncertainty_score":0.0056957603},"labels":[],"label_agreement":null},{"id":"W2092166743","doi":"10.1109/smc.2013.136","title":"Interactive Visualization of Dynamic and High-Dimensional Particle Swarm Behavior","year":2013,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visualization; Computer science; Particle swarm optimization; Swarm behaviour; Dimension (graph theory); Multi-swarm optimization; Domain (mathematical analysis); Population; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.013715014490886232,"score_gpt":0.309112657851175,"score_spread":0.29539764336028873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092166743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1886427,0.0013590914,0.75475824,0.0025704834,0.0004691755,0.00024665004,0.002634627,0.01664957,0.032669496],"genre_scores_gemma":[0.78337556,0.0011464333,0.20606644,0.00032654294,0.00013023458,0.00027410837,0.0015803294,0.0011473454,0.0059529147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974877,0.00008440408,0.000014713112,0.00003277116,0.00009426602,0.000025182344],"domain_scores_gemma":[0.9987173,0.00076800614,0.00006879837,0.00015291705,0.00019553745,0.000097438984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901586,0.00071746926,0.00046235957,0.0009220549,0.00045101732,0.0015951312,0.0006255145,0.0008971107,0.008997173],"category_scores_gemma":[0.0023183245,0.0002270557,0.0005424951,0.00071952614,0.00039621582,0.0011570068,0.0014988233,0.0010094778,0.0007456014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016821035,0.0005204,0.013818148,0.0017263952,0.00038275478,0.0032285098,0.006144552,0.4128603,0.14128812,0.06313772,0.071524635,0.28368637],"study_design_scores_gemma":[0.0001912475,0.00016595742,0.0077677784,0.0001656227,0.00008354842,0.0006950048,0.0006193867,0.89324445,0.026510099,0.023587931,0.046862636,0.00010619056],"about_ca_topic_score_codex":0.0014637825,"about_ca_topic_score_gemma":0.0015393185,"teacher_disagreement_score":0.008997173,"about_ca_system_score_codex":0.00038045098,"about_ca_system_score_gemma":0.0005569134,"threshold_uncertainty_score":0.030098557},"labels":[],"label_agreement":null},{"id":"W2093633881","doi":"10.1016/s0031-3203(01)00193-5","title":"Fuzzy J-Means: a new heuristic for fuzzy clustering","year":2002,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Fuzzy logic; Mathematics; Centroid; Heuristic; Maxima and minima; Fuzzy clustering; Cluster analysis; Metaheuristic; Fuzzy set; Mathematical optimization; Local search (optimization); Fuzzy classification; Artificial intelligence; Data mining; Algorithm; Computer science","score_opus":0.09070179718031579,"score_gpt":0.2905354395512421,"score_spread":0.19983364237092632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093633881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021333762,0.000462506,0.99544156,0.0001016679,0.00016762922,0.000041778098,0.00003076924,0.00030980786,0.0013109318],"genre_scores_gemma":[0.044009455,0.00037945886,0.9522385,0.0001541249,0.0001334238,0.00012078726,0.00010098913,0.00016982203,0.0026933863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988894,0.0001891371,0.00005626838,0.0001859388,0.00060328975,0.000076022945],"domain_scores_gemma":[0.9994522,0.00016615432,0.000042530904,0.00007605337,0.0002306248,0.0000324581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013293833,0.0010224354,0.0018940874,0.0019920224,0.0017285016,0.0018955636,0.0024632507,0.0026507024,0.0024867982],"category_scores_gemma":[0.0029849058,0.0006407858,0.0015651195,0.0026481648,0.001300686,0.0019866584,0.0013564257,0.0017084301,0.00094509614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022322599,0.00012695408,0.00047268323,0.0003201136,0.0002664453,0.00011945253,0.00026433513,0.40060064,0.011049047,0.052347872,0.011993824,0.5222155],"study_design_scores_gemma":[0.000030756488,0.000043815453,0.00016613487,0.000026405747,0.000044331897,0.00010543138,0.0000324469,0.9649138,0.0034316038,0.022982087,0.008176348,0.000046982917],"about_ca_topic_score_codex":0.0071011577,"about_ca_topic_score_gemma":0.009865639,"teacher_disagreement_score":0.0071011577,"about_ca_system_score_codex":0.0011717962,"about_ca_system_score_gemma":0.0016465684,"threshold_uncertainty_score":0.014119625},"labels":[],"label_agreement":null},{"id":"W2094204336","doi":"10.1007/s10732-013-9235-9","title":"An iterated-tabu-search heuristic for a variant of the partial set covering problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Iterated local search; Local optimum; Mathematics; Guided Local Search; Iterated function; Set cover problem; Local search (optimization); Heuristic; Set (abstract data type); Algorithm; Computer science","score_opus":0.031429351791645806,"score_gpt":0.30792219586600056,"score_spread":0.27649284407435476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094204336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1442863,0.00070162705,0.8313515,0.00054834015,0.00021894605,0.0003251146,0.00021396947,0.00071985077,0.021634307],"genre_scores_gemma":[0.5510395,0.00023076739,0.44354987,0.0001451278,0.000076375654,0.00024443728,0.000268373,0.00018570943,0.004259717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948347,0.00021344586,0.00001734855,0.000074892676,0.000112840135,0.00009795609],"domain_scores_gemma":[0.9988955,0.00072200026,0.000069401874,0.00010891615,0.00014144609,0.000062630395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009934797,0.0006597869,0.0013446644,0.00076597003,0.0006625231,0.0009764647,0.0022604463,0.001634429,0.0038708248],"category_scores_gemma":[0.0036938426,0.0005245221,0.0011651709,0.0010330107,0.0006638106,0.0010588624,0.0010103452,0.0010280537,0.000302657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106248444,0.00011077462,0.0004421502,0.00009052748,0.000058974525,0.00014369644,0.000079687896,0.9249974,0.0014074217,0.014806832,0.002338175,0.055418096],"study_design_scores_gemma":[0.000021326816,0.00003940426,0.00009372262,0.0000083776995,0.000016527963,0.000032774627,0.000012333448,0.99631363,0.00026703495,0.0025917594,0.00059716875,0.0000060163084],"about_ca_topic_score_codex":0.005816432,"about_ca_topic_score_gemma":0.005873956,"teacher_disagreement_score":0.005816432,"about_ca_system_score_codex":0.0011410324,"about_ca_system_score_gemma":0.0014534364,"threshold_uncertainty_score":0.012949169},"labels":[],"label_agreement":null},{"id":"W2094252454","doi":"10.5267/j.ijiec.2012.09.001","title":"Comparative performance of an elitist teaching-learning-based optimization algorithm for solving unconstrained optimization problems","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Optimization algorithm; Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.04034164815511341,"score_gpt":0.3085967055323746,"score_spread":0.2682550573772612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094252454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5164575,0.0031370674,0.456733,0.0005568948,0.00020496231,0.00020604847,0.0001376571,0.0010740154,0.02149291],"genre_scores_gemma":[0.8040621,0.00063881924,0.19211149,0.00012006658,0.000026098145,0.00019515958,0.0002758328,0.0001377454,0.002432733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990693,0.00035881845,0.000080598715,0.00011027261,0.0002790731,0.000101968275],"domain_scores_gemma":[0.99750936,0.0016071469,0.00015474673,0.00015078913,0.0004864342,0.000091458576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024979431,0.00096000434,0.0012160775,0.0011024678,0.0005958609,0.00089237577,0.0010421417,0.001519831,0.0012861099],"category_scores_gemma":[0.0055547697,0.0002199561,0.0006328042,0.00090925954,0.0006631147,0.00092360465,0.00062175066,0.00067243585,0.00024817543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031482588,0.00026355285,0.0015175737,0.00020311863,0.00012051057,0.00004380616,0.00007658489,0.9252742,0.001917942,0.0021505398,0.0006401974,0.06747709],"study_design_scores_gemma":[0.00003185532,0.0001019206,0.0003688633,0.000010955303,0.000015222093,0.000016762147,0.000019208039,0.9974172,0.0013373526,0.00038307495,0.00028986696,0.000007762703],"about_ca_topic_score_codex":0.0062717297,"about_ca_topic_score_gemma":0.0047449837,"teacher_disagreement_score":0.0062717297,"about_ca_system_score_codex":0.0007863876,"about_ca_system_score_gemma":0.0016604111,"threshold_uncertainty_score":0.013210535},"labels":[],"label_agreement":null},{"id":"W209715872","doi":"","title":"An Evolutionary Race: A Comparison of Genetic Algorithms and Particle Swarm Optimization for Training Neural Networks.","year":2004,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Particle swarm optimization; Computer science; Artificial neural network; Train; Artificial intelligence; Genetic algorithm; Evolutionary algorithm; Evolutionary computation; Task (project management); Training (meteorology); Machine learning; Track (disk drive); Engineering","score_opus":0.05340394810975989,"score_gpt":0.33672010056819895,"score_spread":0.28331615245843905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W209715872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02913245,0.005554069,0.9463075,0.000949766,0.00048777295,0.00030194168,0.00014107495,0.0018414083,0.015283948],"genre_scores_gemma":[0.29351783,0.0036403565,0.69322324,0.00073471887,0.00025347437,0.0007097511,0.00039771036,0.0007316996,0.006791194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879056,0.00055288867,0.00006226532,0.0001486277,0.00037918286,0.00006647619],"domain_scores_gemma":[0.9971011,0.0022334778,0.0001291386,0.00016633577,0.0003076317,0.00006229008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003149428,0.001507488,0.0013038495,0.0016520598,0.00051413977,0.0013358626,0.0017806989,0.002435713,0.0025290344],"category_scores_gemma":[0.008809934,0.0005992336,0.00071844494,0.0017113049,0.00096122344,0.0018664888,0.0011476486,0.0016472404,0.00059560314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016689989,0.00014819516,0.0013669224,0.00020283984,0.00022784267,0.00007057496,0.000105904146,0.79683775,0.0005621773,0.012777434,0.0025946794,0.18493879],"study_design_scores_gemma":[0.000030433444,0.000095796364,0.0002947125,0.00004097803,0.000024939647,0.000029505627,0.000029066005,0.9920105,0.00036267028,0.0043223137,0.0027490575,0.000010135627],"about_ca_topic_score_codex":0.009695836,"about_ca_topic_score_gemma":0.0077336133,"teacher_disagreement_score":0.009695836,"about_ca_system_score_codex":0.0010069957,"about_ca_system_score_gemma":0.0011113808,"threshold_uncertainty_score":0.019278765},"labels":[],"label_agreement":null},{"id":"W2097348115","doi":"10.1109/cec.2006.1688425","title":"On The Convergence of Information Exchange Methods in Multiple Cooperating Swarms","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Swarm behaviour; Convergence (economics); Information exchange; Computer science; Multi-swarm optimization; Mathematical optimization; Work (physics); Metaheuristic; Swarm intelligence; Algorithm; Artificial intelligence; Mathematics; Engineering","score_opus":0.04014106437342423,"score_gpt":0.3296652656802198,"score_spread":0.28952420130679557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097348115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14577714,0.0018653186,0.83656734,0.00084480864,0.00011069659,0.00020383668,0.000020741076,0.00017886244,0.014431218],"genre_scores_gemma":[0.8348458,0.0012618639,0.15931843,0.00016791694,0.000095280004,0.00034204472,0.00006234948,0.00010905878,0.0037973395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970503,0.0017003553,0.00014070974,0.00022182653,0.0006813185,0.00020547144],"domain_scores_gemma":[0.97016644,0.024795992,0.0014986651,0.0009714282,0.0021493365,0.000418238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011948172,0.0011657326,0.001441577,0.0017002482,0.001081403,0.0015682911,0.0013850697,0.0019571856,0.001428343],"category_scores_gemma":[0.042763647,0.0005378118,0.00079497957,0.0012117213,0.0023975782,0.002792148,0.0024065343,0.0012803583,0.0003368733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002786583,0.000101537335,0.0016071289,0.00012023168,0.00010110349,0.00010595221,0.00047077634,0.913862,0.0013131779,0.042947344,0.0005393911,0.038552623],"study_design_scores_gemma":[0.000034125118,0.00011284882,0.00022804765,0.000027658038,0.00001543939,0.000027964667,0.000044723012,0.9902535,0.0005091559,0.0083134705,0.0004242337,0.0000087621165],"about_ca_topic_score_codex":0.0029462173,"about_ca_topic_score_gemma":0.00095719175,"teacher_disagreement_score":0.011948172,"about_ca_system_score_codex":0.0010997531,"about_ca_system_score_gemma":0.0011115903,"threshold_uncertainty_score":0.06318873},"labels":[],"label_agreement":null},{"id":"W2097431197","doi":"10.1109/iscas.1989.100610","title":"An efficient implementation of an edge detection algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; A priori and a posteriori; Algorithm; Execution time; Edge detection; Theoretical computer science; Computer engineering; Artificial intelligence; Image processing; Image (mathematics)","score_opus":0.017615173525274832,"score_gpt":0.3342086159025628,"score_spread":0.316593442377288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097431197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004378134,0.000042792068,0.99283856,0.000036982306,0.00002484111,0.00003882353,0.00003123187,0.0015665771,0.00104209],"genre_scores_gemma":[0.05135932,0.00006259951,0.9464297,0.000050540013,0.000012692478,0.000097227414,0.00017006269,0.00011643469,0.0017014154],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995933,0.000048352656,0.000034716555,0.000071991395,0.00019503373,0.000056565357],"domain_scores_gemma":[0.9995536,0.00011628133,0.000036737933,0.00008868009,0.00018061209,0.000024061914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003370741,0.0006794077,0.0006490672,0.0007214717,0.0004026777,0.0009711513,0.0016622595,0.0009668759,0.0051702126],"category_scores_gemma":[0.0012551174,0.00044846564,0.00044883642,0.00071536365,0.000261209,0.001011088,0.00079263345,0.0007705618,0.001713651],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040496927,0.0002320764,0.00085781154,0.00027085622,0.00007101825,0.00033262785,0.000095254676,0.11182602,0.116161466,0.026532935,0.008889541,0.73432547],"study_design_scores_gemma":[0.000061274615,0.00013009425,0.00034188753,0.000013996843,0.000026473435,0.00024221941,0.000020155954,0.9255432,0.05407393,0.0060900548,0.013427599,0.000029159411],"about_ca_topic_score_codex":0.0010600848,"about_ca_topic_score_gemma":0.0012028544,"teacher_disagreement_score":0.0051702126,"about_ca_system_score_codex":0.00031702395,"about_ca_system_score_gemma":0.00077800296,"threshold_uncertainty_score":0.017296135},"labels":[],"label_agreement":null},{"id":"W2098540440","doi":"10.1109/tsmcb.2010.2056367","title":"Enhanced Differential Evolution With Adaptive Strategies for Numerical Optimization","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":229,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Differential evolution; Benchmark (surveying); Computer science; Mathematical optimization; Scalability; Convergence (economics); Evolutionary algorithm; Optimization problem; Global optimization; Evolution strategy; Adaptive strategies; Adaptation (eye); Artificial intelligence; Algorithm; Mathematics","score_opus":0.017948645447076427,"score_gpt":0.2511247999847204,"score_spread":0.233176154537644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098540440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034981782,0.00058477937,0.99325126,0.00007864459,0.000046900594,0.00004326845,0.000010588274,0.000120516925,0.0023659489],"genre_scores_gemma":[0.2308707,0.0012553603,0.76392287,0.00015746713,0.000076406264,0.00043987308,0.000069126254,0.00008539283,0.0031228918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993618,0.00023920432,0.00004190009,0.00006383677,0.0002677263,0.00002554154],"domain_scores_gemma":[0.99913067,0.0005287298,0.00007792776,0.00009259942,0.00014785185,0.000022326465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013534422,0.0009339147,0.0008265675,0.00072004576,0.00024942294,0.00070895423,0.0011070158,0.0010457345,0.0013625589],"category_scores_gemma":[0.0034710453,0.0003180414,0.00071743986,0.0009318406,0.00064096146,0.0007718186,0.0009911285,0.0012862313,0.00037998197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004150572,0.00005858081,0.0004269947,0.000175609,0.00007956914,0.00010876392,0.00007330392,0.86126876,0.0064439513,0.046646617,0.0009092612,0.08376703],"study_design_scores_gemma":[0.000011898363,0.000026236818,0.00005414963,0.00000907678,0.0000070735546,0.000024460976,0.0000024033484,0.9920994,0.0007431766,0.004530911,0.002485755,0.0000054714124],"about_ca_topic_score_codex":0.0009789887,"about_ca_topic_score_gemma":0.0009810303,"teacher_disagreement_score":0.0013625589,"about_ca_system_score_codex":0.00050920795,"about_ca_system_score_gemma":0.0004957977,"threshold_uncertainty_score":0.0071578026},"labels":[],"label_agreement":null},{"id":"W2099023497","doi":"10.1016/j.ahj.2013.08.020","title":"Reply to Koestenberger and Ravekes","year":2013,"lang":"en","type":"letter","venue":"American Heart Journal","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hospital for Sick Children","funders":"","keywords":"Hyperspectral imaging; Computer graphics; Computer science; Graphics processing unit; Graphics; Data science; Software engineering; Human–computer interaction; Computer graphics (images); Artificial intelligence; Operating system","score_opus":0.0280327858275841,"score_gpt":0.30433459850897027,"score_spread":0.27630181268138615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099023497","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000096422555,0.0011436193,0.000066737106,0.9687477,0.0289942,0.0000074978348,0.000035185563,0.00001419348,0.0008944607],"genre_scores_gemma":[0.0012954551,0.0007806066,0.00008847055,0.96218985,0.032666415,0.000028424918,0.000016560323,0.000016062606,0.0029182092],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965462,0.0008952584,0.0004046857,0.00047691521,0.0010617346,0.00061519904],"domain_scores_gemma":[0.9878477,0.0064668176,0.000940867,0.00033309945,0.0026078676,0.001803626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051639695,0.0009424624,0.0020125303,0.00091144367,0.0044307606,0.006100397,0.0021574097,0.07749253,0.007965261],"category_scores_gemma":[0.04680214,0.0009865745,0.0014666539,0.0010032314,0.0039750724,0.004206634,0.002482951,0.055457465,0.008236819],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027769107,0.000007855033,0.00012209869,0.00002274178,0.000007739685,0.00017719028,0.00003995031,0.000022257676,0.000025377352,0.0010755773,0.9962043,0.002267176],"study_design_scores_gemma":[0.00014515573,0.000053135096,0.0010774959,0.00046097374,0.000058482674,0.000922031,0.0005850887,0.00045219093,0.00022230048,0.012868442,0.98305583,0.000098797864],"about_ca_topic_score_codex":0.0058665783,"about_ca_topic_score_gemma":0.007989582,"teacher_disagreement_score":0.07749253,"about_ca_system_score_codex":0.005388052,"about_ca_system_score_gemma":0.0046286616,"threshold_uncertainty_score":0.039093256},"labels":[],"label_agreement":null},{"id":"W2099840809","doi":"10.1162/evco.2008.16.2.151","title":"Step Length Adaptation on Ridge Functions","year":2008,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Dalhousie University","funders":"","keywords":"Adaptation (eye); Ridge; Computer science; Scaling; Point (geometry); Local adaptation; Selection (genetic algorithm); Algorithm; Mathematics; Artificial intelligence; Biology; Geography; Cartography; Neuroscience; Population; Geometry","score_opus":0.050759569294842787,"score_gpt":0.2727213170812062,"score_spread":0.22196174778636343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099840809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028842606,0.0003642033,0.96807367,0.00008961177,0.00002908059,0.000027937951,0.000008807262,0.00016179496,0.0024022444],"genre_scores_gemma":[0.71432024,0.00063391775,0.27942064,0.00014152551,0.00007502098,0.00013117549,0.000048292404,0.00015752352,0.005071659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995222,0.000164632,0.00002379531,0.000095899864,0.00015337196,0.000040130413],"domain_scores_gemma":[0.9980872,0.0011554887,0.00019010722,0.00025527133,0.00025301176,0.00005883981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541637,0.00044285276,0.00046096413,0.00046839437,0.00029393108,0.0007039117,0.00077636295,0.0007743078,0.0010952062],"category_scores_gemma":[0.0058342908,0.00020940496,0.0004931507,0.0005158962,0.0008439441,0.0011472715,0.00074007106,0.00090476306,0.000413309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007607725,0.000057452853,0.0012975637,0.00009042577,0.00006216408,0.00009261271,0.00011568158,0.7157131,0.024135742,0.069731206,0.00077397685,0.18785399],"study_design_scores_gemma":[0.000006131959,0.000050564886,0.00031095327,0.000008500961,0.000007074075,0.000043753127,0.000008527911,0.9825716,0.0031689208,0.01277664,0.0010373417,0.000009840469],"about_ca_topic_score_codex":0.0006509865,"about_ca_topic_score_gemma":0.00050842395,"teacher_disagreement_score":0.0010952062,"about_ca_system_score_codex":0.00040278156,"about_ca_system_score_gemma":0.000396203,"threshold_uncertainty_score":0.005575061},"labels":[],"label_agreement":null},{"id":"W2103940338","doi":"10.1109/coginf.2010.5599684","title":"A study of particle swarm optimization for cognitive machines","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Computer science; Mathematical optimization; Convergence (economics); Optimization problem; Transient (computer programming); Process (computing); Metaheuristic; Algorithm; Mathematics","score_opus":0.03792158580919486,"score_gpt":0.34596273190116417,"score_spread":0.3080411460919693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103940338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014861454,0.0025999667,0.96443915,0.0014278946,0.00021576497,0.00007153226,0.000033841727,0.00006259537,0.016287828],"genre_scores_gemma":[0.6139583,0.006087965,0.36885452,0.00049482763,0.0006762631,0.000494746,0.00010736712,0.00012084245,0.009205106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917233,0.0003725586,0.00004025195,0.000099938174,0.00026676472,0.000048096364],"domain_scores_gemma":[0.9967951,0.0025694054,0.00018462616,0.00013389315,0.00026520403,0.000051709143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021602837,0.0008417769,0.0009847386,0.00063746644,0.00078629283,0.0017531443,0.00067766424,0.0014319617,0.0014253686],"category_scores_gemma":[0.008644611,0.00043771125,0.0009984595,0.0007443314,0.0020677615,0.0019676706,0.0009150439,0.0018294923,0.00024856662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003286947,0.000029166513,0.0006650706,0.00015560852,0.000063635875,0.00010516745,0.00019545379,0.7043434,0.000994689,0.27160397,0.0010384804,0.020772481],"study_design_scores_gemma":[0.000009328726,0.00003907169,0.0002480084,0.000028130422,0.000009295769,0.00002737964,0.000023694698,0.9285534,0.00034890568,0.067381606,0.0033194406,0.000011744433],"about_ca_topic_score_codex":0.0038533113,"about_ca_topic_score_gemma":0.0010986521,"teacher_disagreement_score":0.0038533113,"about_ca_system_score_codex":0.0012295417,"about_ca_system_score_gemma":0.0010829004,"threshold_uncertainty_score":0.01142478},"labels":[],"label_agreement":null},{"id":"W2106889879","doi":"10.5555/1486693.1486717","title":"Solving large scale optimization problems by opposition-based differential evolution (ODE)","year":2008,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Ontario Tech University","funders":"","keywords":"Ode; Differential evolution; Initialization; Computer science; Mathematical optimization; Benchmark (surveying); Test suite; Suite; Applied mathematics; Algorithm; Mathematics; Test case; Machine learning","score_opus":0.01513323171256287,"score_gpt":0.23944514877755707,"score_spread":0.2243119170649942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106889879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07036367,0.00041637043,0.919126,0.00020924043,0.00007514776,0.00008633647,0.00003797162,0.00014624523,0.009539117],"genre_scores_gemma":[0.79588515,0.00031944216,0.20028336,0.00012422616,0.00002829044,0.00020948947,0.00009243114,0.000044459044,0.0030132283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996234,0.00016140357,0.000021322578,0.000037321963,0.0001299974,0.000026459935],"domain_scores_gemma":[0.99898404,0.00075711886,0.000074563075,0.000047624933,0.00011247323,0.00002420279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010852608,0.00044046185,0.0006249683,0.0004238856,0.00024056304,0.00063842826,0.0005893742,0.00073698245,0.0010672011],"category_scores_gemma":[0.0021447183,0.00018662466,0.0005448626,0.00045882937,0.00046430397,0.00043425366,0.0006969572,0.0005803862,0.00017388436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048954094,0.00004974403,0.00070699345,0.00009883756,0.000056472723,0.000068980924,0.000034449156,0.95818514,0.0035350432,0.0060738283,0.00031045903,0.0308311],"study_design_scores_gemma":[0.000008661109,0.00003373141,0.00008105137,0.000004462304,0.0000045729757,0.000017252818,0.0000040495356,0.9980069,0.0006191404,0.0007708748,0.000446564,0.0000028017694],"about_ca_topic_score_codex":0.0012287298,"about_ca_topic_score_gemma":0.0007493943,"teacher_disagreement_score":0.0012287298,"about_ca_system_score_codex":0.00044644834,"about_ca_system_score_gemma":0.00037840678,"threshold_uncertainty_score":0.00573951},"labels":[],"label_agreement":null},{"id":"W2107813763","doi":"10.1109/icec.1996.542676","title":"A scatter search approach for unconstrained continuous optimization","year":2002,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Exploit; Computer science; Bridge (graph theory); Population; Simple (philosophy); Genetic algorithm; Guided Local Search; Evolutionary algorithm; Hill climbing; Local search (optimization); Mathematical optimization; Artificial intelligence; Algorithm; Machine learning; Mathematics","score_opus":0.049209304376192725,"score_gpt":0.2708317693192688,"score_spread":0.22162246494307605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107813763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031371845,0.00024530324,0.9928376,0.000069203896,0.000023393932,0.000017442902,0.000015541627,0.00008068993,0.003573775],"genre_scores_gemma":[0.3124288,0.0013488749,0.66992974,0.0002504433,0.00014260749,0.00047042637,0.00021496216,0.00023311714,0.014981018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982053,0.000054804914,0.000006470441,0.000021116304,0.00008438913,0.000012740597],"domain_scores_gemma":[0.9997681,0.0001226896,0.000014657474,0.00002625657,0.000054432483,0.000013834577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042807803,0.0006792814,0.0006270766,0.0005594861,0.00032227332,0.0006437605,0.0005090568,0.0007309549,0.0034355693],"category_scores_gemma":[0.001065199,0.00028152738,0.0005222047,0.0010334015,0.00073309103,0.0006877738,0.0009976816,0.0008102954,0.0007445421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049179784,0.000039587638,0.00037475588,0.000091613765,0.00005003072,0.000069984075,0.000068158675,0.8106753,0.0053054914,0.09555146,0.0024927096,0.08523164],"study_design_scores_gemma":[0.000016213131,0.000055881475,0.00008423443,0.000014140615,0.000008349228,0.000040080766,0.000009795767,0.96626955,0.00096873153,0.027652755,0.0048724283,0.00000788654],"about_ca_topic_score_codex":0.0012553086,"about_ca_topic_score_gemma":0.0014032212,"teacher_disagreement_score":0.0034355693,"about_ca_system_score_codex":0.0003075284,"about_ca_system_score_gemma":0.00053844193,"threshold_uncertainty_score":0.011493146},"labels":[],"label_agreement":null},{"id":"W2109681092","doi":"10.5772/9030","title":"A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems","year":2010,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Computer science; Scheduling (production processes); Combinatorial optimization; Mathematical optimization; Mathematics; Algorithm","score_opus":0.027725495005364077,"score_gpt":0.2881115452434445,"score_spread":0.2603860502380804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109681092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034921973,0.00090400205,0.9874877,0.00011722018,0.00006091589,0.00006141785,0.000015194315,0.000142017,0.007719391],"genre_scores_gemma":[0.16039734,0.0023073675,0.82417566,0.00022480784,0.00014879054,0.0005565759,0.0001616701,0.000089390065,0.011938321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993862,0.00020869594,0.000030779425,0.00010740298,0.00022125307,0.00004576107],"domain_scores_gemma":[0.9997366,0.00015279427,0.000019063478,0.000035035126,0.000039957984,0.000016577287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009232369,0.0010872119,0.00096310175,0.0007463223,0.00047047203,0.00097653223,0.0014097691,0.0014634848,0.0034738039],"category_scores_gemma":[0.0012784019,0.0003479331,0.0012501065,0.0014652865,0.00069266284,0.00095548603,0.0012895634,0.0012515271,0.0008452683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056360757,0.00015503312,0.0002238841,0.0003127138,0.0001709528,0.00016440715,0.00014817325,0.60343003,0.0067988434,0.12468911,0.0064709173,0.25737953],"study_design_scores_gemma":[0.00004016211,0.0000904973,0.00008608253,0.00002471349,0.000030774714,0.00010501606,0.000020863485,0.96120167,0.0015349361,0.027159862,0.009694612,0.000010784803],"about_ca_topic_score_codex":0.0013374202,"about_ca_topic_score_gemma":0.0012886365,"teacher_disagreement_score":0.0034738039,"about_ca_system_score_codex":0.0005333191,"about_ca_system_score_gemma":0.0008496588,"threshold_uncertainty_score":0.011621058},"labels":[],"label_agreement":null},{"id":"W2111053428","doi":"","title":"Improving the Probability of Success of Repeated Genetic Algorithm on Affine Object Location Problem","year":2005,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Redundancy (engineering); Affine transformation; Probabilistic logic; Algorithm; Computer science; Operator (biology); Object (grammar); Genetic algorithm; Genetic operator; Mathematical optimization; Artificial intelligence; Theoretical computer science; Mathematics; Machine learning; Population-based incremental learning","score_opus":0.01733942542215965,"score_gpt":0.2629486897671943,"score_spread":0.24560926434503466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111053428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67601764,0.0034297083,0.30041176,0.0016470577,0.00025716826,0.00019464576,0.00015064504,0.00096673885,0.016924713],"genre_scores_gemma":[0.96162444,0.00052605727,0.035808533,0.00010000836,0.000069746675,0.000066198896,0.00015111126,0.00008890484,0.0015651482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978776,0.0009688935,0.00008381329,0.0002638209,0.00043773965,0.0003681014],"domain_scores_gemma":[0.9836712,0.013085829,0.0008071681,0.00075959775,0.00122477,0.00045152177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048942,0.00081303064,0.0016281278,0.0014016364,0.00083592546,0.0012763882,0.0018677047,0.0019918631,0.0027070646],"category_scores_gemma":[0.01778682,0.00038099143,0.00085466314,0.001093919,0.00089372875,0.0017080373,0.0011285336,0.0012415193,0.00034600496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054227567,0.00023134214,0.005888511,0.00014848655,0.00010990936,0.000111900685,0.00008537981,0.92333984,0.0015048833,0.0072486172,0.002209659,0.05857914],"study_design_scores_gemma":[0.000045753834,0.00012795455,0.0006712957,0.000012425746,0.000027761267,0.000043237884,0.000025818272,0.9954085,0.0005656765,0.0028006448,0.0002635476,0.000007388866],"about_ca_topic_score_codex":0.006698369,"about_ca_topic_score_gemma":0.004182625,"teacher_disagreement_score":0.006698369,"about_ca_system_score_codex":0.0013125951,"about_ca_system_score_gemma":0.0021916714,"threshold_uncertainty_score":0.016124547},"labels":[],"label_agreement":null},{"id":"W2113434670","doi":"10.1109/icci-cc.2014.6921440","title":"Position update mechanisms for enhanced particle swarm classification","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Particle swarm optimization; Position (finance); Centroid; Benchmark (surveying); Computer science; Multi-swarm optimization; Set (abstract data type); Swarm behaviour; Algorithm; Statistical classification; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.02863662732743854,"score_gpt":0.2978039184431385,"score_spread":0.2691672911157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113434670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031069575,0.0005050485,0.9654799,0.00015704166,0.0001258493,0.000052961317,0.000025231362,0.000513064,0.0020712328],"genre_scores_gemma":[0.6531092,0.0003415571,0.34307638,0.00015114776,0.00019850917,0.00014610398,0.00010933523,0.00009566813,0.002772125],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993556,0.00015012076,0.000054006996,0.0000999956,0.0002983834,0.000041839012],"domain_scores_gemma":[0.9982521,0.00069934456,0.0002211154,0.00032293156,0.00045349172,0.000050949166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013453016,0.00056924013,0.00066947873,0.0008905199,0.00047012858,0.0009256371,0.0014452236,0.0010204784,0.0016168231],"category_scores_gemma":[0.0057119867,0.0003187201,0.00032782392,0.00075856375,0.00052956276,0.0013572896,0.0008891294,0.0008134073,0.0004633103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002730163,0.00016647148,0.0022087125,0.00013467985,0.00006347227,0.00013971791,0.00018399057,0.46799818,0.020833427,0.023540476,0.002060811,0.4823971],"study_design_scores_gemma":[0.000020323407,0.000057109566,0.00031262214,0.0000071705767,0.000009882947,0.000035508798,0.0000060201132,0.993112,0.0028185397,0.002034465,0.0015783638,0.000007936886],"about_ca_topic_score_codex":0.0015233046,"about_ca_topic_score_gemma":0.0010971961,"teacher_disagreement_score":0.0016168231,"about_ca_system_score_codex":0.0004746454,"about_ca_system_score_gemma":0.00038290536,"threshold_uncertainty_score":0.007114768},"labels":[],"label_agreement":null},{"id":"W2114499446","doi":"10.1109/sis.2005.1501613","title":"Information exchange in multiple cooperating swarms","year":2005,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Information exchange; Computer science; Information sharing; Particle swarm optimization; Information quality; Best practice; Order (exchange); Distributed computing; Quality (philosophy); Information system; Algorithm; Engineering; World Wide Web","score_opus":0.027540648605150046,"score_gpt":0.27371216852430974,"score_spread":0.2461715199191597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114499446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23126008,0.0025250514,0.7275534,0.0017791465,0.0003028958,0.00043294282,0.00008270813,0.00051979005,0.035543893],"genre_scores_gemma":[0.91536,0.0009154781,0.07620493,0.000224519,0.00012937863,0.00029437695,0.00010220608,0.00004601033,0.0067230337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960045,0.0016727907,0.00032142556,0.0005023141,0.0011666773,0.0003323182],"domain_scores_gemma":[0.9922231,0.004427705,0.0010929622,0.0009504836,0.0008970499,0.00040873108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050648116,0.0008260529,0.0015589471,0.0013675296,0.0015484602,0.0031842329,0.0020357098,0.0020934907,0.0024058553],"category_scores_gemma":[0.013536389,0.00062419835,0.00083465147,0.0014064802,0.0016931955,0.0039167022,0.0034125294,0.0010272152,0.00047079165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006656708,0.00031743676,0.008228381,0.0007832975,0.00074858585,0.00335167,0.004019,0.53900605,0.017935777,0.26896405,0.0038282059,0.15215188],"study_design_scores_gemma":[0.00024087087,0.0005279448,0.0022422096,0.00016343743,0.000294936,0.00070601306,0.0010030225,0.78509146,0.005282637,0.1831431,0.021175867,0.00012849631],"about_ca_topic_score_codex":0.0016422621,"about_ca_topic_score_gemma":0.0008529717,"teacher_disagreement_score":0.0050648116,"about_ca_system_score_codex":0.0009893351,"about_ca_system_score_gemma":0.0009458232,"threshold_uncertainty_score":0.026785612},"labels":[],"label_agreement":null},{"id":"W2115933156","doi":"10.1002/cpe.3344","title":"Exploration/exploitation of a hybrid‐enhanced MPSO‐GA algorithm on a fused CPU‐GPU architecture","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Computer science; Metaheuristic; Algorithm; Central processing unit; Particle swarm optimization; Genetic algorithm; Parallel computing; Population; Local search (optimization); Artificial intelligence; Machine learning","score_opus":0.0282447798811836,"score_gpt":0.3269880132541699,"score_spread":0.29874323337298625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115933156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59668005,0.00042995586,0.380044,0.00041432178,0.000114209695,0.00007832872,0.000058660742,0.0011579585,0.021022502],"genre_scores_gemma":[0.8794255,0.00006105135,0.117293864,0.000052727268,0.000011140916,0.000048692997,0.000048790145,0.000041013936,0.0030171324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990034,0.000023062516,0.0000042212464,0.000017676017,0.00003269836,0.000022066846],"domain_scores_gemma":[0.9998611,0.000046895577,0.000012782678,0.000020917569,0.00003683952,0.000021483407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002854096,0.00038825203,0.0004398733,0.00027652094,0.00026620514,0.00046724983,0.00067123974,0.00059142534,0.0011928674],"category_scores_gemma":[0.00044380315,0.00020078177,0.00040355965,0.00023029758,0.0004537239,0.00024443268,0.0005657681,0.00037345706,0.00017651844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009982661,0.00003845936,0.00059938536,0.000025360809,0.00003142196,0.00013159079,0.000041857747,0.96135724,0.009986151,0.003193137,0.00053256424,0.023963014],"study_design_scores_gemma":[0.00000836959,0.000017312303,0.000075436525,0.0000015302338,0.000003727346,0.000009248527,0.0000045406055,0.99866295,0.0005821422,0.00041494027,0.00021785585,0.0000018845762],"about_ca_topic_score_codex":0.004925099,"about_ca_topic_score_gemma":0.003737621,"teacher_disagreement_score":0.004925099,"about_ca_system_score_codex":0.00045328552,"about_ca_system_score_gemma":0.00072575023,"threshold_uncertainty_score":0.009792864},"labels":[],"label_agreement":null},{"id":"W2118726465","doi":"10.1145/2330784.2331024","title":"Alpinist CellularDE","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Computer science; Local optimum; Local search (optimization); Evolutionary computation; Evolutionary algorithm; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.026442658303705947,"score_gpt":0.2810787584423271,"score_spread":0.25463610013862115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118726465","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015133499,0.0008453137,0.9508176,0.0004793851,0.00035871088,0.00015322419,0.00051902793,0.0042334185,0.027459878],"genre_scores_gemma":[0.17498931,0.0011545585,0.79427946,0.00053535245,0.00008647199,0.00055351626,0.0023380278,0.0007300365,0.025333215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997129,0.00006950465,0.000026836326,0.00006368259,0.000081850114,0.000045217876],"domain_scores_gemma":[0.9996014,0.0001202605,0.000027784274,0.00009765451,0.000122031124,0.00003087202],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034609405,0.0007655093,0.0006397168,0.00071594096,0.0006216685,0.0016619215,0.0015675827,0.0010481073,0.009968255],"category_scores_gemma":[0.0017153951,0.00029903845,0.000762586,0.0008891658,0.00036688987,0.0011514566,0.0013446215,0.001108969,0.004089297],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032596113,0.00018570606,0.0022466676,0.00036988917,0.00012080241,0.0003237147,0.00013038146,0.45019293,0.0072174952,0.084591016,0.031708885,0.4225865],"study_design_scores_gemma":[0.00007317507,0.00008664111,0.00020269884,0.00003689136,0.00003072161,0.00022474665,0.000038697115,0.8727287,0.0049576657,0.02267435,0.09892378,0.000021982185],"about_ca_topic_score_codex":0.0026550563,"about_ca_topic_score_gemma":0.0043436023,"teacher_disagreement_score":0.9900317,"about_ca_system_score_codex":0.0005011105,"about_ca_system_score_gemma":0.00086393126,"threshold_uncertainty_score":0.03334713},"labels":[],"label_agreement":null},{"id":"W2122253034","doi":"10.5267/j.dsl.2015.1.003","title":"A hybrid of genetic algorithm and Fletcher-Reeves for bound constrained optimization problems","year":2015,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Genetic algorithm; Computer science; Algorithm; Mathematics","score_opus":0.04515366211216674,"score_gpt":0.3136975840915204,"score_spread":0.2685439219793536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122253034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009483957,0.00044753586,0.98704976,0.00008457324,0.000032972468,0.00005569634,0.00001449698,0.00021976206,0.0026113398],"genre_scores_gemma":[0.16698629,0.00063786574,0.82739305,0.00017926942,0.00004059644,0.0003278928,0.00008643963,0.000118580065,0.004230141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943453,0.0001686043,0.000021481346,0.00008352944,0.00025406558,0.000037901485],"domain_scores_gemma":[0.99970585,0.00015179714,0.000025221905,0.000030544714,0.00007247851,0.000014006719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009785364,0.00092828006,0.0012225902,0.0011665624,0.00041561757,0.0007999513,0.0015627191,0.0017048182,0.0013006508],"category_scores_gemma":[0.0013519742,0.00042104756,0.0011357507,0.0010535491,0.0006112977,0.0011076597,0.00075575087,0.00087521126,0.00034254233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008665739,0.00008788272,0.00064031844,0.0001373516,0.00017235606,0.0001626243,0.00011023289,0.7528108,0.00685917,0.03135565,0.0013112277,0.20626575],"study_design_scores_gemma":[0.000028245691,0.00007893751,0.0001428601,0.000016813307,0.000019592348,0.000101752055,0.000011577314,0.99031186,0.0016655775,0.0039027296,0.003703243,0.000016878388],"about_ca_topic_score_codex":0.0036223133,"about_ca_topic_score_gemma":0.0036283107,"teacher_disagreement_score":0.0036223133,"about_ca_system_score_codex":0.00049065065,"about_ca_system_score_gemma":0.00069556484,"threshold_uncertainty_score":0.007202506},"labels":[],"label_agreement":null},{"id":"W2123111112","doi":"10.1109/ccece.2005.1557397","title":"New operators for integer permutation-based particle swarm optimizer","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Flocking (texture); Permutation (music); Mathematical optimization; Particle swarm optimization; Computer science; Operator (biology); Swarm intelligence; Shuffling; Multi-swarm optimization; Theoretical computer science; Mathematics","score_opus":0.018389631657941278,"score_gpt":0.2867866970316604,"score_spread":0.2683970653737191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123111112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023561514,0.00010178176,0.99428093,0.000079836645,0.000090111316,0.00005009657,0.000025806397,0.00025034026,0.002764877],"genre_scores_gemma":[0.11765101,0.00028772283,0.87633103,0.00016534416,0.00012561986,0.00035198536,0.00015059624,0.00019294335,0.0047436478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993467,0.00018476912,0.00005987242,0.00007913914,0.00028737608,0.00004213298],"domain_scores_gemma":[0.9995059,0.00022015176,0.000054648808,0.000076940785,0.00011291479,0.000029361181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011001088,0.0008889667,0.00045630088,0.0005177097,0.00037008923,0.00070891913,0.0010665464,0.00070239324,0.003188296],"category_scores_gemma":[0.002685789,0.00018888766,0.0005767445,0.0006140914,0.00061722216,0.0011270032,0.0009600149,0.0013538258,0.0008480452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032292822,0.00016582433,0.00076795387,0.000249631,0.000046754703,0.00036253195,0.00034772913,0.29551804,0.024797836,0.31963778,0.008117238,0.34966573],"study_design_scores_gemma":[0.000033234377,0.00008730268,0.00010887077,0.0000137139405,0.000011959595,0.00014899232,0.000016624852,0.9519636,0.0032426664,0.031100253,0.013252739,0.000019942936],"about_ca_topic_score_codex":0.0008125896,"about_ca_topic_score_gemma":0.0006809417,"teacher_disagreement_score":0.003188296,"about_ca_system_score_codex":0.00041596996,"about_ca_system_score_gemma":0.0005115994,"threshold_uncertainty_score":0.010665894},"labels":[],"label_agreement":null},{"id":"W2123535420","doi":"10.1162/evco_a_00125","title":"On the Behaviour of the (1, λ)-ES for Conically Constrained Linear Problems","year":2014,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Convergence (economics); Applied mathematics; Rate of convergence; Invariant (physics); Resampling; Computer science; Algorithm; Key (lock)","score_opus":0.026917931491045745,"score_gpt":0.2819890344616228,"score_spread":0.25507110297057706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123535420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31247777,0.0017950388,0.66709733,0.0010631324,0.00007441418,0.000103405924,0.00007542574,0.0002860119,0.01702755],"genre_scores_gemma":[0.91829246,0.00069823524,0.07761445,0.00024023297,0.000033257897,0.000097682925,0.00008594205,0.000118806165,0.0028187954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995845,0.00020690903,0.000020002593,0.00005322642,0.00008643985,0.00004901886],"domain_scores_gemma":[0.98616636,0.0122862,0.0006243881,0.00022132353,0.0004915215,0.000210278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039732507,0.0007296977,0.0007139447,0.0007971199,0.00044227517,0.000943394,0.0009289804,0.0013575449,0.0018235866],"category_scores_gemma":[0.024174077,0.00030391826,0.00048358165,0.0006301888,0.0014743115,0.0012791723,0.0009383846,0.0011014338,0.00022303773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062586725,0.00003305296,0.00082174793,0.000083912666,0.000031479136,0.00011569361,0.00011586873,0.95218736,0.0025866858,0.031119555,0.000562746,0.012279353],"study_design_scores_gemma":[0.00000483302,0.00003424019,0.00017351432,0.000016440063,0.000004935817,0.00003136826,0.000019538482,0.9936572,0.00034875434,0.0055693677,0.00013440024,0.0000055108035],"about_ca_topic_score_codex":0.0027312269,"about_ca_topic_score_gemma":0.0015685472,"teacher_disagreement_score":0.0039732507,"about_ca_system_score_codex":0.0008586789,"about_ca_system_score_gemma":0.00067197875,"threshold_uncertainty_score":0.021012783},"labels":[],"label_agreement":null},{"id":"W2123682012","doi":"10.1109/tevc.2007.894200","title":"Opposition-Based Differential Evolution","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1602,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Differential evolution; Ode; Initialization; Evolutionary algorithm; Curse of dimensionality; Population; Mathematical optimization; Benchmark (surveying); Evolutionary computation; Computer science; Nonlinear system; Algorithm; Mathematics; Artificial intelligence; Applied mathematics","score_opus":0.02639547269231373,"score_gpt":0.26227055416962397,"score_spread":0.23587508147731023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123682012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01617374,0.00045060055,0.9675655,0.0001635855,0.00009932745,0.000069007074,0.000039247076,0.00014992319,0.015289142],"genre_scores_gemma":[0.63553995,0.00087458966,0.3512546,0.00030494755,0.000067303685,0.0003362929,0.00013346314,0.00006270253,0.01142617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996587,0.00009477348,0.00001695944,0.000044675184,0.00016226864,0.000022584494],"domain_scores_gemma":[0.99953663,0.0002708391,0.000047021666,0.00003565259,0.00009225002,0.000017578004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005859855,0.00045883676,0.00081098755,0.0004108646,0.00024688942,0.0007535898,0.000870219,0.0007318342,0.0017804734],"category_scores_gemma":[0.0019181707,0.00019859278,0.0005089188,0.00046832897,0.0005411235,0.0005393349,0.00080115895,0.0007652857,0.00036294785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069088645,0.000058858866,0.0006666077,0.00016839444,0.000057338853,0.00015126857,0.0000919676,0.79573053,0.00892707,0.06446205,0.0014601328,0.12815669],"study_design_scores_gemma":[0.000018402983,0.000045873152,0.00012505247,0.000011110571,0.0000087861845,0.00007198095,0.0000076013152,0.98599446,0.0014303714,0.0077673215,0.0045086825,0.00001041552],"about_ca_topic_score_codex":0.0006315226,"about_ca_topic_score_gemma":0.0005505938,"teacher_disagreement_score":0.0017804734,"about_ca_system_score_codex":0.00042699702,"about_ca_system_score_gemma":0.00031189897,"threshold_uncertainty_score":0.005956292},"labels":[],"label_agreement":null},{"id":"W2123728119","doi":"10.1109/ipdps.2009.5161150","title":"An Aggregated Ant Colony Optimization approach for pricing options","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Profit (economics); Ant colony optimization algorithms; Mathematical optimization; Traverse; Node (physics); Shortest path problem; Optimization problem; Operations research; Microeconomics; Economics; Artificial intelligence; Mathematics; Engineering; Algorithm","score_opus":0.030328605132417825,"score_gpt":0.3141963081946118,"score_spread":0.283867703062194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123728119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018678077,0.00029555958,0.9739387,0.00022279624,0.00007868412,0.00005781218,0.00003376444,0.00019473057,0.006499869],"genre_scores_gemma":[0.60708463,0.00035243633,0.38525337,0.0001425261,0.00008273823,0.00018439199,0.00007775466,0.0000825464,0.0067395805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996265,0.000113182876,0.000016415881,0.00005356894,0.00015994988,0.000030377985],"domain_scores_gemma":[0.99951255,0.00023106497,0.000055824534,0.000035690442,0.0001263349,0.00003849665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046577482,0.00054480985,0.00083934754,0.0006539156,0.00041016057,0.00093760755,0.0011559108,0.0010254323,0.0019996015],"category_scores_gemma":[0.0014742981,0.00030062924,0.00063053786,0.0008454625,0.00044489343,0.0007776783,0.0006167294,0.00077643874,0.00026359243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015936826,0.000022554099,0.00019572006,0.000022840559,0.000027909196,0.000056735622,0.000024091836,0.96932286,0.0008289404,0.0063909804,0.00044495388,0.02264661],"study_design_scores_gemma":[0.0000025558668,0.00000612181,0.000021683281,0.0000010529385,0.0000025938637,0.000008047766,0.000002251401,0.99789834,0.000073312825,0.0016803726,0.00030201176,0.000001579685],"about_ca_topic_score_codex":0.004047228,"about_ca_topic_score_gemma":0.004287583,"teacher_disagreement_score":0.004047228,"about_ca_system_score_codex":0.00055499305,"about_ca_system_score_gemma":0.0006785852,"threshold_uncertainty_score":0.008047342},"labels":[],"label_agreement":null},{"id":"W2124261928","doi":"10.1162/1063656053583423","title":"Space Complexity of Estimation of Distribution Algorithms","year":2005,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"EDAS; Estimation of distribution algorithm; Algorithm; Bayesian network; Mathematics; Computational complexity theory; Mathematical optimization; Computer science; Evolutionary algorithm; Distribution (mathematics); Space (punctuation); Genetic algorithm; Artificial intelligence","score_opus":0.035567672083433144,"score_gpt":0.3086057288146757,"score_spread":0.27303805673124254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124261928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06274954,0.0012435042,0.9265388,0.0018440194,0.00007187196,0.00018234443,0.00028302023,0.00082065136,0.0062662857],"genre_scores_gemma":[0.64195734,0.0012384303,0.35084248,0.00039084203,0.00016487793,0.00054045307,0.00087559194,0.0003856713,0.0036043865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904717,0.0050332444,0.0005601854,0.0010007687,0.0024859179,0.00044818353],"domain_scores_gemma":[0.94139963,0.049804438,0.0016383677,0.0039402675,0.0028073722,0.00040995047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006792772,0.0010803688,0.0016075057,0.0015344276,0.0009975529,0.003633027,0.0018297171,0.0016951269,0.0052766916],"category_scores_gemma":[0.051701255,0.00061879243,0.0011344013,0.0018095191,0.0021526262,0.0068816524,0.0028539316,0.0028279596,0.0009457159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069422997,0.00015999786,0.0040796576,0.0004239774,0.00015231139,0.00011657411,0.0003864517,0.6342404,0.002635574,0.1914137,0.0032296795,0.16246744],"study_design_scores_gemma":[0.000045220095,0.00007219235,0.00044319354,0.000028234585,0.000021228196,0.000051252468,0.00007282097,0.90497285,0.0012898671,0.09174398,0.0012420606,0.000017102078],"about_ca_topic_score_codex":0.00338147,"about_ca_topic_score_gemma":0.0023409608,"teacher_disagreement_score":0.006792772,"about_ca_system_score_codex":0.0025164534,"about_ca_system_score_gemma":0.0027288988,"threshold_uncertainty_score":0.035924017},"labels":[],"label_agreement":null},{"id":"W2124732687","doi":"10.1109/ccece.2008.4564775","title":"Searching for structure in data with fuzzy clusters of variable dimensionality of feature subspaces","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Linear subspace; Cluster analysis; Dimensionality reduction; Reduction (mathematics); Computer science; Fuzzy clustering; Feature (linguistics); Fuzzy logic; Data mining; Particle swarm optimization; Pattern recognition (psychology); Artificial intelligence; Curse of dimensionality; Mathematics; Algorithm","score_opus":0.03191149864284218,"score_gpt":0.24023972204035476,"score_spread":0.20832822339751259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124732687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0854509,0.00029300095,0.91303754,0.00027132395,0.0000067838196,0.00007083553,0.00004772351,0.00006661259,0.0007552905],"genre_scores_gemma":[0.43607965,0.00033276787,0.56250536,0.00006446246,0.00002853121,0.0001703531,0.00016871771,0.000023951907,0.00062618504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868804,0.00050851173,0.00007120141,0.00028839815,0.00035817345,0.00008560285],"domain_scores_gemma":[0.99702066,0.0020406197,0.0003909599,0.00024620525,0.00023929254,0.000062362866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026554163,0.00048555993,0.001279809,0.0018952271,0.0011199223,0.0018040034,0.00094635,0.0011452772,0.0006156057],"category_scores_gemma":[0.009159607,0.0005677679,0.0010339878,0.0016840597,0.0019795396,0.001820501,0.0014655517,0.000875293,0.00014862532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003528094,0.00019446979,0.009510646,0.0005828302,0.00028069207,0.0004993595,0.0023155033,0.5553469,0.015894884,0.20915052,0.0017852965,0.20408614],"study_design_scores_gemma":[0.00002602076,0.00008605506,0.0015651119,0.000036576537,0.00003566541,0.00013398254,0.00033405932,0.85480386,0.0029440694,0.13904214,0.0009573101,0.00003516696],"about_ca_topic_score_codex":0.001669847,"about_ca_topic_score_gemma":0.001441787,"teacher_disagreement_score":0.0026554163,"about_ca_system_score_codex":0.00081973086,"about_ca_system_score_gemma":0.0012344379,"threshold_uncertainty_score":0.014043331},"labels":[],"label_agreement":null},{"id":"W2125142487","doi":"10.1109/cec.2015.7257040","title":"Ring optimization with extinction","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Extinction (optical mineralogy); Ring (chemistry); Computer science; Geology; Paleontology; Chemistry","score_opus":0.04647036512656202,"score_gpt":0.280914914358956,"score_spread":0.23444454923239397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125142487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3730662,0.0014514972,0.59638286,0.00055607833,0.00013182497,0.00011060694,0.000120104036,0.00060387043,0.02757702],"genre_scores_gemma":[0.9394426,0.0002121197,0.055549707,0.00013570403,0.000019478093,0.00007497234,0.00006104876,0.000099979945,0.004404365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997472,0.00009835999,0.000011360138,0.00003867801,0.000056958106,0.000047429796],"domain_scores_gemma":[0.999353,0.00038492214,0.000066114066,0.000069047564,0.00008639107,0.00004060328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007341981,0.0004149195,0.0007020734,0.00032317758,0.00034029712,0.00057075184,0.0006222015,0.00071819365,0.0024790673],"category_scores_gemma":[0.0022980736,0.00016363156,0.0004535725,0.0003088668,0.00057692867,0.0007591488,0.0009566129,0.0005536204,0.00023578755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000820949,0.00004250514,0.00058176235,0.000058337657,0.000025762534,0.00006379341,0.00003459284,0.96532214,0.0023371433,0.013911272,0.0007532496,0.016787289],"study_design_scores_gemma":[0.00001891548,0.00008411375,0.00016572198,0.0000055352984,0.000009075079,0.000026160007,0.000010397736,0.9942311,0.001137538,0.0035007494,0.00080629456,0.000004456535],"about_ca_topic_score_codex":0.0016115314,"about_ca_topic_score_gemma":0.0008566477,"teacher_disagreement_score":0.0024790673,"about_ca_system_score_codex":0.0004945556,"about_ca_system_score_gemma":0.0004583758,"threshold_uncertainty_score":0.008293331},"labels":[],"label_agreement":null},{"id":"W2127027513","doi":"10.1109/ccece.2008.4564490","title":"Efficiency competition on N-queen problem: DE vs. CMA-ES","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"CMA-ES; Differential evolution; Robustness (evolution); Evolution strategy; Mathematical optimization; Convergence (economics); Evolutionary algorithm; Computer science; Evolutionary computation; Rate of convergence; Mathematics; Covariance matrix; Algorithm; Key (lock)","score_opus":0.017917157975263862,"score_gpt":0.21179147958029457,"score_spread":0.1938743216050307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127027513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34506223,0.0034359654,0.6057104,0.0013224914,0.00027196217,0.00025832045,0.00015842762,0.0004395042,0.043340705],"genre_scores_gemma":[0.8099821,0.00064003485,0.18248592,0.00030662617,0.000067066285,0.00018652188,0.00018513319,0.00009681502,0.006049733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852777,0.00072357664,0.00007230816,0.00017101564,0.00040396463,0.00010137628],"domain_scores_gemma":[0.99335444,0.005255974,0.00028623187,0.00037151712,0.000563678,0.00016817849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034913735,0.0006640532,0.0011703722,0.0011190168,0.00046027583,0.0011134534,0.0014521139,0.0014511171,0.0026126762],"category_scores_gemma":[0.009422091,0.00017447096,0.0004740619,0.0008934308,0.00064281846,0.0012621292,0.00096006296,0.00078534445,0.00026863316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004704054,0.00023767118,0.0027173604,0.00026597077,0.0001651116,0.0001001977,0.00008773838,0.82395875,0.0030462611,0.031079493,0.0018416116,0.13602939],"study_design_scores_gemma":[0.00006172397,0.00021064983,0.00076150347,0.000016952801,0.000026003261,0.00008430988,0.00003874844,0.99210876,0.0015607724,0.003784997,0.0013343452,0.000011339343],"about_ca_topic_score_codex":0.0020605705,"about_ca_topic_score_gemma":0.0022278195,"teacher_disagreement_score":0.0034913735,"about_ca_system_score_codex":0.00071304,"about_ca_system_score_gemma":0.0009873135,"threshold_uncertainty_score":0.018464386},"labels":[],"label_agreement":null},{"id":"W2129526759","doi":"10.1007/3-540-44886-1_30","title":"An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ant colony optimization algorithms; Computer science; Protein structure prediction; Benchmark (surveying); Algorithm; Protein folding; Ant colony; Focus (optics); Folding (DSP implementation); Protein structure; Chemistry","score_opus":0.02395973256592805,"score_gpt":0.28334347114580616,"score_spread":0.2593837385798781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129526759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023319574,0.0005082967,0.9633207,0.00026017663,0.0002251594,0.00013775182,0.000102315564,0.0011169689,0.0110090645],"genre_scores_gemma":[0.13430552,0.00029153703,0.8586441,0.00017985741,0.000101112986,0.00032864796,0.00021929463,0.00029112305,0.0056388555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996935,0.00008909239,0.000013189755,0.00004363182,0.00012964079,0.000030953343],"domain_scores_gemma":[0.9995554,0.00022765735,0.000027591957,0.000049812243,0.00011026137,0.000029210223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061428954,0.00095144176,0.0015604397,0.0005890951,0.00058987323,0.0007574993,0.0017338555,0.0016924258,0.0047857803],"category_scores_gemma":[0.001404322,0.0005362074,0.0007509975,0.00088938355,0.0004644275,0.0007633127,0.0012205341,0.0011699136,0.0010916569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012737428,0.00008878786,0.0002828006,0.00010214275,0.000040733674,0.00009199211,0.0000497201,0.83683455,0.0031773287,0.005149676,0.0033282053,0.15072669],"study_design_scores_gemma":[0.000021711734,0.000017635091,0.000045402652,0.000003130916,0.0000050663966,0.000014544492,0.000004287102,0.9978508,0.00021770693,0.0011225869,0.0006939716,0.0000031398686],"about_ca_topic_score_codex":0.004528993,"about_ca_topic_score_gemma":0.0043979953,"teacher_disagreement_score":0.0047857803,"about_ca_system_score_codex":0.00045191482,"about_ca_system_score_gemma":0.00088902185,"threshold_uncertainty_score":0.016009986},"labels":[],"label_agreement":null},{"id":"W2131373329","doi":"10.1109/isda.2009.216","title":"A Scalability Test for Accelerated DE Using Generalized Opposition-Based Learning","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Scalability; Differential evolution; Computer science; Ode; Benchmark (surveying); Metaheuristic; Population; Opposition (politics); Machine learning; Mathematical optimization; Artificial intelligence; Mathematics; Applied mathematics","score_opus":0.07222411078257278,"score_gpt":0.3580393510089142,"score_spread":0.2858152402263414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131373329","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6506363,0.001960021,0.325208,0.00085181865,0.0002774106,0.00049808546,0.0004043583,0.0019843595,0.01817961],"genre_scores_gemma":[0.9011171,0.0002988291,0.09622576,0.00008584253,0.00003394961,0.00021583299,0.00053129205,0.0001387412,0.0013526663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972228,0.0011291595,0.00014484866,0.00022349138,0.0010714406,0.00020829085],"domain_scores_gemma":[0.9902721,0.006033728,0.00050600554,0.0014503587,0.0015442205,0.00019361236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045782323,0.00066590565,0.00075810414,0.00076579716,0.00035361978,0.0005712705,0.0008476845,0.0006654898,0.0015549058],"category_scores_gemma":[0.01769748,0.00015915604,0.0005676183,0.0007240577,0.00062596984,0.0013640533,0.00097557536,0.0010704196,0.00022910225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015926245,0.00071459025,0.005284067,0.00037392,0.00023739463,0.0003316133,0.0001022177,0.7441173,0.018517813,0.0096085705,0.0029830004,0.21613677],"study_design_scores_gemma":[0.00019999212,0.0014251098,0.0023037996,0.000038517537,0.00004004266,0.0002258768,0.0000656333,0.9761138,0.013873915,0.0033870346,0.0023003418,0.000025992647],"about_ca_topic_score_codex":0.0012276535,"about_ca_topic_score_gemma":0.00094475044,"teacher_disagreement_score":0.0045782323,"about_ca_system_score_codex":0.000435648,"about_ca_system_score_gemma":0.0006735791,"threshold_uncertainty_score":0.0242123},"labels":[],"label_agreement":null},{"id":"W2132055170","doi":"10.1109/foci.2007.372167","title":"Simulated Annealing with Opposite Neighbors","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Simulated annealing; Adaptive simulated annealing; Computer science; Annealing (glass); Opposition (politics); Rate of convergence; Algorithm; Mathematical optimization; Mathematics; Materials science","score_opus":0.011264609399555519,"score_gpt":0.2681736353011252,"score_spread":0.25690902590156967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132055170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017658565,0.0002037983,0.97180545,0.0001457466,0.00013306738,0.000058498103,0.000016049695,0.00020854632,0.009770278],"genre_scores_gemma":[0.5132939,0.0002491851,0.47824922,0.00022257036,0.000065237175,0.00024953243,0.000082765335,0.0001413841,0.007446214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850696,0.00072882423,0.000055315802,0.00020012468,0.0004328902,0.000075791395],"domain_scores_gemma":[0.998806,0.00066246383,0.00008180597,0.00025078168,0.00015684273,0.00004218752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011980821,0.00046712003,0.00097777,0.00058443705,0.0005707445,0.0009478529,0.0012155164,0.0011309485,0.002204731],"category_scores_gemma":[0.004070569,0.00040207335,0.0009523274,0.0004911464,0.0010463095,0.0012408781,0.0012785157,0.0012444118,0.00046213416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019390446,0.000103137565,0.00063981366,0.00010960022,0.00012048129,0.00009518937,0.00017238228,0.76816434,0.008171901,0.14085297,0.00088718336,0.08048903],"study_design_scores_gemma":[0.000028275781,0.00008672372,0.000091688875,0.0000114668765,0.000017348715,0.000059208378,0.000013648859,0.967202,0.0024689026,0.024914246,0.0050895563,0.00001692606],"about_ca_topic_score_codex":0.00086210243,"about_ca_topic_score_gemma":0.0009332084,"teacher_disagreement_score":0.002204731,"about_ca_system_score_codex":0.0005077936,"about_ca_system_score_gemma":0.0005710881,"threshold_uncertainty_score":0.007375598},"labels":[],"label_agreement":null},{"id":"W2132721978","doi":"10.1145/2330163.2330174","title":"Gaussian mixture modeling for dynamic particle swarm optimization of recurrent problems","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Particle swarm optimization; Optimization problem; Embedding; Multi-swarm optimization; Mathematical optimization; Mixture model; Focus (optics); Digital watermarking; Representation (politics); Gaussian; Algorithm; Artificial intelligence; Image (mathematics); Mathematics","score_opus":0.041982000992780544,"score_gpt":0.3134523187551221,"score_spread":0.27147031776234154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132721978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030085687,0.00021435264,0.9956601,0.00010523137,0.00003518438,0.000019883177,0.000021545557,0.00012947667,0.0008055211],"genre_scores_gemma":[0.5248379,0.0011117776,0.46625534,0.00024753183,0.00014828308,0.00060927845,0.00037257606,0.0002037561,0.0062135383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951494,0.00020282094,0.000030296454,0.00008106708,0.00013062662,0.00004035155],"domain_scores_gemma":[0.9992343,0.00046953125,0.00008126978,0.000058348098,0.00013355375,0.00002303094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001225016,0.0013608354,0.0011254557,0.0006236786,0.00039280232,0.00094649836,0.0013175564,0.0012406973,0.0017619493],"category_scores_gemma":[0.0032904623,0.00061488734,0.0012209127,0.00089659623,0.00079839665,0.0009221082,0.0009464803,0.0016390614,0.0005009498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022429673,0.000014419121,0.00023047766,0.000043495074,0.000032887398,0.00002451912,0.00003309537,0.9740974,0.0007218783,0.01161851,0.00045803445,0.012702981],"study_design_scores_gemma":[0.0000020486018,0.0000055167056,0.000018302679,0.000001817536,0.000002249007,0.0000025418035,0.0000017777253,0.99815196,0.00008105047,0.001514935,0.00021589006,0.0000020215937],"about_ca_topic_score_codex":0.006359061,"about_ca_topic_score_gemma":0.004621088,"teacher_disagreement_score":0.006359061,"about_ca_system_score_codex":0.00074986654,"about_ca_system_score_gemma":0.00091417594,"threshold_uncertainty_score":0.012644112},"labels":[],"label_agreement":null},{"id":"W2133287603","doi":"10.5539/mer.v4n2p16","title":"CNC Machining Path Planning Optimization for Circular Hole Patterns via a Hybrid Ant Colony Optimization Approach","year":2014,"lang":"en","type":"article","venue":"Mechanical Engineering Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Saud University","keywords":"Ant colony optimization algorithms; Machining; Travelling salesman problem; Tool path; Numerical control; Ant colony; Path (computing); Engineering; Computer science; Software; Engineering drawing; Mathematical optimization; Mechanical engineering; Algorithm; Mathematics","score_opus":0.04380084229406707,"score_gpt":0.3085023961854714,"score_spread":0.2647015538914043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133287603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042056616,0.00024374871,0.95057774,0.0001322716,0.00002918449,0.00008981213,0.000033482178,0.00018209527,0.0066551333],"genre_scores_gemma":[0.598848,0.00020926357,0.39575392,0.0000713459,0.000016719121,0.00026053135,0.00007494835,0.00008126725,0.0046840105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997577,0.000067132576,0.000007864345,0.00004725809,0.00009136851,0.000028609898],"domain_scores_gemma":[0.99962246,0.0002048062,0.0000499124,0.0000209546,0.00008170054,0.00002011653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045316346,0.0005781777,0.00055522745,0.0006128396,0.00031875868,0.00056172174,0.00074880896,0.0006939023,0.0011330626],"category_scores_gemma":[0.0008958196,0.00035935978,0.00050093164,0.00060707703,0.00041839824,0.00034826595,0.00041926184,0.00042639236,0.000138153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016385511,0.000018265939,0.00016391053,0.000022551725,0.000011556298,0.00002565403,0.000017505594,0.9842228,0.0011884038,0.0019450291,0.00018460442,0.012183259],"study_design_scores_gemma":[0.000002628215,0.0000119743545,0.000037929418,0.0000012333759,0.0000019678528,0.0000058321343,0.000002797827,0.99928063,0.00014463092,0.00030794097,0.00020107072,0.000001230967],"about_ca_topic_score_codex":0.007565396,"about_ca_topic_score_gemma":0.0062245154,"teacher_disagreement_score":0.007565396,"about_ca_system_score_codex":0.00061286584,"about_ca_system_score_gemma":0.00096474105,"threshold_uncertainty_score":0.015042722},"labels":[],"label_agreement":null},{"id":"W2133583641","doi":"10.1016/j.asoc.2016.09.042","title":"Micro-differential evolution: Diversity enhancement and a comparative study","year":2016,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Ontario Institute of Technology","funders":"","keywords":"Benchmark (surveying); Mutation; Differential evolution; Premature convergence; Computer science; Population; Convergence (economics); Population size; Evolutionary algorithm; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Particle swarm optimization; Geography","score_opus":0.04291256960497788,"score_gpt":0.2857363797054781,"score_spread":0.24282381010050022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133583641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6870064,0.023700956,0.2260611,0.0007712979,0.00026842326,0.00013717887,0.00007893485,0.00018070711,0.061795004],"genre_scores_gemma":[0.9646091,0.0034557336,0.028260542,0.000049846054,0.0000613159,0.000026271386,0.000032804957,0.00002046074,0.0034839367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.00019976651,0.000018810179,0.000037686237,0.00020652688,0.00004930968],"domain_scores_gemma":[0.9983352,0.0011212834,0.00007655259,0.00013624023,0.00026804264,0.00006282528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009347697,0.00033508328,0.0006373865,0.00131252,0.00032301032,0.0007892599,0.0006685226,0.0005356771,0.0013243348],"category_scores_gemma":[0.0033174139,0.00011985065,0.00046608748,0.0016332834,0.0004922323,0.00081612583,0.0007147449,0.00038721875,0.00012651559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053400977,0.00044734206,0.01144253,0.0005585988,0.0002994164,0.00029825536,0.00028040228,0.39212558,0.012352064,0.057122927,0.0016000033,0.52293885],"study_design_scores_gemma":[0.00005053222,0.00083114876,0.004925377,0.000057811292,0.0001231285,0.0005525851,0.00014591336,0.9736757,0.0063911774,0.0076618674,0.0055579455,0.000026862528],"about_ca_topic_score_codex":0.0007249314,"about_ca_topic_score_gemma":0.00079170463,"teacher_disagreement_score":0.0013243348,"about_ca_system_score_codex":0.0004819969,"about_ca_system_score_gemma":0.0002639264,"threshold_uncertainty_score":0.0049435496},"labels":[],"label_agreement":null},{"id":"W2134788587","doi":"10.1109/sis.2007.368044","title":"Applying Opposition-Based Ideas to the Ant Colony System","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Ant colony optimization algorithms; Synchronizing; Opposition (politics); Computer science; ANT; Ant colony; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; Computer network","score_opus":0.02070064834814609,"score_gpt":0.29380474932538503,"score_spread":0.2731041009772389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134788587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008400971,0.00073620706,0.9711547,0.00036109064,0.00016846748,0.00006055206,0.000011340241,0.00011331792,0.018993337],"genre_scores_gemma":[0.39609435,0.001982113,0.5912178,0.00034469558,0.00024160105,0.000305892,0.000053234435,0.0001116037,0.009648737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910897,0.00038888902,0.00003982447,0.00006771251,0.00035031987,0.000044292414],"domain_scores_gemma":[0.99924636,0.00042670133,0.00006465736,0.00008520238,0.00014292113,0.00003415734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010732465,0.00044303449,0.0006842737,0.00069316936,0.0004893834,0.0014709766,0.0010178544,0.0007990211,0.0015708534],"category_scores_gemma":[0.00254864,0.00026536614,0.00067374215,0.00059415225,0.0014868977,0.0013485061,0.0015061162,0.0013266678,0.00043625664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011455312,0.00006529785,0.00058519753,0.00032290016,0.00011552426,0.00035506586,0.0005384251,0.31492275,0.0095749535,0.5205598,0.0018138121,0.15103167],"study_design_scores_gemma":[0.00005941869,0.00015832054,0.00021666265,0.00006923032,0.000046041318,0.00039947577,0.000088889596,0.7319046,0.0035547875,0.21623074,0.04722418,0.000047571637],"about_ca_topic_score_codex":0.0005707981,"about_ca_topic_score_gemma":0.0004864378,"teacher_disagreement_score":0.0015708534,"about_ca_system_score_codex":0.0004907582,"about_ca_system_score_gemma":0.00048245382,"threshold_uncertainty_score":0.005675912},"labels":[],"label_agreement":null},{"id":"W2137849348","doi":"10.1016/s0166-218x(01)00338-9","title":"A survey of very large-scale neighborhood search techniques","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":639,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Heuristic; Mathematics; Mathematical optimization; Local search (optimization); Variable neighborhood search; Search algorithm; Computation; Algorithm; Incremental heuristic search; Scale (ratio); Computer science; Beam search; Metaheuristic","score_opus":0.041361962283819484,"score_gpt":0.29085607512228484,"score_spread":0.24949411283846534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137849348","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003397173,0.046699386,0.9398813,0.00039346443,0.00027799673,0.00007981484,0.0000755027,0.0003281831,0.008867119],"genre_scores_gemma":[0.11161461,0.062751964,0.81514585,0.00046344323,0.00087120186,0.00039480207,0.0006096577,0.00033043436,0.0078179985],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894327,0.00031818604,0.000083221435,0.00014034133,0.00047861843,0.000036408383],"domain_scores_gemma":[0.99898285,0.00054192205,0.000061502404,0.00016008917,0.0002244348,0.000029155013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013282248,0.0008437841,0.0023027062,0.0013653797,0.0006839976,0.0015966721,0.0020673817,0.0011792352,0.0033027425],"category_scores_gemma":[0.0034664597,0.0004796176,0.0009951688,0.0045848256,0.00053646276,0.0023119464,0.0013583843,0.0011303035,0.0013886939],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092163165,0.00014156051,0.0006670111,0.0014244029,0.00016968804,0.00005558025,0.000083491635,0.10438571,0.0019624692,0.074503906,0.009366123,0.80714786],"study_design_scores_gemma":[0.000071563125,0.0002091713,0.0007582846,0.00032953083,0.00013249283,0.00037343727,0.000086154236,0.80446786,0.0020980882,0.106306754,0.085119784,0.000046820478],"about_ca_topic_score_codex":0.0013990785,"about_ca_topic_score_gemma":0.0017450382,"teacher_disagreement_score":0.0033027425,"about_ca_system_score_codex":0.0004738735,"about_ca_system_score_gemma":0.0006907508,"threshold_uncertainty_score":0.011048794},"labels":[],"label_agreement":null},{"id":"W2138588773","doi":"10.1007/s10489-014-0613-2","title":"Measuring the curse of dimensionality and its effects on particle swarm optimization and differential evolution","year":2014,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":169,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Curse of dimensionality; Differential evolution; Computer science; Particle swarm optimization; Divergence (linguistics); Population; Mathematical optimization; Swarm behaviour; Algorithm; Artificial intelligence; Mathematics","score_opus":0.027362055206610544,"score_gpt":0.2593924310048275,"score_spread":0.23203037579821695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138588773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6889029,0.0043237763,0.29237318,0.001345328,0.00034378798,0.00008211078,0.00023937969,0.00042446883,0.011965063],"genre_scores_gemma":[0.95848095,0.00060680823,0.03987869,0.00006436654,0.000037759648,0.000032991516,0.000064751584,0.000109226996,0.0007244669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997687,0.0012238909,0.00014754955,0.00017833042,0.0006544753,0.00010875576],"domain_scores_gemma":[0.94217575,0.050079554,0.0017508727,0.0033084056,0.0023966425,0.00028879195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004009423,0.00052507734,0.0007791378,0.0008875145,0.00057843066,0.0011988002,0.00037681943,0.0010247646,0.00077648496],"category_scores_gemma":[0.0615416,0.00032334737,0.0004035956,0.0012490215,0.0011800802,0.0030407812,0.0010924824,0.0010269897,0.00013822099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007879927,0.00036790664,0.023371084,0.0006620308,0.00025323138,0.00038357213,0.00078769965,0.7695581,0.01883749,0.038453225,0.0022496195,0.14428811],"study_design_scores_gemma":[0.000020238254,0.00018340892,0.008397265,0.000040286366,0.00005560001,0.00019229946,0.00009743821,0.9659481,0.013230212,0.010700037,0.0010837212,0.000051534716],"about_ca_topic_score_codex":0.0021442622,"about_ca_topic_score_gemma":0.0018768249,"teacher_disagreement_score":0.004009423,"about_ca_system_score_codex":0.00065946474,"about_ca_system_score_gemma":0.00062716147,"threshold_uncertainty_score":0.021204114},"labels":[],"label_agreement":null},{"id":"W2139068682","doi":"10.1162/evco.2006.14.3.291","title":"Optimum Tracking with Evolution Strategies","year":2006,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Evolution strategy; Mathematical optimization; Simple (philosophy); Adaptation (eye); Tracking (education); Computer science; Population; Contrast (vision); Task (project management); Scaling; Evolutionary algorithm; Optimization problem; Mathematics; Artificial intelligence; Engineering","score_opus":0.012970411711664439,"score_gpt":0.25958375829585384,"score_spread":0.2466133465841894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139068682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009202098,0.00087430794,0.9812525,0.00018364999,0.000042729862,0.000036282487,0.000012884518,0.0001624241,0.008233134],"genre_scores_gemma":[0.43107742,0.0021963753,0.5566168,0.00022849516,0.00009973893,0.0004215014,0.00007103,0.00013655191,0.009152131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00021100795,0.000028826202,0.00008400035,0.00016647129,0.00003244685],"domain_scores_gemma":[0.99930644,0.00046828523,0.00007832925,0.00006318379,0.0000675024,0.000016197702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065511,0.0007652722,0.000812789,0.00068726274,0.00033716165,0.001079483,0.0006730892,0.0012330443,0.0017831553],"category_scores_gemma":[0.0042958087,0.00046300903,0.00056646817,0.00078943896,0.00086912717,0.0012779763,0.0010511191,0.0007667741,0.00045517206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003685989,0.000028039896,0.0003267238,0.00010258954,0.000050567545,0.00006460573,0.00007985553,0.8116509,0.0023563392,0.11468408,0.001013909,0.06960556],"study_design_scores_gemma":[0.000019240539,0.000040593084,0.000105243766,0.000018529421,0.000013776123,0.00004144502,0.000009261826,0.95460343,0.00066631974,0.041125037,0.003346883,0.000010387622],"about_ca_topic_score_codex":0.0011667074,"about_ca_topic_score_gemma":0.00078969443,"teacher_disagreement_score":0.0017831553,"about_ca_system_score_codex":0.00071716297,"about_ca_system_score_gemma":0.00065211946,"threshold_uncertainty_score":0.0059652925},"labels":[],"label_agreement":null},{"id":"W2139894151","doi":"10.1109/cec.2011.5949948","title":"Enhanced Differential Evolution using center-based sampling","year":2011,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Ode; Differential evolution; Benchmark (surveying); Range (aeronautics); Algorithm; Computer science; Mathematical optimization; Scale (ratio); Ordinary differential equation; Mathematics; Differential equation; Applied mathematics; Mathematical analysis; Engineering","score_opus":0.1214932312729185,"score_gpt":0.31931635794331137,"score_spread":0.19782312667039287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139894151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039031148,0.00023519472,0.95657754,0.00007537504,0.00004330146,0.000047084766,0.000027897839,0.000260905,0.00370162],"genre_scores_gemma":[0.60969394,0.00021958408,0.38602144,0.00009648482,0.000035580222,0.00013346357,0.00011661167,0.000066302106,0.00361656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959856,0.00012536193,0.000015092773,0.00006336068,0.00016969041,0.000027961361],"domain_scores_gemma":[0.99930644,0.00034603276,0.000052302086,0.00008809827,0.00018073678,0.000026367321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841772,0.0003609159,0.0007549677,0.0004917284,0.00021794533,0.00050973124,0.00086389756,0.0005775727,0.0012009975],"category_scores_gemma":[0.0022225787,0.00021848608,0.0005591036,0.00045902625,0.00038454402,0.000623637,0.0008210513,0.00044684348,0.00020415758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013197192,0.00008365797,0.0014393155,0.00008243924,0.000050986375,0.00013156075,0.000097772594,0.83079183,0.016554952,0.025326446,0.0009838662,0.12432523],"study_design_scores_gemma":[0.000007414652,0.000020193074,0.00008749573,0.0000018344291,0.0000034295647,0.00001848317,0.0000020954574,0.99734974,0.0010439756,0.0008107049,0.0006513666,0.0000032679352],"about_ca_topic_score_codex":0.0014004222,"about_ca_topic_score_gemma":0.0011292605,"teacher_disagreement_score":0.0014004222,"about_ca_system_score_codex":0.0005012462,"about_ca_system_score_gemma":0.00047365288,"threshold_uncertainty_score":0.005204916},"labels":[],"label_agreement":null},{"id":"W2139944186","doi":"10.4018/ijamc.2014100101","title":"Centroid Opposition-Based Differential Evolution","year":2014,"lang":"en","type":"article","venue":"International Journal of Applied Metaheuristic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo; Ontario Tech University","funders":"","keywords":"Ode; Differential evolution; Centroid; Benchmark (surveying); Population; Mathematical optimization; Algorithm; Mathematics; Opposition (politics); Nonlinear system; Evolutionary algorithm; Computer science; Applied mathematics; Artificial intelligence; Physics; Law","score_opus":0.008994044164295193,"score_gpt":0.25966775568062767,"score_spread":0.2506737115163325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139944186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013355779,0.00052546785,0.96608037,0.00012671796,0.00012432855,0.00005090734,0.000047983922,0.00019103066,0.01949736],"genre_scores_gemma":[0.6895098,0.0009511518,0.29312897,0.00018146005,0.00007713111,0.00021707985,0.00021285964,0.00009139904,0.01563023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.000058975318,0.000014307459,0.000050188166,0.00017323134,0.000025140806],"domain_scores_gemma":[0.9997273,0.00010879509,0.000033459273,0.000027321505,0.00008875321,0.000014226606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003913204,0.00043853297,0.0008019005,0.00045125597,0.00031147018,0.0009094875,0.0010278573,0.00076468324,0.001997032],"category_scores_gemma":[0.0013593037,0.00017040483,0.0005536674,0.00065398536,0.0004930132,0.0006030713,0.0008185991,0.000611192,0.0003990866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009579991,0.000043464363,0.0007814641,0.00017535259,0.000046069086,0.00020699353,0.00012506693,0.75425416,0.015430322,0.07390242,0.0025164085,0.15242244],"study_design_scores_gemma":[0.000010305627,0.00003163299,0.00011752431,0.0000072112475,0.000008414159,0.000060144044,0.0000059368645,0.99038774,0.0016018876,0.0037208383,0.004038504,0.0000097353],"about_ca_topic_score_codex":0.0015218243,"about_ca_topic_score_gemma":0.0011147026,"teacher_disagreement_score":0.001997032,"about_ca_system_score_codex":0.0007154322,"about_ca_system_score_gemma":0.0004168798,"threshold_uncertainty_score":0.006680727},"labels":[],"label_agreement":null},{"id":"W2140727865","doi":"10.1007/s11721-009-0037-5","title":"A cooperative particle swarm optimizer with migration of heterogeneous probabilistic models","year":2009,"lang":"en","type":"article","venue":"Swarm Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Probabilistic logic; Computer science; Swarm behaviour; Mathematical optimization; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.03775588129553465,"score_gpt":0.28717538900988326,"score_spread":0.24941950771434862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140727865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019424181,0.00012714147,0.976253,0.00016111505,0.000089804285,0.00009780438,0.000029893867,0.0007225139,0.003094505],"genre_scores_gemma":[0.34815884,0.00012035471,0.64492,0.00016354912,0.00009555225,0.00036468968,0.00012848755,0.0001756327,0.0058728773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968433,0.00009957478,0.000022339987,0.00006167022,0.00010108529,0.000031110056],"domain_scores_gemma":[0.99947447,0.00021641848,0.00005122772,0.00008764074,0.00012112638,0.000049119782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015247267,0.00095110736,0.0013254283,0.00065355765,0.000739283,0.0010422688,0.0021838695,0.00227447,0.0017850718],"category_scores_gemma":[0.0021602702,0.0006743306,0.0009728359,0.00067742757,0.0005506145,0.00091447425,0.0016768092,0.0009637851,0.0007754741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009437315,0.00009820155,0.0004682807,0.00003817794,0.00009584971,0.00009805003,0.0000652091,0.9392889,0.0025968165,0.004688384,0.0011353526,0.05133237],"study_design_scores_gemma":[0.000012873541,0.000013901481,0.000025751364,9.426791e-7,0.0000057385573,0.000006868717,0.0000026814555,0.9992073,0.00017120971,0.00029771557,0.00025259782,0.000002437422],"about_ca_topic_score_codex":0.0050662463,"about_ca_topic_score_gemma":0.0044384887,"teacher_disagreement_score":0.0050662463,"about_ca_system_score_codex":0.00044002954,"about_ca_system_score_gemma":0.00086268137,"threshold_uncertainty_score":0.010073543},"labels":[],"label_agreement":null},{"id":"W2141099810","doi":"10.1109/sis.2007.368047","title":"Multiple Cooperating Swarms for Data Clustering","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Particle swarm optimization; Swarm behaviour; Computer science; Swarm intelligence; Class (philosophy); Multi-swarm optimization; Data mining; Artificial intelligence; Machine learning","score_opus":0.12319308962569467,"score_gpt":0.37335254450904226,"score_spread":0.25015945488334757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141099810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122594405,0.0007207025,0.9853078,0.00015044879,0.00006678596,0.00006340358,0.000024279652,0.0003243353,0.0010827325],"genre_scores_gemma":[0.37201458,0.0009228778,0.6234817,0.000115451396,0.00014323996,0.00026508063,0.00021697373,0.000110076806,0.0027300606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798703,0.00078994595,0.00014085016,0.00035108437,0.00062257046,0.0001085236],"domain_scores_gemma":[0.9983449,0.000598731,0.00023495418,0.00036304587,0.00037658456,0.00008182219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023415333,0.00086478906,0.0013195286,0.0014915442,0.00094402756,0.0011457447,0.0014175139,0.001019873,0.0007255715],"category_scores_gemma":[0.003912641,0.00046785912,0.0011075283,0.001986765,0.0006972938,0.0013924801,0.0013847802,0.00093763665,0.00042001272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025345277,0.00016150472,0.004398243,0.0003397892,0.0005398559,0.00050367735,0.0008097677,0.518221,0.024966665,0.03942119,0.0051946244,0.40519023],"study_design_scores_gemma":[0.000018250466,0.00007527568,0.0005376918,0.00001544369,0.000048156868,0.00017530586,0.00006243782,0.98177737,0.0032890125,0.008594983,0.005380393,0.000025741603],"about_ca_topic_score_codex":0.0019733985,"about_ca_topic_score_gemma":0.001936975,"teacher_disagreement_score":0.0023415333,"about_ca_system_score_codex":0.0006470174,"about_ca_system_score_gemma":0.0006994052,"threshold_uncertainty_score":0.012383401},"labels":[],"label_agreement":null},{"id":"W2141258159","doi":"10.1109/cec.2006.1688618","title":"The Distribution Genetic Algorithm: Evolving a Population of Distributions","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Crossover; Genetic algorithm; Test suite; Population; Computer science; Mutation; Representation (politics); Algorithm; Suite; Binary number; Artificial intelligence; Mathematics; Machine learning; Test case","score_opus":0.008355095890864766,"score_gpt":0.25147543850480114,"score_spread":0.24312034261393636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141258159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007840256,0.00010872816,0.9893981,0.0001312697,0.000036661426,0.00005169478,0.000021218875,0.0002900546,0.0021220727],"genre_scores_gemma":[0.2009866,0.00038949758,0.79191536,0.0002703773,0.000072000665,0.00037043332,0.00013129707,0.00017670766,0.0056877313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946064,0.00016948377,0.000015655436,0.000103642386,0.00021310945,0.00003746869],"domain_scores_gemma":[0.9994979,0.00023787278,0.00004512063,0.000083239705,0.00010900221,0.000026822725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011536897,0.000538209,0.0006408408,0.0006751637,0.00030131792,0.00091464893,0.0017363812,0.00084809447,0.0015455709],"category_scores_gemma":[0.00277306,0.00024417692,0.0003564427,0.0009332186,0.0009163666,0.0012504107,0.0010283246,0.0009667967,0.0004295287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009015498,0.00013719841,0.002674839,0.000121100624,0.000129764,0.00014783617,0.00028602514,0.40047815,0.0151928365,0.12356706,0.004216309,0.45295873],"study_design_scores_gemma":[0.00008177899,0.00010116083,0.00035296212,0.000016733207,0.000036182806,0.00018488136,0.000027351287,0.95585734,0.0051758746,0.022005234,0.016137177,0.000023385403],"about_ca_topic_score_codex":0.0020071208,"about_ca_topic_score_gemma":0.002025098,"teacher_disagreement_score":0.0020071208,"about_ca_system_score_codex":0.00056783744,"about_ca_system_score_gemma":0.00095703173,"threshold_uncertainty_score":0.00610137},"labels":[],"label_agreement":null},{"id":"W2142265433","doi":"10.1162/evco_a_00088","title":"Resampling versus Repair in Evolution Strategies Applied to a Constrained Linear Problem","year":2012,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Resampling; Mathematical optimization; Computer science; Mathematics; Algorithm","score_opus":0.038483416312789384,"score_gpt":0.3212428018295873,"score_spread":0.2827593855167979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142265433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24766658,0.00087938656,0.7465411,0.00035401373,0.000036940775,0.00008735275,0.000009392174,0.00016433309,0.0042609684],"genre_scores_gemma":[0.8893317,0.0003028115,0.10840043,0.000087287335,0.000017474906,0.00010617768,0.000018544692,0.000049235296,0.0016863025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932265,0.00042039395,0.000022575505,0.00006579995,0.00010730719,0.00006124823],"domain_scores_gemma":[0.9923644,0.006760254,0.00042707336,0.00018559882,0.00017751205,0.0000851121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002865323,0.00061066507,0.000613047,0.00064204977,0.00029186133,0.0006141783,0.0007153425,0.0010430426,0.0008497832],"category_scores_gemma":[0.01247957,0.00024456836,0.00052240404,0.00046883416,0.0010048571,0.0007479745,0.0005065408,0.0005903643,0.00011058829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008260761,0.00006324063,0.00081626786,0.000073178606,0.00005281444,0.00010588612,0.00017039884,0.93427795,0.0037251462,0.03241257,0.000178097,0.028041841],"study_design_scores_gemma":[0.00000905506,0.000098968856,0.00014407108,0.0000063555135,0.000008370283,0.000025455825,0.000015661819,0.9941414,0.00086535985,0.004504921,0.00017427515,0.0000060879534],"about_ca_topic_score_codex":0.0019037043,"about_ca_topic_score_gemma":0.0011689467,"teacher_disagreement_score":0.002865323,"about_ca_system_score_codex":0.0006570888,"about_ca_system_score_gemma":0.00032731582,"threshold_uncertainty_score":0.015153468},"labels":[],"label_agreement":null},{"id":"W2143062943","doi":"10.14796/jwmm.r208-06","title":"Robustness of the Rainpak Algorithm for Storm Direction and Speed","year":2002,"lang":"en","type":"article","venue":"Journal of Water Management Modeling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Philips (Canada); University of Guelph","funders":"","keywords":"Robustness (evolution); Storm; Algorithm; Computer science; Speedup; Meteorology; Geography; Parallel computing","score_opus":0.04076184767571714,"score_gpt":0.25778022770569653,"score_spread":0.2170183800299794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143062943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13350096,0.00036699447,0.8599339,0.0004511503,0.00006961512,0.00014947934,0.00015633793,0.0009659633,0.004405626],"genre_scores_gemma":[0.8219664,0.00021572628,0.17541142,0.00013411073,0.00004202495,0.00016064857,0.0002816729,0.00029532076,0.0014926608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976859,0.0008262689,0.00013547654,0.0004620781,0.00059121486,0.0002991027],"domain_scores_gemma":[0.9889215,0.0076601137,0.000981226,0.0011063623,0.0010592052,0.00027151682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005283912,0.00080082956,0.0013199451,0.00081399386,0.0010361494,0.0019921977,0.001545615,0.0011674316,0.0012415183],"category_scores_gemma":[0.028834965,0.0005040195,0.0006154346,0.0006437559,0.001591445,0.0017405603,0.0017030468,0.001572028,0.00035530192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027399708,0.000025968833,0.002317454,0.000031270964,0.00005983536,0.00002588215,0.00004682631,0.9586354,0.0012191214,0.007994938,0.0005121942,0.028857173],"study_design_scores_gemma":[0.000012390399,0.000016654702,0.0001689878,0.0000049425494,0.0000048981688,0.000008695606,0.00000935487,0.9966365,0.0005496917,0.0024019794,0.0001813941,0.0000044579283],"about_ca_topic_score_codex":0.008701812,"about_ca_topic_score_gemma":0.0034498707,"teacher_disagreement_score":0.008701812,"about_ca_system_score_codex":0.0019844698,"about_ca_system_score_gemma":0.00376172,"threshold_uncertainty_score":0.027944326},"labels":[],"label_agreement":null},{"id":"W2144540753","doi":"","title":"Toward effective initialization for large-scale search spaces","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Ontario Tech University","funders":"","keywords":"Initialization; Population; Mathematical optimization; Computer science; Benchmark (surveying); Latin hypercube sampling; Differential evolution; Particle swarm optimization; A priori and a posteriori; Monte Carlo method; Algorithm; Mathematics; Statistics","score_opus":0.036817982566020466,"score_gpt":0.33767853261290937,"score_spread":0.3008605500468889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144540753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023180723,0.00020157198,0.9745973,0.00008543303,0.000027014745,0.00005957223,0.000015720456,0.0003588296,0.001473904],"genre_scores_gemma":[0.40424058,0.00023254627,0.59375733,0.00009361097,0.000045803918,0.00029056825,0.00015897573,0.00014134188,0.0010392652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992378,0.0003416198,0.00003996251,0.000088881156,0.00023916436,0.000052624342],"domain_scores_gemma":[0.9978842,0.0008871653,0.00021894644,0.0002886223,0.00064750726,0.00007349379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021182066,0.00070586015,0.00064610934,0.0012152808,0.0006030466,0.0009222742,0.0009689393,0.0008862676,0.0016442616],"category_scores_gemma":[0.007224807,0.00040627283,0.00037366236,0.0010147014,0.00083058147,0.0014034176,0.0015792549,0.0008922904,0.00069292623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022283486,0.00014669693,0.002212905,0.00016032418,0.00006443315,0.0001329687,0.00025499437,0.79046416,0.01271244,0.040514294,0.00316607,0.14994791],"study_design_scores_gemma":[0.000022183662,0.00003627202,0.00016228747,0.000012350307,0.000007099892,0.000032377942,0.000016362654,0.9907719,0.003455649,0.0043137916,0.0011648176,0.0000049345967],"about_ca_topic_score_codex":0.0008718661,"about_ca_topic_score_gemma":0.00075059826,"teacher_disagreement_score":0.0021182066,"about_ca_system_score_codex":0.00066540454,"about_ca_system_score_gemma":0.0007786182,"threshold_uncertainty_score":0.011202276},"labels":[],"label_agreement":null},{"id":"W2144573902","doi":"10.1109/sde.2011.5952059","title":"Opposition-based Differential Evolution with protective generation jumping","year":2011,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Jumping; Ode; Differential evolution; Benchmark (surveying); Population; Computer science; Mathematical optimization; Mathematics; Algorithm; Applied mathematics; Biology","score_opus":0.05788424346125766,"score_gpt":0.24946776960908906,"score_spread":0.19158352614783142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144573902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027009161,0.00020106572,0.9623808,0.0001490061,0.00010366443,0.00009801001,0.000029911582,0.00029552943,0.009732774],"genre_scores_gemma":[0.7651718,0.00026963276,0.22836648,0.00019118158,0.000056274217,0.00036653064,0.00009484758,0.00006982738,0.0054133767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994704,0.00014963215,0.000029082996,0.00006914352,0.00023271865,0.000049038237],"domain_scores_gemma":[0.99946326,0.00027755453,0.00006944337,0.000056082765,0.000099006735,0.00003467263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006777763,0.00060281676,0.0008921925,0.0005884172,0.00033021477,0.0006456785,0.0011410009,0.00085339847,0.0016634103],"category_scores_gemma":[0.0020322816,0.00022649764,0.0006924061,0.00060163374,0.0006413241,0.00058590894,0.0010215649,0.00080416945,0.00026134402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012042487,0.00010309241,0.00102999,0.0001622781,0.000076953744,0.00030460546,0.00015529538,0.8443676,0.01455221,0.043258853,0.0011029955,0.09476561],"study_design_scores_gemma":[0.000029230487,0.000083051804,0.00014051402,0.0000069161706,0.000014912823,0.00007099558,0.000006802312,0.9917977,0.0016140962,0.0043950104,0.0018297302,0.00001104928],"about_ca_topic_score_codex":0.00096838735,"about_ca_topic_score_gemma":0.0006207299,"teacher_disagreement_score":0.0016634103,"about_ca_system_score_codex":0.0004487211,"about_ca_system_score_gemma":0.00047501927,"threshold_uncertainty_score":0.0055646896},"labels":[],"label_agreement":null},{"id":"W2145224703","doi":"","title":"The AID Method for Global Optimization","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematical optimization; Global optimization; Benchmark (surveying); Minification; Computer science; Population; Diversification (marketing strategy); Function (biology); Mathematics; Biology","score_opus":0.13021669306649986,"score_gpt":0.42655424674246667,"score_spread":0.2963375536759668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145224703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016292844,0.00037433283,0.99140114,0.00009488566,0.00006095862,0.00004719524,0.000035832134,0.0002661583,0.0060902145],"genre_scores_gemma":[0.09448616,0.00062373694,0.8939987,0.0002186422,0.00011133537,0.0004467904,0.0001548966,0.00029704924,0.0096627055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934155,0.00025581333,0.00002225428,0.00006284023,0.00027102602,0.000046470854],"domain_scores_gemma":[0.9994948,0.0002372282,0.00004204453,0.000086529246,0.00010544663,0.000033887147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013268093,0.0010037338,0.0010773584,0.0012822065,0.00057709665,0.0010596188,0.0013564645,0.0010554418,0.006116482],"category_scores_gemma":[0.0022818737,0.00042500652,0.0010992959,0.0009370253,0.0010123565,0.0009267804,0.0022657348,0.0019610361,0.0012026065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011086755,0.00006364542,0.0006981588,0.00036789785,0.00012196873,0.00011155939,0.00013710764,0.4848631,0.0064626923,0.2222367,0.009701243,0.275125],"study_design_scores_gemma":[0.000048518705,0.0000749778,0.00017760086,0.000039569197,0.000029310222,0.0000999022,0.00002022464,0.9403392,0.00183883,0.033667244,0.023644963,0.000019664933],"about_ca_topic_score_codex":0.0012928211,"about_ca_topic_score_gemma":0.0012266156,"teacher_disagreement_score":0.006116482,"about_ca_system_score_codex":0.00055613555,"about_ca_system_score_gemma":0.0013059189,"threshold_uncertainty_score":0.020461679},"labels":[],"label_agreement":null},{"id":"W2145283597","doi":"10.1016/j.patcog.2012.12.011","title":"Particle swarm classification: A survey and positioning","year":2013,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Computer science; Data mining; Domain (mathematical analysis); Machine learning; Statistical classification; Artificial intelligence; Mathematics; Geography","score_opus":0.08805631784522881,"score_gpt":0.2949895283895999,"score_spread":0.20693321054437108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145283597","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014485884,0.21805653,0.7366137,0.003647862,0.0016673326,0.00021896105,0.00038556207,0.0007842231,0.024139924],"genre_scores_gemma":[0.22793409,0.3098192,0.43518272,0.0009952484,0.0034090008,0.0004089627,0.0015511626,0.0002464959,0.020453187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993216,0.00010736173,0.0000789951,0.00016887826,0.0002837161,0.0000394554],"domain_scores_gemma":[0.9990138,0.00037030206,0.00009290648,0.00009696891,0.00038684352,0.00003919442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001034415,0.00089090434,0.0018605287,0.0021551063,0.0006517532,0.0029427945,0.0014779128,0.0018074138,0.0024251125],"category_scores_gemma":[0.0028011615,0.0004590693,0.00069200003,0.0066830222,0.00071189046,0.0023461638,0.00085358194,0.000907184,0.0017642085],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006206641,0.00010136166,0.00236484,0.0010576682,0.000071080205,0.000042704265,0.00008368173,0.029328264,0.0010647115,0.010248517,0.0128100095,0.9427651],"study_design_scores_gemma":[0.00007823909,0.00035002735,0.0068570008,0.0010140887,0.00023317682,0.0007366236,0.0005837991,0.70305383,0.0050370377,0.05517052,0.22675474,0.00013091003],"about_ca_topic_score_codex":0.004124752,"about_ca_topic_score_gemma":0.0026402487,"teacher_disagreement_score":0.004124752,"about_ca_system_score_codex":0.00060867344,"about_ca_system_score_gemma":0.0010801748,"threshold_uncertainty_score":0.00820148},"labels":[],"label_agreement":null},{"id":"W2145321636","doi":"10.1109/nabic.2014.6921883","title":"Effect of communication topologies on hybrid evolutionary algorithms","year":2014,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Network topology; Particle swarm optimization; Computer science; Evolutionary algorithm; Swarm behaviour; Population; Genetic algorithm; Algorithm; Hybrid algorithm (constraint satisfaction); Swarm intelligence; Algorithm design; Mathematical optimization; Topology (electrical circuits); Mathematics; Artificial intelligence; Machine learning; Computer network","score_opus":0.014674970879015823,"score_gpt":0.3017582855312839,"score_spread":0.2870833146522681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145321636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87279844,0.0006401476,0.11120046,0.00043271488,0.00007659478,0.00007031025,0.000044505792,0.00043883096,0.014297997],"genre_scores_gemma":[0.98473096,0.00011666843,0.014603783,0.000022386668,0.000008643943,0.000037444875,0.00001649676,0.000035091973,0.0004286171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881375,0.0008045533,0.000048996484,0.00006223055,0.00019507874,0.00007534566],"domain_scores_gemma":[0.9898393,0.0083872555,0.00043343962,0.00056609843,0.0005867962,0.00018718325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017707497,0.0006695409,0.00037697912,0.00075097353,0.0005920271,0.0012569095,0.00069956644,0.0007987866,0.0013828138],"category_scores_gemma":[0.014447859,0.00032499,0.0002589256,0.0005637296,0.0006987313,0.0013977215,0.0008855467,0.00045026324,0.00020481113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001929897,0.000078448305,0.0025631997,0.000052432904,0.000046918685,0.00013146027,0.00012928227,0.95942974,0.0037367584,0.006561137,0.0001870902,0.026890641],"study_design_scores_gemma":[0.00004229582,0.00020915687,0.00070137763,0.000014426965,0.000036106972,0.000101456106,0.000085894884,0.99118185,0.0036259827,0.0034059884,0.0005825062,0.000013036113],"about_ca_topic_score_codex":0.00057132007,"about_ca_topic_score_gemma":0.00060504023,"teacher_disagreement_score":0.0017707497,"about_ca_system_score_codex":0.0003891883,"about_ca_system_score_gemma":0.0002696853,"threshold_uncertainty_score":0.009364724},"labels":[],"label_agreement":null},{"id":"W2148600622","doi":"10.1109/cec.2006.1688534","title":"Opposition-Based Differential Evolution for Optimization of Noisy Problems","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Russian Science Foundation","keywords":"Initialization; Differential evolution; Computer science; Benchmark (surveying); Mathematical optimization; Population; Optimization problem; Convergence (economics); Optimization algorithm; Algorithm; Artificial intelligence; Mathematics","score_opus":0.014550683731895941,"score_gpt":0.2494523002541933,"score_spread":0.23490161652229735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148600622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004397307,0.00033837595,0.99202126,0.00009238667,0.000038611342,0.000022274617,0.000009594694,0.000065752436,0.0030144816],"genre_scores_gemma":[0.42110786,0.001115756,0.5724615,0.00021821559,0.0001063727,0.00045540664,0.00009486209,0.00008806169,0.0043519656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999567,0.00017269037,0.000021178805,0.000040685434,0.0001774014,0.000021053567],"domain_scores_gemma":[0.99944705,0.000384092,0.000053345375,0.000031686155,0.00006838788,0.000015443735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010537851,0.0005949734,0.00088418124,0.00048811972,0.00031096872,0.0006263503,0.0007557001,0.0008182977,0.0010900109],"category_scores_gemma":[0.0022379349,0.00024354264,0.000543116,0.00069859816,0.0005862847,0.000555923,0.00090017775,0.0011325123,0.0002466546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000367235,0.000035166846,0.0003590564,0.00014842482,0.000042349227,0.000107513195,0.000088110966,0.8802868,0.0054542623,0.04467652,0.0008171193,0.06794793],"study_design_scores_gemma":[0.000009009672,0.000022613254,0.000054352484,0.00000776829,0.000005092451,0.000025731508,0.000004528512,0.98951775,0.0007863662,0.0074430252,0.002117787,0.0000058922897],"about_ca_topic_score_codex":0.00065573474,"about_ca_topic_score_gemma":0.00055878237,"teacher_disagreement_score":0.0010900109,"about_ca_system_score_codex":0.00048435226,"about_ca_system_score_gemma":0.00037482078,"threshold_uncertainty_score":0.0055729747},"labels":[],"label_agreement":null},{"id":"W2153260109","doi":"10.1109/tcyb.2013.2279211","title":"Differential Evolution With Two-Level Parameter Adaptation","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":226,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Beijing Information Science and Technology University; Huazhong University of Science and Technology; Shenyang Institute of Automation; National Natural Science Foundation of China; Ministère de l'Économie, de l’Innovation et des Exportations du Québec","keywords":"Population; Convergence (economics); Computer science; Adaptive control; Mathematical optimization; Mathematics; Algorithm; Artificial intelligence; Control (management)","score_opus":0.034222114150810334,"score_gpt":0.26010961615886075,"score_spread":0.2258875020080504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153260109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024394777,0.00048382735,0.9697177,0.000111299174,0.000055442644,0.000068424866,0.000026407597,0.00037893665,0.004763243],"genre_scores_gemma":[0.77102053,0.0004613568,0.22291958,0.00017471287,0.00003665577,0.00033580765,0.00010885082,0.0000694965,0.0048729503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995542,0.00010820194,0.000032950415,0.00010275371,0.00016438609,0.000037410817],"domain_scores_gemma":[0.99945647,0.00026183217,0.000058776746,0.000088392764,0.000118521864,0.000016002086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007424201,0.0007334974,0.00090396724,0.0004771372,0.00023475882,0.0008249489,0.0011700082,0.00090512435,0.0011923113],"category_scores_gemma":[0.0023243853,0.00032168487,0.00060968345,0.00055208436,0.0006113301,0.0007149445,0.0009550497,0.0008922334,0.0003457372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048427584,0.00006151292,0.0013904348,0.00010872417,0.00008044641,0.000121471145,0.000092379705,0.8681617,0.0104561895,0.014411704,0.00073981483,0.10432726],"study_design_scores_gemma":[0.000013063514,0.00003083028,0.00018117421,0.000005114097,0.000010520761,0.000046481924,0.0000041778276,0.9948427,0.0014452955,0.0019947465,0.0014158832,0.0000099784265],"about_ca_topic_score_codex":0.0012811829,"about_ca_topic_score_gemma":0.00078992697,"teacher_disagreement_score":0.0012811829,"about_ca_system_score_codex":0.0005376937,"about_ca_system_score_gemma":0.00038968187,"threshold_uncertainty_score":0.0039886236},"labels":[],"label_agreement":null},{"id":"W2153654605","doi":"10.1016/j.dam.2005.05.020","title":"First vs. best improvement: An empirical study","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Constructive; Travelling salesman problem; Mathematics; Enhanced Data Rates for GSM Evolution; Heuristic; Mathematical optimization; Greedy algorithm; Algorithm; Combinatorics; Computer science; Artificial intelligence; Process (computing)","score_opus":0.03618088057861051,"score_gpt":0.3343979954373477,"score_spread":0.2982171148587372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153654605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9581467,0.008086776,0.014476814,0.0008260066,0.0001592618,0.00021779619,0.0021320705,0.0010866347,0.0148680555],"genre_scores_gemma":[0.9815547,0.00073552656,0.013470941,0.00009824863,0.00007219275,0.000060518436,0.0011525735,0.00032416655,0.0025311136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98984325,0.0037132625,0.00071817014,0.0014243909,0.0033894174,0.0009115223],"domain_scores_gemma":[0.65485376,0.29484504,0.011214819,0.023351004,0.011041318,0.004694001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017616319,0.0008676432,0.0019695584,0.0044637523,0.001327844,0.0020481737,0.0022489897,0.0019209974,0.005765733],"category_scores_gemma":[0.10546029,0.0004904683,0.0018015852,0.003129821,0.001010893,0.0043678926,0.001226549,0.0035414165,0.0015073539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013998849,0.0061579775,0.26219645,0.0021841743,0.0016814987,0.00046938178,0.0015141125,0.10982406,0.00425588,0.010375346,0.02041923,0.5669231],"study_design_scores_gemma":[0.0015699165,0.0236206,0.39294955,0.0006710176,0.00351511,0.0054318435,0.0030455778,0.4978823,0.02111485,0.028115047,0.021731162,0.00035301413],"about_ca_topic_score_codex":0.0022160364,"about_ca_topic_score_gemma":0.0031180216,"teacher_disagreement_score":0.017616319,"about_ca_system_score_codex":0.0016804058,"about_ca_system_score_gemma":0.001479418,"threshold_uncertainty_score":0.0931651},"labels":[],"label_agreement":null},{"id":"W2154369526","doi":"10.1109/cec.2006.1688554","title":"Opposition-Based Differential Evolution Algorithms","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":184,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Differential evolution; Initialization; Evolutionary algorithm; Computer science; Benchmark (surveying); Population; Evolutionary computation; Swarm intelligence; Mathematical optimization; Computational intelligence; Algorithm; Artificial intelligence; Cultural algorithm; Machine learning; Optimization problem; Particle swarm optimization; Meta-optimization; Mathematics","score_opus":0.011364183312258833,"score_gpt":0.24798302129868888,"score_spread":0.23661883798643005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154369526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00525869,0.00069855765,0.9803423,0.00012661549,0.000092267976,0.00007485954,0.00003712066,0.00023580516,0.013133663],"genre_scores_gemma":[0.4309149,0.0017053424,0.5497909,0.00034253448,0.000110205976,0.0005209054,0.00020763426,0.00011028714,0.016297266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996513,0.00009407301,0.000018479028,0.000045431167,0.00016420054,0.000026454843],"domain_scores_gemma":[0.9996935,0.00015777364,0.00003716201,0.000029172497,0.00006637727,0.000016046703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005626142,0.0005902453,0.0011375243,0.00044387803,0.00033816783,0.0008938527,0.0012327818,0.0010003095,0.0029511913],"category_scores_gemma":[0.0014462797,0.00026218232,0.00048254099,0.0006381263,0.00051959994,0.0006399973,0.00096276595,0.0008417187,0.0008276961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076121825,0.00008102524,0.0005291638,0.00021561548,0.00006342609,0.00013232627,0.000083807754,0.6942729,0.006086124,0.082591206,0.002900375,0.21296799],"study_design_scores_gemma":[0.000025968222,0.000036620575,0.000083629624,0.00001250316,0.0000095184,0.00006337197,0.0000072005805,0.9806459,0.001121907,0.010316811,0.0076663336,0.000010227912],"about_ca_topic_score_codex":0.0006923886,"about_ca_topic_score_gemma":0.00063333364,"teacher_disagreement_score":0.0029511913,"about_ca_system_score_codex":0.0004072758,"about_ca_system_score_gemma":0.0003626262,"threshold_uncertainty_score":0.009872735},"labels":[],"label_agreement":null},{"id":"W2155370091","doi":"10.1007/s00500-010-0642-7","title":"Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems","year":2010,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Differential evolution; Initialization; Ode; Opposition (politics); Mathematical optimization; Computer science; Population; Mathematics; Evolutionary algorithm; Algorithm; Applied mathematics","score_opus":0.0106242622329757,"score_gpt":0.2517901850349561,"score_spread":0.2411659228019804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155370091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027757589,0.00043913908,0.96317434,0.00015062418,0.000102389524,0.00004271826,0.000018324145,0.00010666421,0.008208241],"genre_scores_gemma":[0.6148564,0.00039484233,0.37896487,0.0001607102,0.00007696508,0.00023267035,0.000063063104,0.00007990221,0.0051704543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996208,0.00013116554,0.000014848897,0.00002104338,0.00018506603,0.00002699368],"domain_scores_gemma":[0.99944454,0.00036941798,0.00004194074,0.00002771289,0.00009649862,0.000019812987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010819647,0.00046950363,0.0008605927,0.0005125307,0.0002711334,0.00066556816,0.00093983463,0.0009779983,0.0014183782],"category_scores_gemma":[0.0019238867,0.00025562057,0.00055248314,0.0006782946,0.00049103383,0.0005221253,0.000900068,0.0009536071,0.0002343558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095518204,0.000080510676,0.0003689151,0.0001335299,0.000056584893,0.00009298875,0.000073945455,0.9097999,0.0054723816,0.01994836,0.00071688276,0.06316054],"study_design_scores_gemma":[0.000007744957,0.000017937207,0.000033940683,0.0000031448776,0.000004086209,0.000011236438,0.0000021198566,0.9982843,0.00027705796,0.001030165,0.0003262794,0.0000019377246],"about_ca_topic_score_codex":0.0009949105,"about_ca_topic_score_gemma":0.0010449338,"teacher_disagreement_score":0.0014183782,"about_ca_system_score_codex":0.00039432803,"about_ca_system_score_gemma":0.00037778588,"threshold_uncertainty_score":0.0057219863},"labels":[],"label_agreement":null},{"id":"W2155437809","doi":"10.5539/cis.v7n4p30","title":"Research on the Optimization of Boiler Efficiency based on Artificial Bee Colony Algorithm","year":2014,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Guangdong Province","keywords":"Boiler (water heating); Computer science; Process engineering; Combustion; Algorithm; Waste management; Engineering; Chemistry","score_opus":0.043424435851101,"score_gpt":0.32452368198077197,"score_spread":0.28109924612967097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155437809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03636321,0.0051939217,0.94808984,0.00032233587,0.00012454229,0.00005080632,0.000029022514,0.00027177203,0.009554586],"genre_scores_gemma":[0.70719105,0.008243882,0.27724054,0.00022936772,0.0001356835,0.00015779992,0.00018209971,0.00014445803,0.00647516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958783,0.00009343778,0.000024190482,0.00007244873,0.00019142573,0.000030766616],"domain_scores_gemma":[0.9996959,0.00012106267,0.000026442705,0.000023433642,0.00012214,0.000011080823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005851391,0.00066989195,0.0008303405,0.0006061953,0.00030461274,0.0008156664,0.00069254433,0.00074067747,0.00079782703],"category_scores_gemma":[0.0011952376,0.00031121372,0.00058728794,0.0009841823,0.00032793553,0.0011556569,0.0003155936,0.00062377786,0.000167761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010555409,0.0001417852,0.002640456,0.00052916806,0.0002575894,0.00011342567,0.00012766443,0.6608539,0.023892378,0.02760797,0.002482952,0.2812471],"study_design_scores_gemma":[0.000020257814,0.00006233268,0.00075305725,0.000021508919,0.000044185992,0.00004535867,0.00001889122,0.9893028,0.0038353794,0.0025716843,0.0033095956,0.000014894728],"about_ca_topic_score_codex":0.0031759993,"about_ca_topic_score_gemma":0.0016357681,"teacher_disagreement_score":0.0031759993,"about_ca_system_score_codex":0.0003992631,"about_ca_system_score_gemma":0.00052381813,"threshold_uncertainty_score":0.0063150525},"labels":[],"label_agreement":null},{"id":"W2156166258","doi":"10.1007/978-3-540-24855-2_28","title":"The Shifting Balance Genetic Algorithm as More than Just Another Island Model GA","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Genetic algorithm; Balance (ability); Computer science; Population; Mechanism (biology); Extension (predicate logic); Diversity (politics); Algorithm; Machine learning; Biology; Sociology; Demography; Physics","score_opus":0.02227296970483767,"score_gpt":0.2779428918105858,"score_spread":0.2556699221057481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156166258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05921451,0.0013003404,0.8456698,0.001157394,0.00041966635,0.00006684574,0.000056167122,0.00059425295,0.091521114],"genre_scores_gemma":[0.6239295,0.0015125826,0.30788344,0.00058209075,0.00016611512,0.00015160521,0.000123192,0.0003614894,0.06529007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998969,0.000029356397,0.0000030037907,0.000020708236,0.000039218925,0.000010817808],"domain_scores_gemma":[0.9999286,0.00002276647,0.000005534199,0.000019705836,0.000013398492,0.000010100806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002072397,0.00033672046,0.0004431154,0.0002735281,0.00036866608,0.0011170305,0.0008376385,0.00083643297,0.004563923],"category_scores_gemma":[0.00056218775,0.00018936698,0.00034765387,0.000599593,0.00061522704,0.0012918396,0.00077767984,0.001002382,0.0006272006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091265494,0.00010268646,0.0004969845,0.00007253393,0.00006693473,0.0001542883,0.0002115125,0.43065244,0.012792178,0.3138297,0.007117467,0.23441209],"study_design_scores_gemma":[0.000030384494,0.00007983527,0.00019769635,0.000017864098,0.00003646602,0.00013826131,0.000051917657,0.8629413,0.0020450435,0.115815,0.018628832,0.000017281553],"about_ca_topic_score_codex":0.0021671888,"about_ca_topic_score_gemma":0.0018937142,"teacher_disagreement_score":0.004563923,"about_ca_system_score_codex":0.00042176462,"about_ca_system_score_gemma":0.0005334614,"threshold_uncertainty_score":0.015267849},"labels":[],"label_agreement":null},{"id":"W2157833270","doi":"10.1109/cec.2007.4424748","title":"Quasi-oppositional Differential Evolution","year":2007,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":447,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ode; Initialization; Differential evolution; Benchmark (surveying); Applied mathematics; Computer science; Test suite; Suite; Population; Algorithm; Mathematical optimization; Mathematics; Test case; Machine learning","score_opus":0.016240567198564735,"score_gpt":0.28615696652471695,"score_spread":0.2699163993261522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157833270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010635186,0.00019704303,0.980358,0.00015025408,0.000111175366,0.00004037703,0.00002608369,0.000073100935,0.008408712],"genre_scores_gemma":[0.60105085,0.00051735947,0.38646534,0.00041160727,0.00008508342,0.000238687,0.00010878175,0.000067360146,0.011054839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993555,0.00023864023,0.000029966908,0.0000838686,0.00025054664,0.000041473097],"domain_scores_gemma":[0.99924517,0.00041567744,0.00007716796,0.00008257182,0.00014259365,0.00003683056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009710958,0.00041029492,0.00062406424,0.00044824273,0.0002623016,0.00089996035,0.0009768151,0.0007416289,0.002060041],"category_scores_gemma":[0.0022930545,0.00021638349,0.0006406784,0.0003984958,0.00074498035,0.0008866865,0.0009783105,0.00080297026,0.00039253035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014960604,0.0001021122,0.0013399185,0.00025376634,0.000112707356,0.0003458288,0.00017671932,0.569536,0.020255351,0.2621356,0.0021237133,0.14346866],"study_design_scores_gemma":[0.000019075007,0.00008027072,0.00016251669,0.000011965922,0.00001226749,0.00013811131,0.000009379297,0.9707445,0.0015395769,0.021548228,0.0057187406,0.000015516318],"about_ca_topic_score_codex":0.00040717272,"about_ca_topic_score_gemma":0.00034900644,"teacher_disagreement_score":0.002060041,"about_ca_system_score_codex":0.00042468437,"about_ca_system_score_gemma":0.00035142954,"threshold_uncertainty_score":0.0068915486},"labels":[],"label_agreement":null},{"id":"W2159117717","doi":"10.1109/sis.2011.5952559","title":"A Particle Swarm Optimization approach to mixed attribute data-set classification","year":2011,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Particle swarm optimization; Centroid; Categorical variable; Set (abstract data type); Rounding; Computer science; Data set; Measure (data warehouse); Artificial intelligence; Pattern recognition (psychology); Fitness function; Multi-swarm optimization; Data mining; Mathematics; Algorithm; Machine learning; Genetic algorithm","score_opus":0.3497252586867309,"score_gpt":0.34054428968997214,"score_spread":0.009180968996758743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159117717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013073034,0.00013890429,0.9979936,0.00007745631,0.000024525712,0.000027831453,0.000018475004,0.00006520162,0.00034676417],"genre_scores_gemma":[0.054444913,0.0003215754,0.9433929,0.000083577645,0.00009405799,0.00026282767,0.00012844744,0.000041071344,0.001230615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917287,0.0003183323,0.000063596366,0.00013435981,0.00026948247,0.000041360185],"domain_scores_gemma":[0.99923646,0.00043404472,0.000060263923,0.00006940491,0.00016717358,0.000032733227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279255,0.0008608408,0.0013674066,0.0012027995,0.00048673118,0.0012928304,0.001351054,0.0012460111,0.0010664683],"category_scores_gemma":[0.0026437063,0.0004888717,0.00104448,0.0016376411,0.0006760735,0.0009015829,0.00097995,0.0015141936,0.0003951717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055456872,0.000102002065,0.00073531194,0.00017681414,0.00015605772,0.00009343647,0.00012594566,0.7901136,0.0035406712,0.028902424,0.002119442,0.17387882],"study_design_scores_gemma":[0.0000064215183,0.000017030825,0.000075921045,0.0000060143743,0.000006737168,0.000016170396,0.000005894616,0.9932579,0.00036592947,0.0052717174,0.00096434687,0.0000059772988],"about_ca_topic_score_codex":0.0030779673,"about_ca_topic_score_gemma":0.0018554996,"teacher_disagreement_score":0.0030779673,"about_ca_system_score_codex":0.0005352415,"about_ca_system_score_gemma":0.0008016519,"threshold_uncertainty_score":0.006765425},"labels":[],"label_agreement":null},{"id":"W2159490979","doi":"10.1109/ccece.2006.277284","title":"A Hybrid Evolutionary Approach for Combinatorial Problems in Dynamic Environments","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Heuristics; Benchmark (surveying); Premature convergence; Mathematical optimization; Computer science; Convergence (economics); Evolutionary algorithm; Population; Genetic algorithm; Local optimum; Optimization problem; Local search (optimization); Artificial intelligence; Mathematics","score_opus":0.011762356098054778,"score_gpt":0.2395804344214939,"score_spread":0.22781807832343912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159490979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012398908,0.00048757566,0.98065394,0.00015840124,0.00005677061,0.00004908291,0.000016142632,0.00017990821,0.0059992],"genre_scores_gemma":[0.27508765,0.0008375368,0.7121868,0.00025709564,0.000075222255,0.00035746896,0.00007728988,0.00008236823,0.011038472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996613,0.00010437286,0.000013546087,0.000046516143,0.00014841055,0.000025830992],"domain_scores_gemma":[0.9997166,0.00016431199,0.000021368702,0.000028937478,0.000050852865,0.000017880833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064693013,0.000592309,0.00064620795,0.0008782972,0.0003947423,0.0010782959,0.0014470387,0.0011568762,0.0020606706],"category_scores_gemma":[0.0012050575,0.00029125033,0.000769176,0.0010352322,0.00055591244,0.00086714525,0.00090933713,0.0007102489,0.0003468961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005512515,0.000088042194,0.0004595474,0.0001162596,0.0001287117,0.00020969381,0.00014236112,0.7702591,0.0077676345,0.06593733,0.001211877,0.15362431],"study_design_scores_gemma":[0.000021583362,0.00006381378,0.00012019915,0.000012211254,0.000020987174,0.000109483066,0.00001817238,0.9829146,0.00062006334,0.012040887,0.004046202,0.000011757748],"about_ca_topic_score_codex":0.0013953554,"about_ca_topic_score_gemma":0.0018632476,"teacher_disagreement_score":0.0020606706,"about_ca_system_score_codex":0.00039616728,"about_ca_system_score_gemma":0.0005194514,"threshold_uncertainty_score":0.0068936944},"labels":[],"label_agreement":null},{"id":"W2162419369","doi":"10.1109/ipdpsw.2010.5470706","title":"A parallel Particle swarm optimization algorithm for option pricing","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India; University of Manitoba","keywords":"Particle swarm optimization; Computer science; Mathematical optimization; Valuation of options; Parallel algorithm; Algorithm; Finance; Mathematics; Economics","score_opus":0.024213644342041197,"score_gpt":0.298744247885616,"score_spread":0.2745306035435748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162419369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071039954,0.00016367107,0.98921293,0.00014809832,0.00007213737,0.000050711824,0.000031845913,0.00028713082,0.002929384],"genre_scores_gemma":[0.2851954,0.0004139471,0.70735663,0.0001223155,0.00010117775,0.00034540606,0.00021282579,0.00011513865,0.006137221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996959,0.00008548168,0.000017923558,0.0000473911,0.00013066908,0.000022733424],"domain_scores_gemma":[0.9996525,0.00014087869,0.000029859122,0.00004344145,0.00011296831,0.000020323156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007265343,0.0005651184,0.00074446196,0.00048252053,0.00063678087,0.00071325205,0.0009132709,0.00095987495,0.00212703],"category_scores_gemma":[0.0017403539,0.00028286508,0.0005529665,0.0008021918,0.0003998002,0.0008525821,0.0005538295,0.00082747854,0.00050713454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007393216,0.000065352826,0.00078866014,0.00005689215,0.000047697424,0.00009474527,0.00005087024,0.8639435,0.0021735635,0.021816403,0.0029369744,0.10795135],"study_design_scores_gemma":[0.000014279198,0.000010276351,0.000050540504,0.0000015813764,0.0000035722921,0.000012463579,0.0000027131273,0.995996,0.00024698855,0.0026030366,0.0010559913,0.000002611858],"about_ca_topic_score_codex":0.004564532,"about_ca_topic_score_gemma":0.0033402818,"teacher_disagreement_score":0.004564532,"about_ca_system_score_codex":0.0005273072,"about_ca_system_score_gemma":0.0009985241,"threshold_uncertainty_score":0.00907594},"labels":[],"label_agreement":null},{"id":"W2165619664","doi":"10.1109/cec.2005.1554767","title":"BMPGA: A Bi-Objective Multi-population Genetic Algorithm for Multi-modal Function Optimization","year":2005,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fitness function; Modal; Mathematical optimization; Genetic algorithm; Population; Similarity (geometry); Fitness approximation; Computer science; Algorithm; Function (biology); Measure (data warehouse); Mathematics; Data mining; Artificial intelligence; Image (mathematics)","score_opus":0.040648948215666114,"score_gpt":0.31668574368854585,"score_spread":0.27603679547287974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165619664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079344,0.0003573324,0.987382,0.00016400203,0.000052932755,0.00006106408,0.000034744917,0.0005788534,0.0034346369],"genre_scores_gemma":[0.19818807,0.0005038019,0.7936909,0.0003033796,0.000060991904,0.00041048042,0.00020946175,0.00021779409,0.006415125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996828,0.00011815592,0.000010359066,0.00003829729,0.00012296892,0.000027368873],"domain_scores_gemma":[0.99976784,0.00012368745,0.000023086877,0.000020005156,0.00005006335,0.000015331261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069979683,0.0006945024,0.00075155805,0.00075032184,0.000417844,0.0006154396,0.0010553544,0.0011541964,0.0025570467],"category_scores_gemma":[0.0012206917,0.00025814964,0.0006731533,0.00054226175,0.000446132,0.0006712641,0.00079972413,0.0010470737,0.0006415374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007694881,0.00008246007,0.0007603336,0.0001526143,0.00012760733,0.00010885747,0.00014116036,0.68288964,0.008813996,0.021828819,0.004031081,0.28098652],"study_design_scores_gemma":[0.000031349315,0.000060514467,0.00024628674,0.00001848169,0.000021010474,0.00006607234,0.000018779485,0.9854634,0.0017380307,0.005265506,0.0070573445,0.000013405435],"about_ca_topic_score_codex":0.0023096337,"about_ca_topic_score_gemma":0.0026917795,"teacher_disagreement_score":0.0025570467,"about_ca_system_score_codex":0.0004670991,"about_ca_system_score_gemma":0.00078438746,"threshold_uncertainty_score":0.008554161},"labels":[],"label_agreement":null},{"id":"W2165687335","doi":"10.1109/tevc.2009.2017517","title":"Bi-Objective Multipopulation Genetic Algorithm for Multimodal Function Optimization","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; Local optimum; Mathematical optimization; Genetic algorithm; Population; Artificial intelligence; Algorithm; Mathematics; Machine learning","score_opus":0.01815384982913662,"score_gpt":0.2780752823084465,"score_spread":0.2599214324793099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165687335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00699664,0.0005145943,0.9889846,0.00013609498,0.000042695083,0.000051315175,0.000024290388,0.00021124989,0.0030385032],"genre_scores_gemma":[0.24269186,0.000682249,0.7495264,0.00024255256,0.000054494572,0.00053980225,0.00019382732,0.00013091206,0.005937896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995191,0.00023906225,0.00001756054,0.000048078702,0.0001423463,0.000033853637],"domain_scores_gemma":[0.9995658,0.00024158607,0.000039167036,0.000033028,0.00010040004,0.000019959685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013112114,0.0009597199,0.00076946965,0.0010393754,0.000515644,0.00075349683,0.0012692533,0.001358229,0.0019907344],"category_scores_gemma":[0.0020775285,0.0003077912,0.0007321153,0.0009799999,0.00056863716,0.0006661948,0.0008115685,0.0012202087,0.0005607543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035799792,0.00004779471,0.0005278365,0.00009170071,0.00010776458,0.00008455555,0.00010129958,0.86781764,0.0038995908,0.023565717,0.0015153362,0.10220498],"study_design_scores_gemma":[0.000013291409,0.00002793988,0.00010764087,0.00001093843,0.00001252756,0.000039806357,0.00000926355,0.9926184,0.0005878315,0.004151711,0.0024117264,0.000008896256],"about_ca_topic_score_codex":0.0021840378,"about_ca_topic_score_gemma":0.0020617838,"teacher_disagreement_score":0.0021840378,"about_ca_system_score_codex":0.000831533,"about_ca_system_score_gemma":0.00079872686,"threshold_uncertainty_score":0.006934464},"labels":[],"label_agreement":null},{"id":"W2166980895","doi":"10.1109/iccas.2008.4694190","title":"Data clustering using multi-objective hybrid evolutionary algorithm","year":2008,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Correlation clustering; Computer science; CURE data clustering algorithm; Centroid; k-medians clustering; Data mining; Cluster (spacecraft); Single-linkage clustering; Determining the number of clusters in a data set; Set (abstract data type); Population; Algorithm; Canopy clustering algorithm; Fuzzy clustering; Artificial intelligence","score_opus":0.14694405825942372,"score_gpt":0.34469260005736907,"score_spread":0.19774854179794535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166980895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024778228,0.00018701144,0.9731198,0.0000822358,0.000021057052,0.000036154655,0.0000117833015,0.00017795064,0.0015857347],"genre_scores_gemma":[0.38114256,0.00025574322,0.6154103,0.00010075315,0.000024265697,0.00022837127,0.00008748119,0.00006060032,0.0026899797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999445,0.00019642164,0.00003053581,0.000086403394,0.00020357722,0.000038084898],"domain_scores_gemma":[0.9996008,0.00019854914,0.000043021326,0.000041134394,0.00009932614,0.000017053302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010422703,0.0005832231,0.0007996762,0.0010484403,0.00040997294,0.0008098829,0.001091124,0.00094793335,0.000646527],"category_scores_gemma":[0.0017121711,0.00032492183,0.0008070132,0.00093869,0.0004392808,0.0007625162,0.0008437483,0.00048410028,0.00019167805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004775496,0.000055330092,0.00083672843,0.00006266737,0.00013049225,0.00007717951,0.00011079159,0.89382905,0.007833676,0.008650371,0.00035680772,0.088009164],"study_design_scores_gemma":[0.0000068188533,0.000017498567,0.000115251234,0.0000042806737,0.000008625701,0.000022935432,0.000008556038,0.99695814,0.0010455017,0.0012776222,0.0005298463,0.000005016608],"about_ca_topic_score_codex":0.0018342363,"about_ca_topic_score_gemma":0.0012651224,"teacher_disagreement_score":0.0018342363,"about_ca_system_score_codex":0.0005572041,"about_ca_system_score_gemma":0.0004432098,"threshold_uncertainty_score":0.005512178},"labels":[],"label_agreement":null},{"id":"W2169859438","doi":"10.1109/iciinfs.2009.5429852","title":"A new biologically inspired optimization algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maxima and minima; Algorithm; Computer science; Optimization algorithm; Function (biology); Hybrid algorithm (constraint satisfaction); Algorithm design; Field (mathematics); Mathematical optimization; Mathematics","score_opus":0.021761481337537303,"score_gpt":0.27960280231395934,"score_spread":0.25784132097642204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169859438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034527536,0.00054321665,0.9882406,0.00027491126,0.00018163041,0.000058676407,0.000041818683,0.0003560678,0.0068503963],"genre_scores_gemma":[0.07003385,0.0008109004,0.91684306,0.00047829258,0.00013539156,0.0003706207,0.00021224996,0.00014745415,0.010968203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995159,0.000097053366,0.000025746767,0.00009819254,0.00023049372,0.000032689248],"domain_scores_gemma":[0.9997036,0.00013047745,0.000030889783,0.0000358979,0.000078461555,0.000020692487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072516606,0.00062637415,0.0007982612,0.00082055817,0.0005595053,0.0011699353,0.0016008065,0.001352369,0.004435721],"category_scores_gemma":[0.0014552958,0.0003448453,0.0008474846,0.000764853,0.0006805952,0.0012910559,0.0012247897,0.0010804402,0.0011541168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007419067,0.00009712029,0.0008882006,0.00025727705,0.00014162665,0.00016652928,0.00011781787,0.51355994,0.012404497,0.09998892,0.008479462,0.36382443],"study_design_scores_gemma":[0.00004737053,0.00006758745,0.0001527338,0.000030082812,0.00002815098,0.00018004922,0.000015022764,0.9449244,0.001773158,0.021133278,0.03162806,0.000020210326],"about_ca_topic_score_codex":0.0010539362,"about_ca_topic_score_gemma":0.0010342987,"teacher_disagreement_score":0.004435721,"about_ca_system_score_codex":0.00060700264,"about_ca_system_score_gemma":0.00094867597,"threshold_uncertainty_score":0.014838934},"labels":[],"label_agreement":null},{"id":"W2170004572","doi":"10.1109/cec.2006.1688373","title":"A Genetic Binary Particle Swarm Optimization Model","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Multi-swarm optimization; Swarm behaviour; Computer science; Binary number; Population; Mathematical optimization; Genetic algorithm; Metaheuristic; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.021080757186811277,"score_gpt":0.2615487551243775,"score_spread":0.2404679979375662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170004572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013882719,0.001226749,0.95176613,0.0011922296,0.00027951982,0.00014261779,0.00033445275,0.0004348164,0.030740684],"genre_scores_gemma":[0.5067352,0.0038935537,0.44230023,0.00080034963,0.00026584923,0.0009237247,0.0007910676,0.00016364038,0.044126373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970776,0.000085292384,0.000013941005,0.00006078366,0.00010941382,0.00002276433],"domain_scores_gemma":[0.99983585,0.000063318206,0.000024790044,0.000018220588,0.000040700612,0.000017154867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034614487,0.0005179563,0.0005648989,0.0004322337,0.00041617718,0.001222886,0.0013174546,0.0015676058,0.0033783847],"category_scores_gemma":[0.001013111,0.00021234689,0.0004764362,0.0008926534,0.0005406443,0.001076147,0.0006319432,0.0007616001,0.0011080164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060918203,0.00006316032,0.00068668934,0.00015141883,0.00003874738,0.00030194412,0.00009241785,0.80701214,0.0032560572,0.14045241,0.0054564825,0.042427573],"study_design_scores_gemma":[0.000035874844,0.000045790945,0.00013917075,0.000013040664,0.000013522424,0.00011719732,0.0000116734,0.9645108,0.0004474876,0.021190634,0.013461095,0.000013732581],"about_ca_topic_score_codex":0.0049852966,"about_ca_topic_score_gemma":0.0018942388,"teacher_disagreement_score":0.0049852966,"about_ca_system_score_codex":0.00048605708,"about_ca_system_score_gemma":0.0009784456,"threshold_uncertainty_score":0.0113018155},"labels":[],"label_agreement":null},{"id":"W2170337736","doi":"10.1007/978-3-540-87700-4_1","title":"On the Behaviour of the (1+1)-ES for a Simple Constrained Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Constraint (computer-aided design); Computer science; Markov chain; Simple (philosophy); Mathematical optimization; Limit (mathematics); Applied mathematics; Algorithm; Mathematics; Geometry; Mathematical analysis","score_opus":0.03279748623791293,"score_gpt":0.27825102728650414,"score_spread":0.2454535410485912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170337736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21578427,0.009307976,0.6406187,0.0042236433,0.00071920117,0.00014700857,0.0003535017,0.0005944803,0.12825127],"genre_scores_gemma":[0.784474,0.0026654922,0.18129736,0.0008356213,0.0003625966,0.00015266259,0.00030676625,0.0004392108,0.029466368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928623,0.00039133072,0.000028541832,0.00008989411,0.00013010991,0.00007390617],"domain_scores_gemma":[0.9911187,0.008061246,0.00022440973,0.00022846511,0.00022404792,0.00014314581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026734676,0.0010699583,0.0011326672,0.0007283995,0.0008045833,0.0018008858,0.001665859,0.0027829953,0.008197302],"category_scores_gemma":[0.018008944,0.00047654656,0.0009865528,0.0012151414,0.0023339142,0.0026437568,0.0016496708,0.0024652444,0.0006481811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002473997,0.0000777548,0.00070456375,0.00043339204,0.000061704166,0.00016929781,0.00023419088,0.59820116,0.003075269,0.3478541,0.0060287444,0.04291242],"study_design_scores_gemma":[0.000029107683,0.00004261404,0.00022942154,0.000037068025,0.000012660083,0.00007052552,0.000030120435,0.8570267,0.00034945144,0.1412049,0.0009518173,0.000015657957],"about_ca_topic_score_codex":0.0030448851,"about_ca_topic_score_gemma":0.0022773945,"teacher_disagreement_score":0.008197302,"about_ca_system_score_codex":0.0009857025,"about_ca_system_score_gemma":0.0006527493,"threshold_uncertainty_score":0.027422726},"labels":[],"label_agreement":null},{"id":"W2172684101","doi":"10.2316/journal.201.2014.3.201-2583","title":"EFFICIENT, SWARM-BASED PATH FINDING IN UNKNOWN GRAPHS USING REINFORCEMENT LEARNING","year":2014,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reinforcement learning; Computer science; Swarm behaviour; Task (project management); Path (computing); Artificial intelligence; Soundness; Node (physics); Metaheuristic; Routing (electronic design automation); Machine learning; Ant colony optimization algorithms; Engineering; Computer network","score_opus":0.0283763983215228,"score_gpt":0.27598496384125815,"score_spread":0.24760856551973534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172684101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04340683,0.00013337577,0.95408875,0.00014938973,0.000021844126,0.00004743258,0.00002163477,0.0002860376,0.0018447347],"genre_scores_gemma":[0.84481937,0.00012382749,0.15312092,0.000062513966,0.00002180522,0.00012623896,0.00006164594,0.00004533373,0.0016182542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.00012499615,0.000017622498,0.00007522301,0.00007259026,0.000050939077],"domain_scores_gemma":[0.9984724,0.001029386,0.0001967578,0.00010141571,0.00012671851,0.00007323261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008845166,0.0005918965,0.00078833645,0.00045346835,0.00040212183,0.00062428374,0.0014263958,0.0008171043,0.0010332873],"category_scores_gemma":[0.0030783694,0.00035089056,0.00048145346,0.00037678189,0.0010365992,0.0009407811,0.0010209822,0.00076307554,0.00015234532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020441803,0.000021858626,0.0002751796,0.00001841773,0.0000140693965,0.000027710137,0.000030147332,0.9837853,0.0005830223,0.003265239,0.00016684551,0.011791783],"study_design_scores_gemma":[0.0000059435024,0.0000124594035,0.000027507438,0.0000016031386,0.000001839705,0.0000040064574,0.0000043922837,0.9981085,0.00010713205,0.0016401086,0.00008505643,0.0000013730403],"about_ca_topic_score_codex":0.005762907,"about_ca_topic_score_gemma":0.0046991794,"teacher_disagreement_score":0.005762907,"about_ca_system_score_codex":0.0009185444,"about_ca_system_score_gemma":0.0010452275,"threshold_uncertainty_score":0.011458695},"labels":[],"label_agreement":null},{"id":"W2219941422","doi":"10.1142/s0218126616500237","title":"Engineering a Memetic Algorithm from Discrete Cuckoo Search and Tabu Search for Cell Assignment of Hybrid Nanoscale CMOL Circuits","year":2015,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Tabu search; Cuckoo search; Metaheuristic; Simulated annealing; Memetic algorithm; Local search (optimization); Guided Local Search; Mathematical optimization; Particle swarm optimization; Algorithm; Heuristics; Computer science; Search algorithm; Combinatorial optimization; Mathematics","score_opus":0.030509443732595135,"score_gpt":0.2551045024162703,"score_spread":0.22459505868367519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219941422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09376513,0.0008482642,0.8884158,0.0004115896,0.00015591629,0.00019955124,0.000057592115,0.00057144044,0.015574563],"genre_scores_gemma":[0.6110979,0.00028137182,0.38486883,0.0001665287,0.000031058575,0.00030601988,0.00006392576,0.00007885358,0.0031054623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998325,0.000057766993,0.000008244353,0.000022745075,0.000056519246,0.000022213018],"domain_scores_gemma":[0.99974245,0.00013420658,0.000037108017,0.000029389648,0.0000447796,0.000012080136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043467048,0.00044343146,0.0004132586,0.00066419214,0.00044764258,0.00059648143,0.0008763762,0.00087198947,0.0016827639],"category_scores_gemma":[0.0011950441,0.00026711304,0.00040957605,0.0006703339,0.00049045373,0.0004822676,0.00047064084,0.00045334213,0.00018953497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011511251,0.00007868759,0.00082101277,0.00017151156,0.000068721936,0.000099846606,0.00008585787,0.85480434,0.015301895,0.02655024,0.0016744356,0.10022828],"study_design_scores_gemma":[0.0000142364925,0.00003236031,0.00008657005,0.000006368423,0.0000081948065,0.000026772459,0.000011048696,0.99363494,0.0026288782,0.0021141968,0.001431425,0.0000049505034],"about_ca_topic_score_codex":0.0020036108,"about_ca_topic_score_gemma":0.0023435547,"teacher_disagreement_score":0.0020036108,"about_ca_system_score_codex":0.00080267503,"about_ca_system_score_gemma":0.0006707023,"threshold_uncertainty_score":0.0058239102},"labels":[],"label_agreement":null},{"id":"W2223637016","doi":"10.5539/mas.v10n2p67","title":"A Hybrid Global Optimization Method Based on Genetic Algorithm and Shrinking Box","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Applied Science Private University","keywords":"Crossover; Penalty method; Benchmark (surveying); Mathematical optimization; Genetic algorithm; Algorithm; Computer science; Fitness function; Black box; Global optimization; Function (biology); Operator (biology); Meta-optimization; Mathematics; Artificial intelligence","score_opus":0.01452656236483714,"score_gpt":0.28222983393434126,"score_spread":0.26770327156950413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223637016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070319907,0.00014785051,0.9906782,0.000041329513,0.000027383943,0.000024741148,0.0000102324175,0.00019681253,0.001841433],"genre_scores_gemma":[0.19416834,0.00040706832,0.7988919,0.00013280944,0.000048282254,0.00032441597,0.00011038993,0.00016137164,0.0057554008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963367,0.00010424395,0.000014170477,0.00006499258,0.00016104036,0.000021959368],"domain_scores_gemma":[0.99979323,0.0001023936,0.000023422472,0.000019752048,0.00005069798,0.000010487793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006439019,0.0006698112,0.0009391521,0.00074980967,0.00035083506,0.00049308466,0.0009585771,0.00075504254,0.001745486],"category_scores_gemma":[0.0007978076,0.00027512352,0.0007917133,0.0007177455,0.0005086202,0.0007749618,0.0007017744,0.0006797833,0.00036097167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006049976,0.00005914858,0.0006577137,0.00014503617,0.00008980664,0.00008957108,0.00009991586,0.77626663,0.016232172,0.023602562,0.0011772156,0.18151972],"study_design_scores_gemma":[0.000013433526,0.00004032509,0.000119363234,0.000009239184,0.000011923871,0.00003559688,0.000006364864,0.99434483,0.0017945145,0.0019428428,0.001671843,0.000009771897],"about_ca_topic_score_codex":0.0020462673,"about_ca_topic_score_gemma":0.001451379,"teacher_disagreement_score":0.0020462673,"about_ca_system_score_codex":0.00032998784,"about_ca_system_score_gemma":0.0007321014,"threshold_uncertainty_score":0.0058392286},"labels":[],"label_agreement":null},{"id":"W2242413628","doi":"10.1109/ssci.2015.44","title":"The Effect of Probability Distributions on the Performance of Quantum Particle Swarm Optimization for Solving Dynamic Optimization Problems","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Mathematical optimization; Probability distribution; Quantum; RADIUS; Computer science; Dynamism; Mathematics; Statistical physics; Algorithm; Statistics; Physics; Quantum mechanics","score_opus":0.032795895382092266,"score_gpt":0.287970921871704,"score_spread":0.2551750264896117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242413628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6711402,0.0010198347,0.3229689,0.00043454327,0.000049824404,0.00007527114,0.000033742504,0.00041270722,0.0038649854],"genre_scores_gemma":[0.9814299,0.0001846291,0.018174091,0.000025947105,0.000008338572,0.000021326394,0.000017972023,0.000020683976,0.00011708106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978514,0.0011706916,0.00012153597,0.00020198328,0.00046959787,0.00018473227],"domain_scores_gemma":[0.9716116,0.024650354,0.0011209301,0.0009883555,0.0013684105,0.00026034322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058771973,0.0005178213,0.00063149916,0.00088527374,0.00073200546,0.0010345156,0.000715471,0.000753323,0.0004051829],"category_scores_gemma":[0.035305597,0.00042170595,0.00033993056,0.00085598713,0.0011783021,0.0019345445,0.0007571991,0.0006816799,0.00008642791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033576222,0.00009686085,0.0052039665,0.000071409675,0.000048191006,0.00008628434,0.0001259411,0.9469743,0.002619719,0.006631584,0.00018341349,0.03762265],"study_design_scores_gemma":[0.000018576495,0.00015366383,0.0015059575,0.0000072963658,0.000013287295,0.000042301464,0.000041324194,0.9939686,0.0024853975,0.0016038364,0.00014685236,0.000012977145],"about_ca_topic_score_codex":0.0036063248,"about_ca_topic_score_gemma":0.0021851677,"teacher_disagreement_score":0.0058771973,"about_ca_system_score_codex":0.00086516206,"about_ca_system_score_gemma":0.00089667743,"threshold_uncertainty_score":0.031081975},"labels":[],"label_agreement":null},{"id":"W2269275143","doi":"10.1007/s00500-016-2060-y","title":"Multilevel framework for large-scale global optimization","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Global optimization; Scale (ratio); Artificial intelligence; Algorithm; Mathematics","score_opus":0.027759238281192516,"score_gpt":0.32675317089325784,"score_spread":0.2989939326120653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269275143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002287095,0.00027169182,0.9927452,0.00021120772,0.00006254815,0.000021559918,0.00006303018,0.00022020453,0.004117462],"genre_scores_gemma":[0.22875272,0.00075595087,0.76203626,0.00028304706,0.00021962059,0.0004618768,0.00028531926,0.00048071996,0.0067243935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.00023600264,0.000022353584,0.000049130376,0.00018824996,0.000058226866],"domain_scores_gemma":[0.99900573,0.0004903627,0.00007466417,0.0001638901,0.00017288617,0.000092495175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010593866,0.0007244163,0.0015763621,0.0010209943,0.00083605683,0.0016219853,0.0026288184,0.0014941976,0.0094062155],"category_scores_gemma":[0.0031834263,0.00055571215,0.0015778082,0.0015128439,0.0007993132,0.0015857598,0.002601684,0.002548281,0.0015483357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050038703,0.00006897153,0.00031095362,0.00018273972,0.00012696482,0.00007250931,0.000058597987,0.6648673,0.0017285221,0.28117147,0.004944814,0.046417147],"study_design_scores_gemma":[0.0000070184747,0.000008584425,0.000029859497,0.000006460119,0.0000069941534,0.000005291809,0.000006357218,0.9676316,0.00010202287,0.031090958,0.00110133,0.0000034573482],"about_ca_topic_score_codex":0.003970276,"about_ca_topic_score_gemma":0.006325022,"teacher_disagreement_score":0.0094062155,"about_ca_system_score_codex":0.00084701914,"about_ca_system_score_gemma":0.0011930605,"threshold_uncertainty_score":0.0314669},"labels":[],"label_agreement":null},{"id":"W2270857366","doi":"10.5555/2772879.2772915","title":"Particle Field Optimization: A New Paradigm for Swarm Intelligence","year":2015,"lang":"en","type":"article","venue":"BIBSYS Brage (BIBSYS (Norway))","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Swarm intelligence; Computer science; Metaheuristic; Swarm behaviour; Perspective (graphical); Field (mathematics); Abstraction; Heuristic; Set (abstract data type); Swarm robotics; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics","score_opus":0.09194608042434352,"score_gpt":0.3293864798193408,"score_spread":0.2374403993949973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270857366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017324993,0.0059136082,0.9773447,0.0019136344,0.00041523893,0.00006392562,0.000072799834,0.00016812887,0.0123754935],"genre_scores_gemma":[0.19911128,0.023286205,0.75845116,0.0012852815,0.0024577763,0.0006009992,0.0002908444,0.00020093321,0.014315441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992298,0.00026962737,0.00004036228,0.00012640603,0.00029702715,0.00003670072],"domain_scores_gemma":[0.9995478,0.00023071837,0.000055718687,0.00006516014,0.00006894619,0.000031616964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011998855,0.0009500151,0.0013414345,0.00089293666,0.0006084368,0.0024142691,0.0014884532,0.0016830115,0.0019549383],"category_scores_gemma":[0.0019347961,0.00034206183,0.00090749824,0.001335357,0.0021923971,0.0027179695,0.0016715841,0.00263815,0.000744601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028300927,0.000026231603,0.00038106114,0.0002734963,0.000061132276,0.000094975905,0.00017973449,0.11467153,0.0014286891,0.8090329,0.0066467463,0.06717522],"study_design_scores_gemma":[0.000040300132,0.00008842475,0.0002443489,0.00011922648,0.000024487203,0.00015480298,0.00006404659,0.35721675,0.00070368755,0.56692594,0.07437906,0.000038893366],"about_ca_topic_score_codex":0.0018349051,"about_ca_topic_score_gemma":0.0010090013,"teacher_disagreement_score":0.0024142691,"about_ca_system_score_codex":0.0008865281,"about_ca_system_score_gemma":0.0011959854,"threshold_uncertainty_score":0.006539941},"labels":[],"label_agreement":null},{"id":"W2274259390","doi":"","title":"Center-based initialization for large-scale black-box problems","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Ontario Tech University","funders":"","keywords":"Initialization; Population; Computer science; Mathematical optimization; Benchmark (surveying); Latin hypercube sampling; Differential evolution; Particle swarm optimization; Algorithm; Monte Carlo method; Mathematics; Statistics","score_opus":0.13442718921251331,"score_gpt":0.38022876577346093,"score_spread":0.24580157656094762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274259390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014681081,0.00033584982,0.98150843,0.00009254165,0.00003343837,0.00008011234,0.000020331185,0.00036375393,0.002884472],"genre_scores_gemma":[0.48342276,0.00042100417,0.5135127,0.00011819819,0.000044553857,0.00033146614,0.00014814181,0.00017087728,0.001830481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992186,0.00039400146,0.000034095203,0.00009160297,0.00020307179,0.00005866063],"domain_scores_gemma":[0.9981504,0.0010615779,0.00021260126,0.00017935991,0.0003255342,0.00007043334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002238477,0.0007785981,0.000987909,0.0007988118,0.0007584369,0.0007702814,0.0011221825,0.0009105582,0.0024770717],"category_scores_gemma":[0.0050545637,0.00035413302,0.0004996722,0.00075222226,0.00083998765,0.0010598919,0.0010423061,0.00088573736,0.00050189707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016249987,0.000073914125,0.0010213724,0.000108548455,0.000039318184,0.000110335575,0.00010415087,0.8988178,0.0036238143,0.02955879,0.0018339165,0.064545475],"study_design_scores_gemma":[0.000022194134,0.000035920206,0.00011969373,0.000010111229,0.000008153569,0.000034909084,0.000012961785,0.9911243,0.0020851938,0.004912046,0.0016261432,0.00000843083],"about_ca_topic_score_codex":0.0016658605,"about_ca_topic_score_gemma":0.0011993165,"teacher_disagreement_score":0.0024770717,"about_ca_system_score_codex":0.00070256396,"about_ca_system_score_gemma":0.0009593081,"threshold_uncertainty_score":0.0118383765},"labels":[],"label_agreement":null},{"id":"W2283584817","doi":"","title":"Use of line search in the Luus-Jaakola optimization procedure","year":2007,"lang":"en","type":"article","venue":"Computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Line search; Convergence (economics); Line (geometry); Point (geometry); Mathematical optimization; Set (abstract data type); Mathematics; Local search (optimization); Simple (philosophy); Rate of convergence; Algorithm; Variable (mathematics); Computer science; Telecommunications","score_opus":0.11854189777934346,"score_gpt":0.36838683067648526,"score_spread":0.2498449328971418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283584817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015945503,0.00021524931,0.9763476,0.0000889261,0.000050406183,0.00021257446,0.00004818855,0.0013587729,0.0057327934],"genre_scores_gemma":[0.12382687,0.00013230726,0.8719978,0.00009111306,0.000023714623,0.00071034173,0.00011243903,0.0003690892,0.002736386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986155,0.0007931648,0.0000861813,0.00011948886,0.0002948414,0.000090738715],"domain_scores_gemma":[0.99769044,0.001310229,0.00020883358,0.00020671242,0.0005255894,0.000058279285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002341168,0.0011290987,0.0013492698,0.0010638483,0.0009903635,0.0011243038,0.001401471,0.0014678081,0.0050833016],"category_scores_gemma":[0.0062996135,0.0005807481,0.000617484,0.0011619775,0.00093494967,0.00096599146,0.0010852556,0.0017455826,0.0022004438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005487837,0.00049923453,0.0021139958,0.00069239014,0.00017165182,0.00031723926,0.0005233455,0.57738435,0.021580104,0.043892626,0.0045515923,0.34772468],"study_design_scores_gemma":[0.00007435304,0.0002154125,0.00032994183,0.000054952165,0.000033362165,0.000094094816,0.000037931077,0.97477776,0.013390641,0.0035373175,0.0074083908,0.000045856796],"about_ca_topic_score_codex":0.0023905288,"about_ca_topic_score_gemma":0.0027015347,"teacher_disagreement_score":0.0050833016,"about_ca_system_score_codex":0.000591608,"about_ca_system_score_gemma":0.0013345045,"threshold_uncertainty_score":0.017005324},"labels":[],"label_agreement":null},{"id":"W2293252417","doi":"10.1109/cjece.2015.2496338","title":"Improving Tabu Search Performance by Means of Automatic Parameter Tuning","year":2016,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Heuristic; Mathematical optimization; A priori and a posteriori; Convergence (economics); Set (abstract data type); Computer science; Value (mathematics); Algorithm; Reliability (semiconductor); Genetic algorithm; Mathematics; Machine learning","score_opus":0.00812752825112632,"score_gpt":0.19180998557235354,"score_spread":0.18368245732122723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293252417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1764243,0.0020911093,0.79676646,0.00048358476,0.0002258074,0.00042216195,0.0002468313,0.012879272,0.010460439],"genre_scores_gemma":[0.64035374,0.0004749512,0.35636282,0.00021929298,0.000048218608,0.0004330505,0.00036011596,0.001270267,0.0004774938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964414,0.0019155387,0.00029760724,0.00038352332,0.0007431711,0.00021877442],"domain_scores_gemma":[0.9862099,0.0082816165,0.00096105586,0.0029308791,0.0014858128,0.00013069455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056373863,0.0013327345,0.0014846326,0.0020409732,0.00064448296,0.0021983574,0.0022559694,0.0013320156,0.0020902576],"category_scores_gemma":[0.036641832,0.0005169853,0.00064253114,0.0022567573,0.0006855397,0.002083752,0.0009860538,0.0015124846,0.001055564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057137245,0.0005751063,0.005352253,0.0005316733,0.00024622303,0.000108405715,0.00048549802,0.48307267,0.021041827,0.006188668,0.0047542225,0.477072],"study_design_scores_gemma":[0.0001412347,0.00021435117,0.0011629773,0.00007949577,0.00007583362,0.00010246774,0.00010419966,0.97780365,0.012488938,0.004687576,0.0030915341,0.000047664424],"about_ca_topic_score_codex":0.002167299,"about_ca_topic_score_gemma":0.001693351,"teacher_disagreement_score":0.0056373863,"about_ca_system_score_codex":0.00064662716,"about_ca_system_score_gemma":0.001283275,"threshold_uncertainty_score":0.029813766},"labels":[],"label_agreement":null},{"id":"W2293644487","doi":"10.1109/icmla.2015.102","title":"Population Migration Using Dominance in Multi-population Cultural Algorithms","year":2015,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Dominance (genetics); Population; Computer science; Benchmark (surveying); Evolutionary algorithm; Artificial intelligence; Algorithm; Mathematical optimization; Machine learning; Mathematics; Demography; Biology; Geography","score_opus":0.15176759125991227,"score_gpt":0.3840975725180516,"score_spread":0.23232998125813933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293644487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034717232,0.00052760757,0.9549706,0.00025723243,0.00010188474,0.000109346816,0.000018584287,0.00021564247,0.00908187],"genre_scores_gemma":[0.52916354,0.00065146806,0.46169475,0.00038866358,0.00011545311,0.0003269526,0.00007428418,0.00011875401,0.0074662166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988349,0.0005095376,0.0000635865,0.00014081098,0.00036454241,0.000086529864],"domain_scores_gemma":[0.99829584,0.0007876646,0.00016241068,0.00026558936,0.00038612226,0.00010232861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017099362,0.00071620196,0.0006316126,0.0008566774,0.0010731141,0.0015477373,0.0014198174,0.0010878448,0.001633089],"category_scores_gemma":[0.005631261,0.00027225842,0.0006798497,0.0005850103,0.000889201,0.002007863,0.001781495,0.0009556481,0.0004229421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011786261,0.00024190919,0.0038203793,0.0002485257,0.00020371682,0.00044000507,0.0010780726,0.43601072,0.025538752,0.17048642,0.002551266,0.3592623],"study_design_scores_gemma":[0.000056307057,0.00019805177,0.00044723987,0.000048097263,0.000060391376,0.00038564857,0.00012912633,0.9375696,0.008664528,0.03759567,0.014804302,0.000040970077],"about_ca_topic_score_codex":0.0013981169,"about_ca_topic_score_gemma":0.0013374825,"teacher_disagreement_score":0.0017099362,"about_ca_system_score_codex":0.0007006627,"about_ca_system_score_gemma":0.00083086966,"threshold_uncertainty_score":0.0090430975},"labels":[],"label_agreement":null},{"id":"W2293808320","doi":"10.1609/socs.v2i1.18213","title":"The Compressed Differential Heuristic","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Uncompressed video; Heuristic; Differential (mechanical device); Computer science; Compression (physics); State (computer science); Algorithm; State space; Space (punctuation); Theoretical computer science; Mathematics; Artificial intelligence; Statistics; Engineering","score_opus":0.015766394318122462,"score_gpt":0.26618553507636256,"score_spread":0.2504191407582401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293808320","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09364024,0.0019987423,0.86664295,0.000944117,0.00046081972,0.0004565158,0.0005793313,0.0017961188,0.033481188],"genre_scores_gemma":[0.6855158,0.0008059282,0.30152094,0.0005989138,0.000134573,0.0004608187,0.0007815888,0.00019662346,0.009984683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940085,0.00014981633,0.000030182955,0.00008014367,0.00025333633,0.00008580311],"domain_scores_gemma":[0.99892104,0.000624954,0.00007735717,0.00017988223,0.00014136972,0.000055392124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097767,0.0006497428,0.00082567247,0.0010074999,0.00042724394,0.0008276425,0.0016330299,0.00090748956,0.0070761773],"category_scores_gemma":[0.003282562,0.0003043149,0.00041096745,0.0010458521,0.0008494338,0.001445243,0.0015994253,0.0009010526,0.0005230889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005123405,0.00023589688,0.00083245145,0.00039301938,0.00006590381,0.00032249233,0.00017610387,0.55721444,0.006963141,0.053059123,0.0077306055,0.3724944],"study_design_scores_gemma":[0.00012522143,0.00019462171,0.0002463388,0.00005372312,0.000029924951,0.0001640956,0.000046182908,0.9654195,0.004415466,0.021766763,0.007514894,0.000023305376],"about_ca_topic_score_codex":0.0027262648,"about_ca_topic_score_gemma":0.0023942979,"teacher_disagreement_score":0.0070761773,"about_ca_system_score_codex":0.0009981324,"about_ca_system_score_gemma":0.0015555723,"threshold_uncertainty_score":0.023672163},"labels":[],"label_agreement":null},{"id":"W2296772665","doi":"10.1609/socs.v1i1.18153","title":"Single-Frontier Bidirectional Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Frontier; Computer science; Node (physics); Work (physics); Search algorithm; Algorithm; Engineering; Geography","score_opus":0.01840111607900786,"score_gpt":0.2670439970903512,"score_spread":0.24864288101134335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296772665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012710249,0.0005535017,0.97296077,0.00018721212,0.00012371369,0.0001064947,0.00015281788,0.0011380005,0.012067133],"genre_scores_gemma":[0.21237521,0.00051403383,0.77767926,0.00020956603,0.000034434215,0.0002962623,0.00041294564,0.00030239968,0.008175943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926823,0.00017668828,0.000035979927,0.000113163456,0.00030382755,0.00010207742],"domain_scores_gemma":[0.99923146,0.00024507832,0.00006409905,0.0001602292,0.00022751954,0.000071698516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084818096,0.00080879807,0.0010960089,0.0008415294,0.00067962526,0.0014924699,0.0016230706,0.0011035716,0.008057051],"category_scores_gemma":[0.0022463535,0.0004143078,0.0007503422,0.0011158325,0.00057930686,0.0019153138,0.0022012542,0.0012034321,0.0020527733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039416857,0.00028098797,0.0017722358,0.0005448383,0.00011144733,0.00016666397,0.00023209925,0.2582295,0.015863618,0.11939411,0.007996688,0.5950137],"study_design_scores_gemma":[0.000099262536,0.00020227687,0.00023865042,0.00007923089,0.00004263772,0.00020750826,0.00008082911,0.91477835,0.0075945617,0.04513697,0.03149594,0.000043732012],"about_ca_topic_score_codex":0.0024157073,"about_ca_topic_score_gemma":0.0033013944,"teacher_disagreement_score":0.008057051,"about_ca_system_score_codex":0.0005932534,"about_ca_system_score_gemma":0.001628162,"threshold_uncertainty_score":0.026953518},"labels":[],"label_agreement":null},{"id":"W2304131403","doi":"10.1007/s00500-016-2116-z","title":"Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Science Foundation of Ministry of Education of China; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Firefly algorithm; Benchmark (surveying); Swarm intelligence; Convergence (economics); Premature convergence; Computer science; Mathematical optimization; Set (abstract data type); Mechanism (biology); Optimization problem; Algorithm; Particle swarm optimization; Mathematics","score_opus":0.013661660258551011,"score_gpt":0.261132166591145,"score_spread":0.24747050633259401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304131403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030165978,0.000640736,0.95907754,0.00019595296,0.00017401528,0.0001150692,0.000028169326,0.00055432494,0.009048309],"genre_scores_gemma":[0.5292224,0.00045444627,0.45748073,0.0002016718,0.00012534573,0.00046186103,0.00012453322,0.00013453573,0.011794423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993882,0.00017999882,0.000028366481,0.000097502576,0.0002536106,0.000052289608],"domain_scores_gemma":[0.9996145,0.000118216936,0.000052150128,0.000060584698,0.00012767593,0.000026891787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010349088,0.0007182135,0.0013202054,0.0010118965,0.0008431576,0.00089285977,0.0025146944,0.0015362793,0.0019609139],"category_scores_gemma":[0.0019331825,0.00041494815,0.0007641901,0.0011229214,0.00055508484,0.0012300055,0.0010193718,0.00074744085,0.0004543073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040184925,0.00032846778,0.0012318959,0.00022732001,0.00025933873,0.00021694356,0.00023978543,0.6648703,0.016464883,0.05482553,0.0054318225,0.25550187],"study_design_scores_gemma":[0.00007763569,0.00008733286,0.00017057623,0.0000071125846,0.000038249484,0.00008890693,0.00001089765,0.9927731,0.001815211,0.002904774,0.0020065124,0.000019612984],"about_ca_topic_score_codex":0.0017982972,"about_ca_topic_score_gemma":0.0014202306,"teacher_disagreement_score":0.0025146944,"about_ca_system_score_codex":0.000638323,"about_ca_system_score_gemma":0.0007868242,"threshold_uncertainty_score":0.006559849},"labels":[],"label_agreement":null},{"id":"W2312556230","doi":"10.1007/s12597-016-0256-7","title":"Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems","year":2016,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Mathematical optimization; Particle swarm optimization; Benchmark (surveying); Multi-swarm optimization; Arithmetic function; Computer science; Premature convergence; Simplex algorithm; Algorithm; Metaheuristic; Convergence (economics); Population; Mathematics; Linear programming; Artificial intelligence","score_opus":0.03600050729763214,"score_gpt":0.31658430017333494,"score_spread":0.2805837928757028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312556230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008002489,0.0006596037,0.9841888,0.00008204936,0.00009802001,0.000051483054,0.000026162399,0.00024213383,0.0066492604],"genre_scores_gemma":[0.22114478,0.0008723392,0.7698767,0.00008082847,0.000099832294,0.00034451915,0.00012594629,0.00020830602,0.007246796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959487,0.00014683185,0.000017451679,0.000035271518,0.0001828839,0.000022770073],"domain_scores_gemma":[0.99968255,0.00016192342,0.000026143838,0.0000457956,0.000071674534,0.000012009025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008369037,0.00074604567,0.0008790277,0.00086307555,0.00047291146,0.00084578723,0.00076211087,0.00094098557,0.0023486027],"category_scores_gemma":[0.0020777201,0.00034695596,0.00054278143,0.0016253794,0.00061412767,0.00072679704,0.0008351806,0.0015455907,0.0005487616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012843715,0.00009208827,0.00032947928,0.000249304,0.000106949235,0.000071248985,0.00011441262,0.71843016,0.005543558,0.064430125,0.003514382,0.20698988],"study_design_scores_gemma":[0.000018400877,0.000030056128,0.00007999703,0.000010730485,0.000014259971,0.000015503207,0.0000072071994,0.98905236,0.0010885973,0.007797528,0.0018794069,0.0000059141485],"about_ca_topic_score_codex":0.0019800118,"about_ca_topic_score_gemma":0.0016874623,"teacher_disagreement_score":0.0023486027,"about_ca_system_score_codex":0.0004332774,"about_ca_system_score_gemma":0.00069469365,"threshold_uncertainty_score":0.007856846},"labels":[],"label_agreement":null},{"id":"W2327567064","doi":"10.1109/tevc.2015.2451701","title":"Simple Probabilistic Population-Based Optimization","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universität Leipzig; European Social Fund; Ryerson University","keywords":"Metaheuristic; Mathematical optimization; Quadratic assignment problem; Scheme (mathematics); Probabilistic logic; Population; Ant colony optimization algorithms; Optimization problem; Computer science; Simple (philosophy); Combinatorial optimization; Extremal optimization; Multi-swarm optimization; Meta-optimization; Mathematics; Artificial intelligence","score_opus":0.037638567515969966,"score_gpt":0.2932689703359937,"score_spread":0.25563040282002375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327567064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004719627,0.00014772343,0.9909242,0.0000897576,0.000029663799,0.00009584984,0.00004442633,0.000157048,0.0037917793],"genre_scores_gemma":[0.302487,0.0006701988,0.6876798,0.00025373767,0.00008332185,0.0009865443,0.0003379978,0.00014484684,0.007356519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985623,0.00045597588,0.00007968478,0.00022503865,0.0005817708,0.000095402385],"domain_scores_gemma":[0.99898726,0.00039172807,0.00015594279,0.00018482373,0.00023336473,0.000046868397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001781964,0.0007789009,0.0011538217,0.0009633362,0.0005492326,0.0012869169,0.0025082438,0.0010670633,0.002971236],"category_scores_gemma":[0.0045924815,0.00043053986,0.0010227545,0.0013250711,0.0011347223,0.0015780389,0.0020014436,0.0011450289,0.0007714409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031659754,0.000034837092,0.0008971697,0.00013145663,0.00006332371,0.00006484666,0.00010464387,0.75329846,0.003239976,0.17739148,0.0017760732,0.06296598],"study_design_scores_gemma":[0.000013085599,0.000047245452,0.00020567533,0.000011180822,0.000014883961,0.00006827745,0.0000115565945,0.9622699,0.00060273113,0.032430902,0.00430929,0.00001528858],"about_ca_topic_score_codex":0.0015625294,"about_ca_topic_score_gemma":0.0013229487,"teacher_disagreement_score":0.002971236,"about_ca_system_score_codex":0.00083999045,"about_ca_system_score_gemma":0.0012275366,"threshold_uncertainty_score":0.00993979},"labels":[],"label_agreement":null},{"id":"W2327951994","doi":"10.1007/s13675-016-0075-x","title":"Variable neighborhood search: basics and variants","year":2016,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Variable neighborhood search; Heuristics; Metaheuristic; Implementation; Mathematical optimization; Variable (mathematics); Computer science; Local search (optimization); Mathematics; Perturbation (astronomy); Theoretical computer science; Algorithm","score_opus":0.02770844702848207,"score_gpt":0.2690038019831024,"score_spread":0.24129535495462034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327951994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008806678,0.0042509767,0.97074205,0.00022978126,0.00012094207,0.00007396257,0.00008863234,0.00024553877,0.015441475],"genre_scores_gemma":[0.31240678,0.00565527,0.66684514,0.00017033031,0.00025993507,0.00026071415,0.00030092595,0.00024413528,0.013856747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924123,0.0002285103,0.00004478849,0.0001382765,0.00028688522,0.000060372593],"domain_scores_gemma":[0.9994579,0.00022401921,0.000052586613,0.00012733263,0.00010713263,0.00003110399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010184612,0.00042585758,0.00070006633,0.0006804042,0.0004094847,0.0011663918,0.0014470718,0.00078757363,0.0022343092],"category_scores_gemma":[0.00267111,0.00037142812,0.00055697554,0.0019329468,0.0010918513,0.001635803,0.0013037483,0.0010882319,0.00060889305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011892636,0.0000548834,0.0009504282,0.00023303433,0.000052480547,0.000067731184,0.00021731712,0.24016432,0.003321876,0.48266184,0.003545562,0.26861158],"study_design_scores_gemma":[0.00004107835,0.00012566139,0.0005076218,0.00008811383,0.000033775825,0.00031092478,0.00006234938,0.72615737,0.0026157522,0.21809398,0.051926553,0.000036807505],"about_ca_topic_score_codex":0.0026407135,"about_ca_topic_score_gemma":0.002365265,"teacher_disagreement_score":0.0026407135,"about_ca_system_score_codex":0.0006973622,"about_ca_system_score_gemma":0.00062201323,"threshold_uncertainty_score":0.007474482},"labels":[],"label_agreement":null},{"id":"W2330450097","doi":"10.1142/9789812777171_0047","title":"AN ALGORITHM TO COMPUTE THE MINIMAL TELESCOPERS FOR RATIONAL FUNCTIONS (DIFFERENTIAL – INTEGRAL CASE)","year":2002,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Differential (mechanical device); Computer science; Algorithm; Mathematics; Applied mathematics; Physics","score_opus":0.04591984734920518,"score_gpt":0.3045564444783878,"score_spread":0.25863659712918263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330450097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01134746,0.00006460281,0.985158,0.00007971769,0.00003231642,0.000064024425,0.000053108593,0.0006099459,0.0025907315],"genre_scores_gemma":[0.118541405,0.00005308399,0.879097,0.000040652103,0.000017727978,0.00017109039,0.00017279721,0.00016138669,0.0017448481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997814,0.000038661114,0.0000127791,0.000055902157,0.0000645881,0.000046678568],"domain_scores_gemma":[0.999345,0.00034090527,0.00005093796,0.00006860102,0.00015198797,0.00004244927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079824525,0.0009802969,0.0009927716,0.0014390292,0.0007655465,0.0011438826,0.0015885502,0.0017893644,0.0077258595],"category_scores_gemma":[0.002888581,0.00065868173,0.001081827,0.0009964089,0.0007799155,0.001119799,0.0015762736,0.0011716511,0.0010913439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028647453,0.00014655413,0.0011282256,0.00024161758,0.00007993065,0.00008509807,0.00018191568,0.637072,0.008421054,0.059249155,0.0043808473,0.28872707],"study_design_scores_gemma":[0.00006831684,0.000047308517,0.0001522981,0.000016132148,0.000018892562,0.000027515294,0.00003671091,0.9775621,0.0016294697,0.018961348,0.0014676377,0.000012248512],"about_ca_topic_score_codex":0.004111407,"about_ca_topic_score_gemma":0.0050625536,"teacher_disagreement_score":0.0077258595,"about_ca_system_score_codex":0.0012352137,"about_ca_system_score_gemma":0.0017997555,"threshold_uncertainty_score":0.025845587},"labels":[],"label_agreement":null},{"id":"W2336667609","doi":"10.1186/s40064-016-2064-1","title":"A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems","year":2016,"lang":"en","type":"article","venue":"SpringerPlus","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cuckoo search; Mathematical optimization; Algorithm; Computer science; Metaheuristic; Cuckoo; Integer programming; Local search (optimization); Minimax; Integer (computer science); Mathematics; Particle swarm optimization","score_opus":0.024177316203590905,"score_gpt":0.30438415835012406,"score_spread":0.28020684214653313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336667609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007369478,0.0011752914,0.98453647,0.00014042864,0.00008343611,0.00014668707,0.000045369656,0.00050557667,0.005997194],"genre_scores_gemma":[0.16068524,0.0011046166,0.828059,0.00020410663,0.000079749014,0.00072273775,0.00025099656,0.00020420185,0.008689315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914396,0.00022590751,0.000045845543,0.00011121906,0.00042050038,0.000052589552],"domain_scores_gemma":[0.9995807,0.00017918117,0.000036795802,0.00002810501,0.00015202846,0.000023176965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039553,0.0014993829,0.0012088271,0.0014788384,0.0010469601,0.0008300324,0.0015161796,0.0016918121,0.0023589197],"category_scores_gemma":[0.0018072805,0.00049280014,0.0010203191,0.001640747,0.0006576361,0.0010588604,0.00071811635,0.00087230356,0.0005733931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011238402,0.0000792765,0.0010057638,0.0004589535,0.00022398047,0.00017562952,0.00018639799,0.74375594,0.010423921,0.02758647,0.00622493,0.20976642],"study_design_scores_gemma":[0.000046811117,0.00005067705,0.00022851164,0.000026663372,0.000020691425,0.00007663465,0.00001808989,0.98274624,0.0023365116,0.004869265,0.009550197,0.000029700892],"about_ca_topic_score_codex":0.013180835,"about_ca_topic_score_gemma":0.012706248,"teacher_disagreement_score":0.013180835,"about_ca_system_score_codex":0.0009606983,"about_ca_system_score_gemma":0.0020451741,"threshold_uncertainty_score":0.026208222},"labels":[],"label_agreement":null},{"id":"W2336871472","doi":"10.5267/j.dsl.2016.2.004","title":"Improved symbiotic organisms search algorithm for solving unconstrained function optimization","year":2016,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Function optimization; Algorithm; Mathematical optimization; Optimization algorithm; Search algorithm; Global optimization; Parametric statistics; Local search (optimization); Computer science; Function (biology); Optimization problem; Mathematics; Genetic algorithm","score_opus":0.021710752453510593,"score_gpt":0.28740480125346857,"score_spread":0.26569404879995795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336871472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010038894,0.00038323182,0.9862514,0.00006334476,0.000042371885,0.000036258636,0.000020714708,0.0002479925,0.0029157328],"genre_scores_gemma":[0.18174501,0.00042258104,0.8137009,0.00009639134,0.000037773465,0.00032600656,0.00013803379,0.0000985164,0.0034347686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996505,0.000095301,0.000017179778,0.000047339578,0.00015767613,0.000032049622],"domain_scores_gemma":[0.999785,0.00008648704,0.0000187935,0.000017064775,0.00007829871,0.000014286654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006669899,0.0007884718,0.0007298524,0.0006279758,0.00037474418,0.00041615756,0.00085199985,0.0007575333,0.0025381094],"category_scores_gemma":[0.0012950635,0.00020527918,0.00058828737,0.0007293501,0.00036183436,0.0005506809,0.00087453396,0.00077507,0.00046982418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119301716,0.00007338108,0.0014508747,0.00018116704,0.00010739955,0.00016108842,0.00014012553,0.6279899,0.010152737,0.035857137,0.0027948427,0.32097203],"study_design_scores_gemma":[0.000032213426,0.000052474283,0.00015447264,0.0000075804796,0.000009975666,0.00004437502,0.0000084604435,0.992396,0.0011738129,0.0034120053,0.0027018404,0.0000068741474],"about_ca_topic_score_codex":0.0021362314,"about_ca_topic_score_gemma":0.0018309322,"teacher_disagreement_score":0.0025381094,"about_ca_system_score_codex":0.00035488958,"about_ca_system_score_gemma":0.0010912415,"threshold_uncertainty_score":0.00849086},"labels":[],"label_agreement":null},{"id":"W2345571104","doi":"10.1007/978-3-540-34690-6_10","title":"Cooperative Particle Swarm Optimizers: A Powerful and Promising Approach","year":2006,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Particle swarm optimization; Computer science; Swarm behaviour; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","score_opus":0.11493309945976436,"score_gpt":0.3668129265798155,"score_spread":0.25187982712005114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345571104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029006589,0.003065391,0.97376007,0.0004904402,0.0003501728,0.000049072452,0.000022902745,0.00023892216,0.019122457],"genre_scores_gemma":[0.26819944,0.0075973906,0.68324083,0.0007651981,0.0010104347,0.00047666035,0.00017389753,0.00032956016,0.038206607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951863,0.00016644056,0.00001601059,0.00006181601,0.00020852005,0.00002867806],"domain_scores_gemma":[0.99956745,0.00022250004,0.000034242494,0.00007219607,0.00007871197,0.000024922898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092506176,0.0012928094,0.0013172363,0.00061395444,0.0005160305,0.001720476,0.0018703991,0.0020191956,0.0028182247],"category_scores_gemma":[0.00200499,0.00049141987,0.000573175,0.0011944382,0.0009474601,0.0017180821,0.0018053211,0.0015422786,0.0010246655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011064941,0.00013176899,0.00050914846,0.000347939,0.00019645208,0.00017598536,0.00020334624,0.36732817,0.003321308,0.263292,0.018264238,0.346119],"study_design_scores_gemma":[0.00005578013,0.00009503318,0.00015098891,0.000039537368,0.000046369874,0.000094253795,0.000043538206,0.85882366,0.0013460009,0.10750425,0.03177679,0.000023730148],"about_ca_topic_score_codex":0.0011141404,"about_ca_topic_score_gemma":0.001134532,"teacher_disagreement_score":0.0028182247,"about_ca_system_score_codex":0.00036086552,"about_ca_system_score_gemma":0.0006575051,"threshold_uncertainty_score":0.009427905},"labels":[],"label_agreement":null},{"id":"W2359483975","doi":"","title":"The Performance Analysis of Particle Swarm Optimization for Solving Continuous Optimization Problem","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multi-swarm optimization; Particle swarm optimization; Benchmark (surveying); Mathematical optimization; Computer science; Metaheuristic; Meta-optimization; Derivative-free optimization; Imperialist competitive algorithm; Swarm behaviour; Optimization problem; Population; Function (biology); Algorithm; Mathematics","score_opus":0.01764427329822725,"score_gpt":0.2615115871013189,"score_spread":0.24386731380309162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2359483975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008584578,0.00536431,0.9717459,0.00048974826,0.00022163271,0.00004630034,0.00004996945,0.00029925854,0.013198354],"genre_scores_gemma":[0.7285467,0.010498391,0.2511692,0.0002705885,0.0007275345,0.00028736665,0.00050877116,0.00031064276,0.0076809116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861574,0.0003936331,0.000063514075,0.00012176683,0.0007418027,0.000063558],"domain_scores_gemma":[0.9984119,0.0010270188,0.00009300435,0.000090491056,0.00035138696,0.000026281663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022102376,0.0009316942,0.0008572842,0.0007399857,0.0004345174,0.0011508057,0.000696671,0.0011682287,0.0017400186],"category_scores_gemma":[0.0060771853,0.00023873373,0.0006706173,0.0012614466,0.00066877657,0.0012474563,0.0005402314,0.001189349,0.00054314494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008928754,0.00004829507,0.0012841886,0.00042492876,0.00012020819,0.00012280633,0.00008055479,0.79559696,0.0035534783,0.05894667,0.003667755,0.13606487],"study_design_scores_gemma":[0.0000066416483,0.000048774844,0.00048713878,0.00002350137,0.000015538673,0.000050074326,0.000008882813,0.98808134,0.0011618378,0.006702204,0.003402785,0.000011231347],"about_ca_topic_score_codex":0.0034387659,"about_ca_topic_score_gemma":0.00082601793,"teacher_disagreement_score":0.0034387659,"about_ca_system_score_codex":0.00073582696,"about_ca_system_score_gemma":0.00099401,"threshold_uncertainty_score":0.011689007},"labels":[],"label_agreement":null},{"id":"W2361773057","doi":"","title":"A Hybrid Global Optimization Algorithm for Non-differential Function Based on Elitist Maintained Genetic and Alopex Algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Algorithm; Meta-optimization; Genetic algorithm; Population-based incremental learning; Global optimization; Convergence (economics); Computer science; Mathematical optimization; Differential evolution; Cultural algorithm; Optimization algorithm; Hybrid algorithm (constraint satisfaction); Feature (linguistics); Function (biology); Optimization problem; Mathematics","score_opus":0.01633046758345071,"score_gpt":0.25120888118034834,"score_spread":0.23487841359689762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361773057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008612361,0.00019942722,0.98911566,0.00005867439,0.000031376145,0.000036707625,0.000012946684,0.0002506519,0.0016821026],"genre_scores_gemma":[0.3035983,0.00040800203,0.68623745,0.00018267994,0.000055929362,0.00042081834,0.00013232756,0.00012345288,0.008840999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951184,0.000120811,0.00002230097,0.00008788584,0.0002193092,0.00003784424],"domain_scores_gemma":[0.9997019,0.00012743649,0.00004037388,0.0000327093,0.00008206775,0.000015361935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008426435,0.0006478859,0.00072213134,0.0007512132,0.00046567337,0.00080037105,0.0012322876,0.00096349505,0.0015248213],"category_scores_gemma":[0.001173403,0.00022383385,0.0006467036,0.00078910124,0.0006382357,0.0012331776,0.0009665112,0.00089119474,0.0003314426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011302915,0.00012259209,0.0011257528,0.00014490272,0.00013646939,0.00016898003,0.00023128134,0.6025061,0.015601125,0.053554963,0.0027895009,0.3235053],"study_design_scores_gemma":[0.00004761041,0.00011145684,0.0002891166,0.0000125541865,0.00002337383,0.0001082015,0.000023775632,0.981217,0.00345516,0.00958573,0.00511001,0.00001599774],"about_ca_topic_score_codex":0.0016518278,"about_ca_topic_score_gemma":0.0012041756,"teacher_disagreement_score":0.0016518278,"about_ca_system_score_codex":0.0005781336,"about_ca_system_score_gemma":0.00072286977,"threshold_uncertainty_score":0.0051010847},"labels":[],"label_agreement":null},{"id":"W2366166569","doi":"","title":"Projective Genetic Algorithm","year":2000,"lang":"en","type":"article","venue":"Huadong Li-Gong Daxue xuebao","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Projective test; Genetic algorithm; Computer science; Genetic representation; Meta-optimization; Algorithm; Mathematical optimization; Mathematics; Pure mathematics","score_opus":0.012398324068519073,"score_gpt":0.2545149076565105,"score_spread":0.24211658358799146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366166569","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006218445,0.00061548135,0.97697634,0.00019637309,0.00010976772,0.000080697246,0.00008027792,0.0008893234,0.014833356],"genre_scores_gemma":[0.35395026,0.0018608627,0.6227201,0.00048447537,0.00015234097,0.00052871363,0.0005144437,0.0002850744,0.019503696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994357,0.00017483291,0.00002359139,0.000113617614,0.0001933497,0.000058896167],"domain_scores_gemma":[0.9996499,0.00012030888,0.000038752325,0.00005701767,0.00011510605,0.000018947481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006818677,0.00075356424,0.00084039354,0.000859409,0.0007044765,0.0012035198,0.0013039836,0.0010226108,0.0057574697],"category_scores_gemma":[0.0020767616,0.00032563414,0.0008089018,0.0012845632,0.00069019967,0.0010639769,0.0011152071,0.00093732314,0.001517416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008899624,0.00007120405,0.0013940332,0.00025328912,0.00017671575,0.00021242039,0.00016119948,0.4470632,0.007638381,0.18336761,0.010319519,0.34925348],"study_design_scores_gemma":[0.0000491729,0.00013097927,0.0004866124,0.000033234122,0.00007174841,0.00028387763,0.000030114055,0.9346556,0.003207891,0.03330476,0.027713956,0.000032095064],"about_ca_topic_score_codex":0.0029177219,"about_ca_topic_score_gemma":0.0017064065,"teacher_disagreement_score":0.0057574697,"about_ca_system_score_codex":0.00066312705,"about_ca_system_score_gemma":0.0011134774,"threshold_uncertainty_score":0.019260705},"labels":[],"label_agreement":null},{"id":"W2371524223","doi":"","title":"Order Preserving of Gene Section for Solving Traveling Salesman Problems Using Genetic Algorithms","year":2000,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Travelling salesman problem; Section (typography); 2-opt; Genetic algorithm; Computer science; Algorithm; Bottleneck traveling salesman problem; Mathematical optimization; Mathematics","score_opus":0.04986389685302601,"score_gpt":0.298596668648474,"score_spread":0.248732771795448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371524223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034557994,0.00049602316,0.9599695,0.00011150558,0.000029800782,0.000057649188,0.000024272797,0.00020919142,0.0045440723],"genre_scores_gemma":[0.45344737,0.0012016929,0.54205143,0.000066496286,0.0000423006,0.00013089181,0.00013118563,0.00009681706,0.0028318644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998481,0.000044366883,0.00000690415,0.000021551294,0.000059323946,0.000019673851],"domain_scores_gemma":[0.99977857,0.00012698064,0.000024907107,0.000023502254,0.000035876088,0.000010127849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004346686,0.00040842802,0.00040070523,0.00064317783,0.00044945895,0.0006123529,0.00050693325,0.00048054566,0.0010841117],"category_scores_gemma":[0.0011196209,0.00015841432,0.00055334717,0.0010694717,0.000623967,0.00061498635,0.0002611856,0.00069532386,0.0001563937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006929538,0.00008186886,0.00080844056,0.00011757767,0.00003185258,0.000105114676,0.00015194365,0.77231944,0.016906366,0.08560109,0.0009183645,0.12288859],"study_design_scores_gemma":[0.000016460115,0.00007055592,0.00022947205,0.000015554473,0.000030623713,0.00007040797,0.000035260826,0.96164936,0.0052332627,0.030230027,0.0024084821,0.000010485911],"about_ca_topic_score_codex":0.003924128,"about_ca_topic_score_gemma":0.003475721,"teacher_disagreement_score":0.003924128,"about_ca_system_score_codex":0.00070466986,"about_ca_system_score_gemma":0.0013097229,"threshold_uncertainty_score":0.0078026056},"labels":[],"label_agreement":null},{"id":"W2373190274","doi":"","title":"A New Particle Swarm Optimization Based on Three Evolution Model","year":2011,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Computer science; Mathematical optimization; Multi-swarm optimization; Process (computing); Population; Meta-optimization; Algorithm; Mathematics","score_opus":0.039366016759225846,"score_gpt":0.2581069767003025,"score_spread":0.21874095994107667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2373190274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005199462,0.00057048764,0.98826396,0.00019404832,0.00018699837,0.000061611434,0.00004828536,0.0003009859,0.0051742224],"genre_scores_gemma":[0.33775023,0.0027421177,0.6334869,0.00033430863,0.0002359449,0.0008246596,0.0005321504,0.00019931656,0.023894329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968827,0.00006656482,0.000018578668,0.00005145531,0.00014794481,0.000027293485],"domain_scores_gemma":[0.9998679,0.000036944795,0.000015955144,0.000012274837,0.00005056685,0.000016316664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003871213,0.0005576975,0.0010019186,0.0004993349,0.00045417712,0.0011138412,0.0014045334,0.0012407671,0.002080825],"category_scores_gemma":[0.00075540633,0.00034419974,0.0009782945,0.00086103566,0.00038571525,0.0014958227,0.00079299347,0.0011547866,0.00062030467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012576736,0.000111648034,0.0014624576,0.0003606092,0.00016189326,0.00034620462,0.00019806826,0.71705353,0.01255051,0.06729971,0.0084728785,0.19185664],"study_design_scores_gemma":[0.00003565729,0.00003871293,0.00018943846,0.000010653663,0.000015478623,0.00007778996,0.00000823245,0.9886883,0.0006560071,0.0037040836,0.0065586483,0.000017087681],"about_ca_topic_score_codex":0.0051389285,"about_ca_topic_score_gemma":0.002733064,"teacher_disagreement_score":0.0051389285,"about_ca_system_score_codex":0.00048336966,"about_ca_system_score_gemma":0.0009520707,"threshold_uncertainty_score":0.010218024},"labels":[],"label_agreement":null},{"id":"W2394358333","doi":"","title":"A Technique of Implementing Genetic Algorithm by Bit-Operation","year":2002,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Crossover; Computer science; Decimal; Binary number; Genetic algorithm; Integer (computer science); Algorithm; Encoding (memory); Binary code; Mutation; Integer programming; Transformation (genetics); Code (set theory); Arithmetic; Parallel computing; Set (abstract data type); Mathematics; Programming language; Artificial intelligence","score_opus":0.018962249031497697,"score_gpt":0.26734365600290005,"score_spread":0.24838140697140235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394358333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050919624,0.0005037876,0.985188,0.00017760613,0.00011873177,0.00008283037,0.000033977696,0.0009800564,0.007823096],"genre_scores_gemma":[0.16104493,0.0014667057,0.8296414,0.00027730927,0.00006308521,0.000227509,0.00013342712,0.00018522862,0.00696041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995796,0.00012066052,0.000023240373,0.000084881845,0.00015947997,0.00003218751],"domain_scores_gemma":[0.9998493,0.00005003259,0.000017681168,0.000039024177,0.000036336463,0.0000076251563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037077963,0.0006134944,0.00064100575,0.00065441773,0.00060408696,0.0009159815,0.0010013011,0.0008598059,0.003070815],"category_scores_gemma":[0.00074814307,0.00019964649,0.0005396218,0.0012440082,0.0007376391,0.0010453864,0.00063648325,0.0010000613,0.0012629487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015398016,0.00014690576,0.0013218911,0.0005282561,0.0001908741,0.00046099626,0.00037482879,0.1255589,0.058328476,0.2515767,0.0060210377,0.5553372],"study_design_scores_gemma":[0.00013039049,0.00043485488,0.0009691374,0.00017564424,0.00022302939,0.0017239332,0.0001107543,0.6723755,0.06099646,0.12494809,0.137787,0.00012513701],"about_ca_topic_score_codex":0.0015332425,"about_ca_topic_score_gemma":0.0010724186,"teacher_disagreement_score":0.003070815,"about_ca_system_score_codex":0.00034410344,"about_ca_system_score_gemma":0.0007080339,"threshold_uncertainty_score":0.0102728605},"labels":[],"label_agreement":null},{"id":"W2395810761","doi":"","title":"Effect of parallelism on the efficiency of binary tree search.","year":2011,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Parallelism (grammar); Tree (set theory); Binary tree; Binary number; Binary search tree; Parallel computing; Arithmetic; Computer science; Algorithm; Combinatorics","score_opus":0.029611683932986674,"score_gpt":0.27663260161618075,"score_spread":0.24702091768319406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395810761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85446393,0.0035920362,0.0850826,0.0015258081,0.00028244202,0.000080235375,0.00040410424,0.001004503,0.05356437],"genre_scores_gemma":[0.97826433,0.00039259897,0.019197669,0.000058380123,0.000044055905,0.000028337787,0.00011573583,0.00012327866,0.001775613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986261,0.00069693226,0.000050865892,0.00012659718,0.0002764496,0.00022312222],"domain_scores_gemma":[0.98280233,0.014549642,0.000507261,0.0011605064,0.0007043145,0.0002759206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026686888,0.00032399662,0.00048561895,0.0005665133,0.00053545943,0.000930672,0.0007320442,0.0007465542,0.0034718981],"category_scores_gemma":[0.018806675,0.00024335462,0.0002965022,0.0010003543,0.0006380633,0.0019327216,0.00055489835,0.00075640617,0.0007238411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004943001,0.0009084018,0.009637057,0.00039584044,0.00018763253,0.00037271105,0.00029398245,0.66079897,0.03150275,0.0488825,0.010963303,0.23111394],"study_design_scores_gemma":[0.00026913988,0.0006242517,0.0019930042,0.00003484512,0.000109464134,0.00019434789,0.00010484802,0.9418706,0.018143,0.0335058,0.0031281067,0.000022532251],"about_ca_topic_score_codex":0.0013166637,"about_ca_topic_score_gemma":0.002075498,"teacher_disagreement_score":0.0034718981,"about_ca_system_score_codex":0.0004963987,"about_ca_system_score_gemma":0.0011008946,"threshold_uncertainty_score":0.014113545},"labels":[],"label_agreement":null},{"id":"W2399372960","doi":"10.1007/s11227-016-1739-2","title":"Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm","year":2016,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Travelling salesman problem; Computer science; Metaheuristic; Mathematical optimization; Firefly algorithm; Search algorithm; Beam search; Algorithm; Combinatorial optimization; Guided Local Search; Local search (optimization); Best-first search; Optimization problem; Benchmark (surveying); Mathematics; Particle swarm optimization","score_opus":0.08004275425044745,"score_gpt":0.2965008824944893,"score_spread":0.21645812824404187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399372960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0748899,0.00076058315,0.9120309,0.0003330116,0.00012357486,0.00011050864,0.000075564945,0.00034582082,0.011330122],"genre_scores_gemma":[0.34122077,0.0005563565,0.65293866,0.00012828504,0.00005566104,0.00030478524,0.0002443503,0.00010472288,0.004446452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969935,0.00010339463,0.00001655062,0.000038793183,0.000104049854,0.00003791435],"domain_scores_gemma":[0.99941623,0.00039695037,0.00004275193,0.000045435125,0.00008077294,0.000017864828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000734618,0.0006084841,0.0009330142,0.0011019008,0.00055893924,0.0007440648,0.00089363294,0.0014290287,0.0039691674],"category_scores_gemma":[0.0041273697,0.00045094403,0.0007769565,0.0012486945,0.0006657512,0.0012492166,0.0008330933,0.0008649931,0.00048933394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016265878,0.00012257887,0.00087013916,0.00015970094,0.0000763192,0.0001216572,0.00010107344,0.8730178,0.0020436,0.026909705,0.0019060823,0.09450876],"study_design_scores_gemma":[0.000026047324,0.000039474697,0.00008877751,0.000011919945,0.000009977987,0.000036185967,0.000024503104,0.9899099,0.00035064833,0.0087342905,0.00076513266,0.0000032160701],"about_ca_topic_score_codex":0.0017690101,"about_ca_topic_score_gemma":0.0018006285,"teacher_disagreement_score":0.0039691674,"about_ca_system_score_codex":0.00050079083,"about_ca_system_score_gemma":0.0007653357,"threshold_uncertainty_score":0.013278186},"labels":[],"label_agreement":null},{"id":"W2399994135","doi":"10.1080/03155986.2006.11732744","title":"Gender-Specific Genetic Algorithms<sup>*</sup>","year":2006,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Computer science","score_opus":0.06962427366799345,"score_gpt":0.326702144233142,"score_spread":0.2570778705651485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399994135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037332647,0.00031042538,0.95256656,0.00037387852,0.00017254014,0.0001250564,0.00009923428,0.000343942,0.008675747],"genre_scores_gemma":[0.45152622,0.0003569718,0.54112726,0.00060039805,0.00010339837,0.00021668765,0.00035949153,0.00012680044,0.0055827643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988317,0.00063848053,0.000051085135,0.00016042069,0.00022171903,0.00009658736],"domain_scores_gemma":[0.998137,0.00090935535,0.00022076271,0.00024367135,0.000422403,0.00006682997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022397884,0.0007903158,0.00056521373,0.0006515793,0.0004538229,0.000728904,0.0011939574,0.0009096443,0.0030205173],"category_scores_gemma":[0.005780948,0.00020975986,0.0008385518,0.00076174346,0.0006417334,0.00088130677,0.0008195837,0.0006559845,0.0006036035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012707023,0.00014856724,0.0068823453,0.00011159414,0.00015606909,0.00020115836,0.00022798794,0.63220924,0.0049302652,0.07212354,0.004466061,0.27841607],"study_design_scores_gemma":[0.000043765864,0.00018634077,0.0015171482,0.00005164439,0.000082194776,0.00026436517,0.000092291644,0.9346653,0.0037253336,0.048952818,0.010389987,0.000028848677],"about_ca_topic_score_codex":0.0017708222,"about_ca_topic_score_gemma":0.002666839,"teacher_disagreement_score":0.0030205173,"about_ca_system_score_codex":0.00068380864,"about_ca_system_score_gemma":0.0010426715,"threshold_uncertainty_score":0.011845291},"labels":[],"label_agreement":null},{"id":"W2401722941","doi":"10.1609/aaai.v25i1.7815","title":"Euclidean Heuristic Optimization","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Heuristic; Mathematical optimization; Optimization problem; Consistency (knowledge bases); Computer science; Reduction (mathematics); Euclidean geometry; Dimensionality reduction; Mathematics; Artificial intelligence","score_opus":0.1529758557561552,"score_gpt":0.30765553793865236,"score_spread":0.15467968218249717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401722941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008573409,0.00091151963,0.97369814,0.00043600987,0.00008640828,0.000094482464,0.00017211173,0.00026439724,0.015763508],"genre_scores_gemma":[0.3279565,0.0011516246,0.65715766,0.00056686864,0.000118193515,0.00045801688,0.0007107421,0.0002898854,0.011590459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822766,0.0007862937,0.00010726057,0.00031180348,0.00041317948,0.0001538824],"domain_scores_gemma":[0.9969183,0.0019312745,0.0002454172,0.000456767,0.00033734023,0.00011078965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024465094,0.00129504,0.0012863753,0.0014567391,0.0005726241,0.0020031417,0.001860534,0.002038237,0.0058438377],"category_scores_gemma":[0.010456379,0.0005681618,0.0009995302,0.0016681381,0.0019020919,0.0019993645,0.0018034497,0.001807702,0.0012421323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008245164,0.000066644396,0.00045638916,0.0002826759,0.00008474052,0.00007689509,0.00009461316,0.6748982,0.0009801713,0.23211895,0.005085743,0.08577254],"study_design_scores_gemma":[0.00003234026,0.00007064112,0.00013235136,0.000060729435,0.000024370327,0.000048005302,0.000035003526,0.8698867,0.00082712894,0.12310225,0.0057632136,0.000017224582],"about_ca_topic_score_codex":0.001875431,"about_ca_topic_score_gemma":0.0018944056,"teacher_disagreement_score":0.0058438377,"about_ca_system_score_codex":0.0021386386,"about_ca_system_score_gemma":0.0016279372,"threshold_uncertainty_score":0.019549608},"labels":[],"label_agreement":null},{"id":"W2402720751","doi":"10.2166/hydro.2013.118","title":"Evaluation and application of Fuzzy Differential Evolution approach for benchmark optimization and reservoir operation problems","year":2013,"lang":"en","type":"article","venue":"Journal of Hydroinformatics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Initialization; Benchmark (surveying); Differential evolution; Mathematical optimization; Fuzzy logic; Algorithm; Computer science; Interval (graph theory); Convergence (economics); Mathematics; Artificial intelligence","score_opus":0.018680762783150073,"score_gpt":0.27227927390834344,"score_spread":0.2535985111251934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402720751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26299328,0.0028570225,0.7161058,0.0005329749,0.0000917142,0.00017903009,0.000107530024,0.00022689009,0.016905818],"genre_scores_gemma":[0.855981,0.0006442411,0.14217496,0.000040140752,0.000013317191,0.00009151466,0.00008663914,0.000024858393,0.0009432898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992021,0.00035285225,0.00004230701,0.000052461466,0.0003050803,0.000045244666],"domain_scores_gemma":[0.9980179,0.0014736669,0.0000674187,0.000076689576,0.00031835973,0.00004594554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035476107,0.000682022,0.00093634706,0.0016942911,0.00037581837,0.0010925432,0.00074233563,0.0010403066,0.00071612827],"category_scores_gemma":[0.0057480363,0.00021517067,0.00046167802,0.0011862044,0.00049272337,0.0008842693,0.0007060866,0.0006158225,0.000053865264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006753801,0.00007390407,0.0012310946,0.00010170972,0.00003934827,0.000041800264,0.00003696689,0.94533867,0.0010977366,0.007410942,0.00021729176,0.044343006],"study_design_scores_gemma":[0.0000053168046,0.000035497615,0.00020682534,0.00000662944,0.000004814817,0.0000090410595,0.000009023101,0.99818027,0.0005050736,0.00077016285,0.00026382445,0.0000034766754],"about_ca_topic_score_codex":0.0050217262,"about_ca_topic_score_gemma":0.003207495,"teacher_disagreement_score":0.0050217262,"about_ca_system_score_codex":0.001243426,"about_ca_system_score_gemma":0.0007742506,"threshold_uncertainty_score":0.018761754},"labels":[],"label_agreement":null},{"id":"W2406981943","doi":"10.4230/dagsemproc.09171.1","title":"09171 Abstracts Collection – Adaptive, Output Sensitive, Online and Parameterized Algorithms","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; Computer science; Informatics; Research center; Center (category theory); Work (physics); Algorithm; Theoretical computer science; Engineering; Electrical engineering","score_opus":0.03175318269460307,"score_gpt":0.28721453522514434,"score_spread":0.25546135253054125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406981943","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005599629,0.16064855,0.078330554,0.025101192,0.1340953,0.0015021017,0.046008456,0.0041441466,0.5445701],"genre_scores_gemma":[0.03395327,0.09598564,0.043587156,0.004448394,0.11750166,0.002508619,0.091686726,0.0061200806,0.6042084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967608,0.00046881763,0.00028673885,0.0007162315,0.0015550023,0.00021246001],"domain_scores_gemma":[0.99554414,0.0011060439,0.00025892624,0.0006044147,0.001428518,0.0010579722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042638956,0.0038252561,0.0031230531,0.0054654423,0.0015604969,0.0066564158,0.003221997,0.0017016352,0.25017977],"category_scores_gemma":[0.006887374,0.00076729717,0.002338482,0.006676631,0.001154963,0.0035699033,0.0037040613,0.004504991,0.10826722],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015574208,0.000106869,0.00014715357,0.0009566041,0.000069067166,0.000056864108,0.000036268193,0.00080157956,0.000933437,0.010400515,0.90043914,0.08589673],"study_design_scores_gemma":[0.00009247032,0.00014122433,0.0018635899,0.00042901642,0.00008041719,0.00018506442,0.000047114147,0.001850931,0.0010887347,0.014545828,0.9796367,0.000038927097],"about_ca_topic_score_codex":0.002160446,"about_ca_topic_score_gemma":0.002931492,"teacher_disagreement_score":0.25017977,"about_ca_system_score_codex":0.005019497,"about_ca_system_score_gemma":0.0032136724,"threshold_uncertainty_score":0.8369347},"labels":[],"label_agreement":null},{"id":"W2409271889","doi":"10.1162/evco_a_00187","title":"Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems","year":2016,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Computer science; Combinatorial optimization; Local search (optimization); Memetic algorithm; Evolutionary algorithm; Population; Optimization problem; Context (archaeology); Greedy randomized adaptive search procedure; Greedy algorithm; Mathematics","score_opus":0.016413554861362017,"score_gpt":0.2668385528779645,"score_spread":0.25042499801660245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409271889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046668198,0.00039594472,0.94886297,0.0001370694,0.000027997712,0.000046443998,0.000011431806,0.00013666216,0.0037132832],"genre_scores_gemma":[0.68807733,0.00038724113,0.30757234,0.00013218434,0.000031228472,0.0002863357,0.000052549123,0.00007740075,0.0033833755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977654,0.00009699733,0.000009339309,0.00002527874,0.00007486944,0.000016999706],"domain_scores_gemma":[0.99959606,0.00025535142,0.00004676191,0.000032954402,0.000050881612,0.000018001881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006866382,0.0005328056,0.000523938,0.00059128215,0.0002544146,0.00052606524,0.0009957004,0.0005891353,0.000663096],"category_scores_gemma":[0.0015800355,0.00021942887,0.0004280658,0.00050672964,0.0005928077,0.0005814263,0.00064754207,0.00045966572,0.0001311478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025068226,0.000039975177,0.0005594632,0.000034617085,0.00005627794,0.00006217832,0.00008436194,0.92713326,0.002692772,0.025622059,0.00047707563,0.043212906],"study_design_scores_gemma":[0.000006160805,0.000022423723,0.00005586726,0.0000033498397,0.0000046175132,0.000014804888,0.0000061571686,0.9963141,0.0002920718,0.002896294,0.0003815379,0.0000026383216],"about_ca_topic_score_codex":0.0015860496,"about_ca_topic_score_gemma":0.0014148025,"teacher_disagreement_score":0.0015860496,"about_ca_system_score_codex":0.00048048858,"about_ca_system_score_gemma":0.0004208648,"threshold_uncertainty_score":0.0036313534},"labels":[],"label_agreement":null},{"id":"W2409344786","doi":"","title":"MO-LOST: Adaptive ant trail untangling in multi-objective multi-colony robot foraging (Extended Abstract)","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Foraging; Robot; Computer science; Context (archaeology); Ant colony; Population; Set (abstract data type); Artificial intelligence; Ant colony optimization algorithms; Interference (communication); Geography; Ecology; Biology; Computer network","score_opus":0.08171710937599094,"score_gpt":0.33434531644790777,"score_spread":0.2526282070719168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409344786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05446999,0.00045958842,0.940859,0.00017017039,0.000105964435,0.000077633624,0.000040705534,0.00084685296,0.0029700724],"genre_scores_gemma":[0.6102319,0.00020518767,0.3849646,0.00016590855,0.000045559114,0.00016885973,0.00006454214,0.00019211475,0.003961383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990547,0.00002985144,0.000004347584,0.000013078606,0.000033499047,0.000013757742],"domain_scores_gemma":[0.9997967,0.00008869396,0.000027892509,0.000028207818,0.000035728688,0.00002281926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040639215,0.00037179937,0.00043789216,0.00024469433,0.0002872142,0.00039365378,0.00087572716,0.0004477525,0.0019500491],"category_scores_gemma":[0.0010286067,0.0001623474,0.00029426615,0.00030368278,0.00044021397,0.00041600148,0.0007442406,0.0006355392,0.00028022833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018315644,0.00009799685,0.001453973,0.00017205496,0.00006823872,0.00016178536,0.000102183585,0.8073451,0.011881641,0.010822593,0.0022827266,0.16542849],"study_design_scores_gemma":[0.000022084676,0.000056443943,0.00016384266,0.0000063203397,0.000005991464,0.000027437607,0.000006904187,0.9955642,0.0013031042,0.0018562682,0.0009821148,0.000005352439],"about_ca_topic_score_codex":0.0016454348,"about_ca_topic_score_gemma":0.0018758981,"teacher_disagreement_score":0.0019500491,"about_ca_system_score_codex":0.00027398692,"about_ca_system_score_gemma":0.0003783361,"threshold_uncertainty_score":0.006523609},"labels":[],"label_agreement":null},{"id":"W242727464","doi":"10.1016/j.jpdc.2012.01.003","title":"Parallel Ant Colony Optimization on Graphics Processing Units","year":2012,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Agence Nationale de la Recherche","keywords":"Ant colony optimization algorithms; Computer science; Graphics; Graphics processing unit; ANT; Computer graphics (images); Parallel metaheuristic; Parallel computing; Metaheuristic; Artificial intelligence; Operating system; Meta-optimization","score_opus":0.041069458023383416,"score_gpt":0.2981955138576753,"score_spread":0.2571260558342919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W242727464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20030348,0.0006137494,0.77171737,0.0006906966,0.0003805777,0.00015090538,0.00008732067,0.001401532,0.02465444],"genre_scores_gemma":[0.77544284,0.0001831307,0.21679558,0.00011584945,0.00004426572,0.00016327857,0.00007682753,0.0001909805,0.006987209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997124,0.000117140655,0.00001003812,0.00003146586,0.000095186646,0.00003368372],"domain_scores_gemma":[0.9995073,0.00021848759,0.000034810568,0.000062213454,0.00014500778,0.000032233038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003024222,0.00043633732,0.0006427238,0.00035507913,0.0005921376,0.00067812874,0.0011652635,0.0008415194,0.003108924],"category_scores_gemma":[0.0015321056,0.00035916505,0.00044879704,0.0007878701,0.0004919012,0.0005427245,0.00070490025,0.0007884244,0.00042107163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020404233,0.00003441809,0.00035529202,0.000039710187,0.000021362528,0.00007513302,0.000036425557,0.95849127,0.0047456785,0.0055761165,0.0016595938,0.028761055],"study_design_scores_gemma":[0.000010868284,0.000013319757,0.00004700966,8.8083686e-7,0.000002411242,0.0000035469168,0.0000036258252,0.99821544,0.00039268995,0.0010811968,0.00022731767,0.00000178162],"about_ca_topic_score_codex":0.008327765,"about_ca_topic_score_gemma":0.0068706847,"teacher_disagreement_score":0.008327765,"about_ca_system_score_codex":0.00071887125,"about_ca_system_score_gemma":0.00091426214,"threshold_uncertainty_score":0.016558588},"labels":[],"label_agreement":null},{"id":"W2473387183","doi":"10.1504/ijcat.2016.077799","title":"Cellular implementation of the great salmon run algorithm for designing a black-box identifier applied to engine coldstart modelling","year":2016,"lang":"en","type":"article","venue":"International Journal of Computer Applications in Technology","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Identification (biology); Identifier; Black box; Metaheuristic; Computer science; Artificial neural network; Automotive industry; Automotive engine; Algorithm; Machine learning; Artificial intelligence; Engineering; Automotive engineering","score_opus":0.017446040162054508,"score_gpt":0.3054915472670831,"score_spread":0.2880455071050286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473387183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013857651,0.00007422015,0.9832903,0.00004283167,0.000028183018,0.000025415215,0.000011109568,0.00019713487,0.0024731192],"genre_scores_gemma":[0.64660734,0.000115029914,0.34938273,0.000100902485,0.000015743213,0.00019274764,0.000059580292,0.000056211113,0.0034697724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978715,0.00007385429,0.000009969795,0.000042783096,0.000054781452,0.000031368527],"domain_scores_gemma":[0.9997009,0.00013033483,0.000042033556,0.00003667662,0.000074185395,0.000015960391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058653444,0.00045439258,0.00041633847,0.00030438163,0.00026659324,0.00056450063,0.00082336104,0.0007738353,0.0020207153],"category_scores_gemma":[0.0011914814,0.00019975255,0.00046800094,0.0002218405,0.00049879705,0.00035433855,0.0006289635,0.0006536766,0.00040191415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006229026,0.000021471904,0.00065126445,0.000049204456,0.000032552263,0.00005094427,0.00006348236,0.9337243,0.0063595865,0.013589435,0.00030042665,0.045095146],"study_design_scores_gemma":[0.0000046935556,0.0000421126,0.000049575927,0.0000038951966,0.0000041478866,0.000011407391,0.000005510596,0.9976618,0.0008526672,0.0008496657,0.0005114442,0.0000031720137],"about_ca_topic_score_codex":0.0026755992,"about_ca_topic_score_gemma":0.0029674356,"teacher_disagreement_score":0.0026755992,"about_ca_system_score_codex":0.00038005968,"about_ca_system_score_gemma":0.0006944679,"threshold_uncertainty_score":0.0067599416},"labels":[],"label_agreement":null},{"id":"W2474290527","doi":"10.1007/s12351-016-0251-z","title":"A new monarch butterfly optimization with an improved crossover operator","year":2016,"lang":"en","type":"article","venue":"Operational Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Crossover; Operator (biology); Benchmark (surveying); Butterfly; Computer science; Swarm intelligence; Mathematical optimization; Metaheuristic; Artificial intelligence; Particle swarm optimization; Mathematics; Algorithm; Ecology","score_opus":0.05427543962770417,"score_gpt":0.36476054377367145,"score_spread":0.3104851041459673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474290527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06902066,0.0012527845,0.9048914,0.00048784108,0.00063560245,0.00015915358,0.00020576273,0.00091789773,0.022428917],"genre_scores_gemma":[0.41646942,0.00062841445,0.5482933,0.00038839545,0.00024276639,0.00030962602,0.00030569936,0.00025754573,0.03310487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999814,0.00003675311,0.000008437775,0.000033835116,0.000076741475,0.0000302762],"domain_scores_gemma":[0.999881,0.000033373773,0.0000133085605,0.000023327733,0.00003340603,0.00001550643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031757783,0.0005751158,0.0008603788,0.0007534071,0.0004710794,0.00067479763,0.00134672,0.001118801,0.004447746],"category_scores_gemma":[0.00045119555,0.00029895408,0.00073282106,0.0009908363,0.0003732117,0.0006740633,0.00077991403,0.0007023361,0.00048473492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038052644,0.00024123782,0.00080069096,0.00024254106,0.00019689942,0.00022918137,0.0001024812,0.54396284,0.042117134,0.059241462,0.009053798,0.3434312],"study_design_scores_gemma":[0.000063356754,0.00012276079,0.00036127245,0.000012735329,0.00003933704,0.00008920014,0.000012188394,0.98747253,0.0030056725,0.0034836333,0.0053165765,0.000020647089],"about_ca_topic_score_codex":0.0025307008,"about_ca_topic_score_gemma":0.0040390654,"teacher_disagreement_score":0.004447746,"about_ca_system_score_codex":0.0006042303,"about_ca_system_score_gemma":0.0006725387,"threshold_uncertainty_score":0.014879227},"labels":[],"label_agreement":null},{"id":"W2478279759","doi":"","title":"A hybrid genetic algorithm for the Generalized Traveling Salesman Problem","year":2001,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Heuristics; Vertex (graph theory); Bottleneck traveling salesman problem; Algorithm; Computer science; Benchmark (surveying); Genetic algorithm; 2-opt; Lin–Kernighan heuristic; Mathematical optimization; Selection (genetic algorithm); Christofides algorithm; Mathematics; Graph; Combinatorics; Theoretical computer science; Artificial intelligence","score_opus":0.03526207476254649,"score_gpt":0.2775623342991926,"score_spread":0.24230025953664608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478279759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014071076,0.00082851516,0.9758675,0.00018003702,0.000113343885,0.000091412345,0.00006562075,0.00058986683,0.008192572],"genre_scores_gemma":[0.27421445,0.001067854,0.7116601,0.00027337437,0.000087553526,0.00038973516,0.00034130647,0.0001575953,0.011808095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996618,0.00008515753,0.0000123014715,0.00006894682,0.00013045121,0.000041375253],"domain_scores_gemma":[0.99982905,0.00007989284,0.000016114198,0.000015453188,0.000046346147,0.000013135328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004621443,0.000759962,0.0008080836,0.00082198717,0.00046514632,0.001055293,0.0013441695,0.0013546029,0.0025576865],"category_scores_gemma":[0.00092847156,0.00028069015,0.0006994135,0.0011360288,0.0005186437,0.00080070365,0.00069025886,0.0007588291,0.0006192789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007178526,0.000081958286,0.0004829481,0.000101666985,0.00010048808,0.00016848292,0.00008030495,0.7872042,0.0049897255,0.035004895,0.0035278136,0.16818565],"study_design_scores_gemma":[0.00003543818,0.000059789818,0.00012686908,0.000012700278,0.000025713121,0.0000826454,0.000016047752,0.9852188,0.0007812216,0.0074651763,0.006162648,0.00001290909],"about_ca_topic_score_codex":0.005043777,"about_ca_topic_score_gemma":0.0044286516,"teacher_disagreement_score":0.005043777,"about_ca_system_score_codex":0.000619554,"about_ca_system_score_gemma":0.0009622615,"threshold_uncertainty_score":0.010028839},"labels":[],"label_agreement":null},{"id":"W2478686883","doi":"","title":"Plenary lecture 8: towards opposition and center-based sampling for high-dimensional search spaces","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Opposition (politics); Computer science; Population; Computational intelligence; Particle swarm optimization; Differential evolution; Artificial intelligence; Evolutionary computation; Algorithm; Machine learning; Sociology; Political science; Law","score_opus":0.16433286751321077,"score_gpt":0.3920872015279786,"score_spread":0.22775433401476783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478686883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010201718,0.02741285,0.74629116,0.02499887,0.040197387,0.00029112695,0.0007673027,0.0019684017,0.14787115],"genre_scores_gemma":[0.19415888,0.0310365,0.46883613,0.009587385,0.04537997,0.001088527,0.0024359364,0.0024974702,0.24497925],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989472,0.00029257266,0.000053290587,0.00032045605,0.00029261844,0.00009382252],"domain_scores_gemma":[0.9983999,0.0009720071,0.00005875595,0.00009567276,0.00032390322,0.00014970383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640654,0.0016091113,0.001383379,0.0006237458,0.00071788847,0.003175928,0.0012057218,0.0015558426,0.03517719],"category_scores_gemma":[0.0075976714,0.00054990436,0.0013653621,0.0006515293,0.0013454203,0.0032671744,0.0019424094,0.0061339657,0.014553568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045737968,0.00022841616,0.000650297,0.00090547226,0.00014136621,0.00034707616,0.00037839136,0.0359187,0.004782369,0.2746705,0.40925908,0.27226096],"study_design_scores_gemma":[0.00013565517,0.00038782987,0.0012202935,0.0007730725,0.00008434137,0.00069579645,0.0002651373,0.14645627,0.0031514864,0.31072617,0.5359843,0.00011969824],"about_ca_topic_score_codex":0.0008529803,"about_ca_topic_score_gemma":0.00061187777,"teacher_disagreement_score":0.03517719,"about_ca_system_score_codex":0.0014062291,"about_ca_system_score_gemma":0.0007326437,"threshold_uncertainty_score":0.11767948},"labels":[],"label_agreement":null},{"id":"W2483094115","doi":"10.5539/mas.v10n10p118","title":"Three-Step Parameters Tuning Model for Time-Constrained Genetic Algorithms","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Applied Science Private University","keywords":"Sizing; Fitness function; Genetic algorithm; Computer science; Constraint (computer-aided design); Mathematical optimization; Algorithm; Limit (mathematics); Range (aeronautics); Function (biology); Power (physics); Mathematics","score_opus":0.03909815834210596,"score_gpt":0.2760703041704464,"score_spread":0.23697214582834047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483094115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052879713,0.00015367389,0.99111813,0.00010745574,0.000016326512,0.00008254852,0.000023619506,0.0003602244,0.0028499982],"genre_scores_gemma":[0.6575866,0.0006191074,0.3308842,0.00030695673,0.00003374,0.0010029544,0.00019027913,0.0003546816,0.009021638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985018,0.00043041474,0.000064848195,0.0003038245,0.0005846906,0.00011446873],"domain_scores_gemma":[0.9987196,0.0007117151,0.0001617764,0.00010811385,0.0002670383,0.00003181953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018316417,0.0011297286,0.000738209,0.00083594053,0.0005610085,0.0013730302,0.0019641772,0.0016013767,0.0027042776],"category_scores_gemma":[0.0040889843,0.0005257647,0.0010420007,0.00074497575,0.0008633269,0.0016727486,0.00091674546,0.0017531335,0.0007742683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024576191,0.000021145106,0.0002727224,0.000031704592,0.000020862315,0.00004000775,0.000048017548,0.9736328,0.0014457817,0.007958131,0.00026185793,0.01624233],"study_design_scores_gemma":[0.0000038583635,0.000022323225,0.000063688116,0.0000076191945,0.0000069313246,0.000017883258,0.0000045659813,0.9964623,0.0005932189,0.0022530882,0.0005573663,0.0000072517423],"about_ca_topic_score_codex":0.0075070844,"about_ca_topic_score_gemma":0.0043484825,"teacher_disagreement_score":0.0075070844,"about_ca_system_score_codex":0.0012472995,"about_ca_system_score_gemma":0.0014338885,"threshold_uncertainty_score":0.014926791},"labels":[],"label_agreement":null},{"id":"W2486008835","doi":"10.4018/978-1-59140-303-6.ch007","title":"Genetic Algorithm and Other Meta-Heuristics","year":2005,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Crossover; Heuristics; Computer science; Mathematical optimization; Markov chain; Genetic algorithm; Schema (genetic algorithms); Heuristic; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.04210831364145856,"score_gpt":0.2825978863054838,"score_spread":0.24048957266402526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486008835","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010581891,0.10003012,0.7113825,0.005083359,0.0014681347,0.00038859888,0.00059063674,0.0017025957,0.16877219],"genre_scores_gemma":[0.17948939,0.06629411,0.69042844,0.0021730824,0.00082611426,0.00054435816,0.000907226,0.00044059343,0.05889666],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942195,0.00022086233,0.00003422386,0.000076156815,0.00020084348,0.000045987934],"domain_scores_gemma":[0.9995204,0.00027927264,0.000047156846,0.00007112069,0.00006268686,0.000019301999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008050573,0.0013880348,0.0012067788,0.001320933,0.0005527671,0.003004153,0.0019341764,0.0024736866,0.0066949218],"category_scores_gemma":[0.0018908727,0.00038315332,0.001296513,0.0040951422,0.0010719851,0.0017300302,0.00085993164,0.0017288498,0.002754705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007570108,0.00014518383,0.0006470399,0.0012121336,0.00030838753,0.00031129303,0.00018021482,0.33320758,0.0017092193,0.2383528,0.022552742,0.40129772],"study_design_scores_gemma":[0.00010462495,0.00013226349,0.00055481837,0.0007663015,0.00016392408,0.0005782404,0.00022136813,0.29950622,0.0025425635,0.36770838,0.3276488,0.00007244988],"about_ca_topic_score_codex":0.004074615,"about_ca_topic_score_gemma":0.0041563245,"teacher_disagreement_score":0.0066949218,"about_ca_system_score_codex":0.0014989931,"about_ca_system_score_gemma":0.0015363415,"threshold_uncertainty_score":0.022396743},"labels":[],"label_agreement":null},{"id":"W2489851903","doi":"10.1007/978-3-319-19833-0","title":"Artificial Intelligence Applications in Information and Communication Technologies","year":2015,"lang":"en","type":"book","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Representation (politics); Machine learning; Data science","score_opus":0.14100114230022337,"score_gpt":0.40326447669611154,"score_spread":0.26226333439588817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489851903","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012047968,0.27877423,0.05813206,0.004807111,0.011227896,0.00011536553,0.00019064762,0.0004958179,0.6450521],"genre_scores_gemma":[0.013157688,0.19608939,0.030856667,0.0024705841,0.006806795,0.0002013919,0.0003598038,0.0004656771,0.7495921],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925286,0.00012066088,0.00004061509,0.00007431937,0.0004749456,0.000036589696],"domain_scores_gemma":[0.99909616,0.00049024133,0.000048080547,0.0001020215,0.00020127148,0.000062217405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005516412,0.0018629628,0.0015547303,0.0028566143,0.0007749242,0.004179526,0.0010105921,0.001376174,0.031090466],"category_scores_gemma":[0.0019205933,0.00047870388,0.00062832725,0.0062522497,0.0013415528,0.0044730916,0.0016599479,0.0033566644,0.019443708],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022829028,0.00006941309,0.000117740885,0.0012527363,0.00003548565,0.000077417135,0.0001855342,0.002515327,0.0014212213,0.17359754,0.31911153,0.5015933],"study_design_scores_gemma":[0.000005386569,0.000027159542,0.00030827653,0.000734563,0.000016936641,0.00019480249,0.000053079282,0.0027942504,0.0004308105,0.07547931,0.9199416,0.000013872464],"about_ca_topic_score_codex":0.00074025727,"about_ca_topic_score_gemma":0.0015625985,"teacher_disagreement_score":0.031090466,"about_ca_system_score_codex":0.0011744105,"about_ca_system_score_gemma":0.0011242089,"threshold_uncertainty_score":0.10400796},"labels":[],"label_agreement":null},{"id":"W2494254613","doi":"10.4018/978-1-4666-5784-7.ch011","title":"Designing Parallel Meta-Heuristic Methods","year":2014,"lang":"en","type":"book-chapter","venue":"Advances in systems analysis, software engineering, and high performance computing book series","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Heuristics; Computer science; Heuristic; Variety (cybernetics); Synchronization (alternating current); Meta heuristic; Focus (optics); Distributed computing; Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.01738171284749794,"score_gpt":0.2726138149475595,"score_spread":0.25523210210006153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494254613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050582443,0.0033989674,0.9786475,0.00034683224,0.00013973801,0.00021667332,0.00007072621,0.00048296285,0.011638322],"genre_scores_gemma":[0.07892568,0.004389094,0.9110987,0.00020104674,0.00012579768,0.0007601563,0.00018493124,0.00023243626,0.0040820637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99923074,0.0002738094,0.000048897786,0.00010688431,0.00027355284,0.00006611543],"domain_scores_gemma":[0.9991954,0.00046821532,0.00006112072,0.0001042045,0.00014492728,0.000026130125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015127748,0.0011950446,0.00096523756,0.0010091609,0.0005849113,0.0018029972,0.0019393935,0.0014327195,0.0042452705],"category_scores_gemma":[0.0035611822,0.0009805817,0.0010319985,0.0014625208,0.00068361347,0.0013976763,0.0012858302,0.0013844195,0.0017136968],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056641904,0.00006075596,0.0006348716,0.00069632876,0.00016215377,0.00011496186,0.0001258361,0.7408029,0.0033425211,0.07135791,0.0045793634,0.17806587],"study_design_scores_gemma":[0.00003180723,0.000033615448,0.000090760324,0.00010020541,0.000031324857,0.000052417854,0.0000358367,0.95117295,0.0014388637,0.029475957,0.017525634,0.000010715225],"about_ca_topic_score_codex":0.001200731,"about_ca_topic_score_gemma":0.0014457213,"teacher_disagreement_score":0.0042452705,"about_ca_system_score_codex":0.00094266585,"about_ca_system_score_gemma":0.0014283729,"threshold_uncertainty_score":0.0142018795},"labels":[],"label_agreement":null},{"id":"W2499749362","doi":"10.4208/eajam.030915.210416a","title":"Direct Gravitational Search Algorithm for Global Optimisation Problems","year":2016,"lang":"en","type":"article","venue":"East Asian Journal on Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Convergence (economics); Algorithm; Mathematical optimization; Computer science; Heuristic; Gravitational search algorithm; Mathematics","score_opus":0.03520732284600403,"score_gpt":0.29498889026498853,"score_spread":0.2597815674189845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2499749362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010995167,0.0012801979,0.9745059,0.00025726523,0.00013002228,0.00012017094,0.00007982545,0.0004170398,0.01221447],"genre_scores_gemma":[0.2514515,0.0011853348,0.7332012,0.00027539756,0.00012583328,0.00069106475,0.00040185472,0.00017437179,0.0124933245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994462,0.0002183174,0.000020816093,0.000071251794,0.0002101956,0.000033209315],"domain_scores_gemma":[0.99958223,0.00021761868,0.00003188923,0.00003806329,0.00011032165,0.000019765628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093196484,0.000990995,0.0009892139,0.0011660474,0.00040851388,0.0009004994,0.0010182497,0.001159301,0.0044319932],"category_scores_gemma":[0.0020085445,0.00032536482,0.0007652277,0.0011025629,0.0006843912,0.00060546893,0.0012824069,0.0008800745,0.000871039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009290308,0.00006988085,0.0006683844,0.00029677319,0.00010964179,0.00007988715,0.000076004624,0.7843239,0.0022877916,0.047168296,0.004607777,0.16021883],"study_design_scores_gemma":[0.000054209424,0.000052719253,0.00014876739,0.000018199038,0.000013185459,0.000034252607,0.000010387771,0.9810146,0.00041307387,0.012756802,0.005477196,0.000006616724],"about_ca_topic_score_codex":0.0038735357,"about_ca_topic_score_gemma":0.0030227967,"teacher_disagreement_score":0.0044319932,"about_ca_system_score_codex":0.000756688,"about_ca_system_score_gemma":0.0011545686,"threshold_uncertainty_score":0.014826477},"labels":[],"label_agreement":null},{"id":"W2504529984","doi":"10.1007/978-3-319-41000-5_16","title":"A Discrete Monarch Butterfly Optimization for Chinese TSP Problem","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Metaheuristic; Travelling salesman problem; Mathematical optimization; Swarm intelligence; Heuristic; Particle swarm optimization; Discretization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01733436334669416,"score_gpt":0.2874959649051844,"score_spread":0.2701616015584903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504529984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10206797,0.002611547,0.7828152,0.0020176112,0.00072494627,0.00020205023,0.00039467457,0.00024355043,0.108922504],"genre_scores_gemma":[0.71230406,0.0017200594,0.2329255,0.0004408522,0.000357763,0.00025645495,0.00044722148,0.00016761482,0.051380515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998473,0.000046751942,0.000004641743,0.000027391447,0.00004940538,0.00002440215],"domain_scores_gemma":[0.99986935,0.00006813048,0.000011012084,0.000014452889,0.000020987278,0.000016114278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031387637,0.0005400751,0.0006317836,0.0005128209,0.0005455038,0.0008706353,0.00096626574,0.0008777534,0.006217113],"category_scores_gemma":[0.0007784999,0.00024314149,0.00071124284,0.0011271337,0.0006967331,0.0006453841,0.00080111576,0.00105109,0.0003022651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116903706,0.00008178241,0.00036722378,0.00026099014,0.000049966322,0.00011338154,0.00008376719,0.7292717,0.0028931117,0.1843487,0.011691898,0.070720665],"study_design_scores_gemma":[0.00002022352,0.000050983846,0.00016966098,0.000012725508,0.000011421451,0.000033162945,0.000023897768,0.9658304,0.00030831966,0.028804976,0.0047270227,0.000007194617],"about_ca_topic_score_codex":0.0066545834,"about_ca_topic_score_gemma":0.007110301,"teacher_disagreement_score":0.0066545834,"about_ca_system_score_codex":0.0010770131,"about_ca_system_score_gemma":0.0010041187,"threshold_uncertainty_score":0.020798326},"labels":[],"label_agreement":null},{"id":"W2506699195","doi":"10.4018/978-1-61520-809-8.ch012","title":"Verification of Attributes in Linked Lists Using Ant Colony Metaphor","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tree traversal; Computer science; Ant colony optimization algorithms; Artificial intelligence; Ant colony; Machine learning; Algorithm","score_opus":0.053485515308848784,"score_gpt":0.3070188871783098,"score_spread":0.253533371869461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506699195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03571222,0.00034388952,0.943772,0.00036872362,0.00009415271,0.00018458464,0.00023571435,0.0029107502,0.016377991],"genre_scores_gemma":[0.43797746,0.00046241298,0.54859334,0.00016667087,0.000045253913,0.00017206001,0.00077874993,0.0005399071,0.011264116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984326,0.00024866924,0.000095290074,0.00021233244,0.00093416125,0.00007687144],"domain_scores_gemma":[0.9976096,0.0009952798,0.0001890431,0.0006041884,0.0005554214,0.00004640748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009302988,0.00030176152,0.0003927106,0.0009325249,0.0008678445,0.0027974595,0.0017227132,0.00075915095,0.0040407553],"category_scores_gemma":[0.0074676103,0.00030637364,0.00084341713,0.0008647953,0.0010224364,0.0033095302,0.0012098609,0.0008721199,0.0010670704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025258184,0.0001251645,0.003915885,0.0005925064,0.00006551434,0.0012023249,0.00118093,0.12923615,0.04719673,0.41379362,0.007466918,0.39497173],"study_design_scores_gemma":[0.000030637817,0.000114101436,0.0008193786,0.00014879448,0.00004033723,0.00066226715,0.00029952507,0.74046135,0.056068204,0.15593573,0.045368508,0.00005109706],"about_ca_topic_score_codex":0.0019307488,"about_ca_topic_score_gemma":0.00120886,"teacher_disagreement_score":0.0040407553,"about_ca_system_score_codex":0.00075963006,"about_ca_system_score_gemma":0.0009972844,"threshold_uncertainty_score":0.013517678},"labels":[],"label_agreement":null},{"id":"W2510587864","doi":"10.1007/978-3-319-45823-6_18","title":"An Active-Set Evolution Strategy for Optimization with Known Constraints","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Set (abstract data type); Mathematical optimization; Artificial intelligence; Theoretical computer science; Programming language; Mathematics","score_opus":0.0314904697842053,"score_gpt":0.29939555789141503,"score_spread":0.26790508810720975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510587864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038542992,0.00039381502,0.98243874,0.00011718419,0.00011915144,0.000051742245,0.000022007465,0.00007306198,0.012930011],"genre_scores_gemma":[0.2667127,0.0010925115,0.70263827,0.00042200368,0.00025392196,0.00073342153,0.00020144065,0.00024405723,0.027701674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994955,0.00016487222,0.000022250599,0.000059078582,0.00022706608,0.00003110688],"domain_scores_gemma":[0.9993492,0.00042864188,0.000035332396,0.000047479054,0.00011027742,0.000029044462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011910627,0.0015476192,0.0012072156,0.00097389723,0.0005386665,0.0014441113,0.0027110996,0.002288796,0.006040398],"category_scores_gemma":[0.0026629013,0.0007382083,0.0011872047,0.0013104117,0.0010921999,0.0015445123,0.002020622,0.0021252362,0.0011574588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008980148,0.00017047502,0.00019771357,0.00025780735,0.00012687549,0.0001274569,0.00015066925,0.6864254,0.004530975,0.12651877,0.0045461045,0.17685798],"study_design_scores_gemma":[0.000013950283,0.00003307243,0.000028533525,0.000018551349,0.000013003154,0.000025304507,0.000006354449,0.9867402,0.000365999,0.011314238,0.0014343454,0.0000065214895],"about_ca_topic_score_codex":0.001214749,"about_ca_topic_score_gemma":0.0011490618,"teacher_disagreement_score":0.006040398,"about_ca_system_score_codex":0.0006578477,"about_ca_system_score_gemma":0.0004909128,"threshold_uncertainty_score":0.020207107},"labels":[],"label_agreement":null},{"id":"W2511231963","doi":"10.5539/mas.v10n11p131","title":"A Survey on Evolutionary Computation: Methods and Their Applications in Engineering","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cloud computing; Evolutionary computation; Smart grid; Swarm intelligence; Evolutionary algorithm; Scheduling (production processes); Distributed computing; Evolutionary programming; Evolution strategy; Artificial intelligence; Machine learning; Mathematical optimization; Particle swarm optimization","score_opus":0.04076719215808219,"score_gpt":0.33433162384453674,"score_spread":0.2935644316864546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511231963","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039190813,0.47413495,0.47276604,0.0030273176,0.0013200813,0.000109996865,0.0002869137,0.00050854805,0.04392705],"genre_scores_gemma":[0.062466085,0.61689025,0.29872704,0.0011815883,0.0021633292,0.00035754635,0.0005772303,0.00038680373,0.01725017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999238,0.00023847978,0.00007377058,0.00010929349,0.00030537628,0.00003511095],"domain_scores_gemma":[0.9988617,0.00079904153,0.000042890573,0.00007995214,0.0001897689,0.000026692389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009219056,0.0011045092,0.001463163,0.002364948,0.00056127063,0.0018581199,0.0010524814,0.0017367277,0.005537667],"category_scores_gemma":[0.0025624256,0.0004914466,0.001045352,0.0052420604,0.00081984495,0.0018641771,0.0009697802,0.0015569956,0.0022024591],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036258272,0.00007387424,0.0012665831,0.0030104923,0.000112749454,0.00018827821,0.00021909078,0.029435515,0.00181651,0.12292148,0.023622096,0.81729716],"study_design_scores_gemma":[0.000025679617,0.000116906456,0.0017855309,0.0017021822,0.000077869874,0.0010334658,0.00019198922,0.08336572,0.0019388986,0.2035561,0.70611525,0.00009040432],"about_ca_topic_score_codex":0.0012913991,"about_ca_topic_score_gemma":0.0012332276,"teacher_disagreement_score":0.005537667,"about_ca_system_score_codex":0.0006746434,"about_ca_system_score_gemma":0.00088667683,"threshold_uncertainty_score":0.018525302},"labels":[],"label_agreement":null},{"id":"W2523130346","doi":"10.1007/978-3-319-44254-9_6","title":"Cohort Intelligence for Solving Travelling Salesman Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Intelligent systems reference library","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Knapsack problem; Travelling salesman problem; Cohort; Mathematical optimization; Computer science; Combinatorial optimization; Mach number; Mathematics; Artificial intelligence; Statistics; Engineering; Aerospace engineering","score_opus":0.07795382506558972,"score_gpt":0.27691218402052686,"score_spread":0.19895835895493713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523130346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041055456,0.0059902486,0.92592734,0.000832988,0.0007351065,0.000094022325,0.00026495958,0.00044215028,0.06160768],"genre_scores_gemma":[0.2134456,0.01614431,0.6531329,0.0006008876,0.0013736507,0.0009041941,0.0016163565,0.0005757249,0.11220635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995461,0.00014342241,0.000023513512,0.000055326338,0.00019367797,0.000038039056],"domain_scores_gemma":[0.99926144,0.00047031528,0.000043207667,0.00007828719,0.000107292835,0.000039339488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094406115,0.001079631,0.0008454762,0.0011531415,0.0006391113,0.0021287915,0.0020083217,0.0011331404,0.013599615],"category_scores_gemma":[0.004926296,0.0003355596,0.0009816166,0.0025177056,0.0007728681,0.0015975435,0.0014703976,0.0026670191,0.0030343062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028492777,0.00005365613,0.00033944493,0.00028646213,0.00006911511,0.000060314265,0.000096213305,0.13708508,0.00043141242,0.55939275,0.030491354,0.27166566],"study_design_scores_gemma":[0.000015039396,0.000028661,0.00016197797,0.00007723039,0.000018307912,0.0000351935,0.000031442967,0.5590869,0.00023520617,0.40672514,0.033569038,0.000015844116],"about_ca_topic_score_codex":0.0047432226,"about_ca_topic_score_gemma":0.004594058,"teacher_disagreement_score":0.013599615,"about_ca_system_score_codex":0.0011497616,"about_ca_system_score_gemma":0.001206149,"threshold_uncertainty_score":0.045495212},"labels":[],"label_agreement":null},{"id":"W2525485218","doi":"10.1109/tcbb.2015.2446484","title":"An Effective Application of Bacteria Quorum Sensing and Circular Elimination in MOPSO","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cascades (Canada)","funders":"Chongqing Three Gorges University","keywords":"Benchmark (surveying); Convergence (economics); Mathematical optimization; Particle swarm optimization; Quorum sensing; Computer science; Swarm behaviour; Pareto principle; Multi-swarm optimization; Set (abstract data type); Mathematics; Bacteria","score_opus":0.019480827765210314,"score_gpt":0.3061639911421978,"score_spread":0.28668316337698746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525485218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02541659,0.0003631115,0.97034,0.00015997146,0.00007233904,0.00011209881,0.000015519528,0.0002629339,0.0032574292],"genre_scores_gemma":[0.5086118,0.0005133752,0.48815423,0.00026628503,0.00006532329,0.00027839327,0.00006501199,0.00007236265,0.0019731638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996687,0.00008216606,0.00001992589,0.000042434523,0.00015290064,0.000033885222],"domain_scores_gemma":[0.9996917,0.00012947139,0.00004550325,0.00003288462,0.000078762976,0.000021587291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005778681,0.00060488516,0.0006213911,0.0005859648,0.00048178333,0.00045721914,0.00076184183,0.0005722032,0.0006762275],"category_scores_gemma":[0.0010493381,0.00025165424,0.00054958474,0.0004745285,0.00053750275,0.00056073593,0.0010009535,0.00049600424,0.00018154926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016719977,0.00017082169,0.0027958676,0.00030643045,0.00011083125,0.00030524482,0.0001848494,0.6618132,0.07369854,0.04953377,0.0016274127,0.2092859],"study_design_scores_gemma":[0.00002155228,0.00009822526,0.00032520868,0.0000117002055,0.000021036263,0.00006784905,0.000013596937,0.98913,0.0054710177,0.0023236717,0.0025011434,0.000014936062],"about_ca_topic_score_codex":0.0018068228,"about_ca_topic_score_gemma":0.0016415289,"teacher_disagreement_score":0.0018068228,"about_ca_system_score_codex":0.00033515613,"about_ca_system_score_gemma":0.0008604254,"threshold_uncertainty_score":0.0035925508},"labels":[],"label_agreement":null},{"id":"W2528426493","doi":"","title":"Learning a multi-criteria classification method using machine learning & metaheuristics techniques","year":2010,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Machine learning; Metaheuristic; Artificial intelligence; Computer science; Multiple-criteria decision analysis; Context (archaeology); Data mining; Mathematics; Mathematical optimization","score_opus":0.0817681822815171,"score_gpt":0.4011949090831579,"score_spread":0.3194267268016408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528426493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006908333,0.00036673454,0.98981196,0.00023443293,0.000050926465,0.00015642834,0.00003599509,0.00009640166,0.0023387098],"genre_scores_gemma":[0.12381425,0.0004730673,0.8729296,0.00017385125,0.00008284315,0.0006223983,0.00013472995,0.000046585454,0.0017227074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980233,0.00084633415,0.00015626504,0.00031759846,0.0005138365,0.0001427896],"domain_scores_gemma":[0.9972619,0.0019270575,0.0002901855,0.000100970145,0.00035809694,0.000061809995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039856075,0.0014137386,0.0019521058,0.002484039,0.0007460094,0.0022943814,0.00209807,0.0022108308,0.002544006],"category_scores_gemma":[0.0050574807,0.0006811331,0.002198216,0.0022148823,0.0008764113,0.0013590836,0.0012905808,0.0021596055,0.00038582517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048001864,0.00014889151,0.0011873611,0.00037930743,0.00016337195,0.000090512825,0.00012161979,0.8393412,0.0017453436,0.02272314,0.0016271345,0.13242415],"study_design_scores_gemma":[0.000008679167,0.000031967636,0.00009887924,0.000036931808,0.00001148596,0.00001826997,0.000020822737,0.99232,0.00038719713,0.00624396,0.0008143923,0.000007388574],"about_ca_topic_score_codex":0.0035202273,"about_ca_topic_score_gemma":0.0030300796,"teacher_disagreement_score":0.0039856075,"about_ca_system_score_codex":0.0016747931,"about_ca_system_score_gemma":0.0021739895,"threshold_uncertainty_score":0.02107817},"labels":[],"label_agreement":null},{"id":"W2531264864","doi":"","title":"What can we learn from No Free Lunch? a first attempt to characterize the concept of a searchable function","year":2001,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Field (mathematics); Function (biology); Scalar field; Theoretical computer science; Algorithm; Mathematical optimization; Mathematics","score_opus":0.038457576213986024,"score_gpt":0.2670666784141812,"score_spread":0.22860910220019517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531264864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04459166,0.018010247,0.8258338,0.07012129,0.0008974351,0.00009415212,0.00053180807,0.0004932894,0.039426304],"genre_scores_gemma":[0.7790694,0.015785106,0.18086945,0.008281784,0.0029010037,0.00038198216,0.00066442863,0.00045158592,0.011595309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972658,0.0013478862,0.000113643924,0.00054677343,0.000504698,0.00022121232],"domain_scores_gemma":[0.9812695,0.01432831,0.0008809603,0.0022767484,0.0007007798,0.00054372096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007119598,0.00096613093,0.0022373835,0.0017344524,0.0015064247,0.004306941,0.0026865285,0.003451373,0.007859294],"category_scores_gemma":[0.042408768,0.0005198301,0.0012651146,0.0018876359,0.0109190615,0.027918447,0.0029287322,0.0066430825,0.0015026153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014470502,0.00008672367,0.0012710559,0.00031495604,0.000084285355,0.00006324082,0.00019397643,0.026118662,0.00026106465,0.89114326,0.0068424353,0.0734757],"study_design_scores_gemma":[0.000008316505,0.00003225173,0.00011866949,0.00004391718,0.000005965765,0.000017749813,0.000035997356,0.011047788,0.0001054048,0.9857884,0.00278696,0.000008645587],"about_ca_topic_score_codex":0.00087088917,"about_ca_topic_score_gemma":0.00073509174,"teacher_disagreement_score":0.007859294,"about_ca_system_score_codex":0.0014183329,"about_ca_system_score_gemma":0.0015693816,"threshold_uncertainty_score":0.037652493},"labels":[],"label_agreement":null},{"id":"W2536934950","doi":"","title":"IPO: An Inclined Planes System Optimization Algorithm","year":2016,"lang":"en","type":"article","venue":"Computing and Informatics / Computers and Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Benchmark (surveying); Heuristic; Plane (geometry); Algorithm; Inclined plane; Motion (physics); Computer science; Space (punctuation); Optimization algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Geometry; Mechanical engineering","score_opus":0.03183234500161008,"score_gpt":0.28805459476112216,"score_spread":0.2562222497595121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536934950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097814,0.00041064853,0.9782908,0.00020381802,0.00011188188,0.00016469034,0.00015922396,0.0010901612,0.009787437],"genre_scores_gemma":[0.23932412,0.0004624528,0.74928796,0.000291001,0.00010819688,0.0008152947,0.00070690626,0.00035660784,0.008647525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968517,0.000083240375,0.00001649868,0.000062768326,0.00010971719,0.000042608863],"domain_scores_gemma":[0.9997861,0.000085715765,0.000029154786,0.000025535624,0.000054149623,0.000019347604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053627946,0.0009450484,0.0010873212,0.0007291162,0.0005391473,0.0008808655,0.0014464367,0.0013901395,0.006623357],"category_scores_gemma":[0.0011969832,0.00042658424,0.00068908435,0.00097268296,0.00043476807,0.00085096003,0.0012353385,0.0011653395,0.0014733304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001730072,0.000102626414,0.00086140755,0.00012105825,0.00007623952,0.000090549365,0.0000538758,0.806405,0.0017379699,0.009656088,0.0060014827,0.17472072],"study_design_scores_gemma":[0.000040904524,0.000049893948,0.00011027383,0.00000913197,0.0000090453805,0.000024706856,0.000008200199,0.9942054,0.00036500825,0.002056189,0.0031157753,0.0000053985555],"about_ca_topic_score_codex":0.0030649402,"about_ca_topic_score_gemma":0.0019852188,"teacher_disagreement_score":0.006623357,"about_ca_system_score_codex":0.00040315802,"about_ca_system_score_gemma":0.0014372858,"threshold_uncertainty_score":0.022157311},"labels":[],"label_agreement":null},{"id":"W2548142931","doi":"10.1504/ijcse.2016.080208","title":"Constraint handling in probability collectives using a modified feasibility-based rule","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Science and Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Variety (cybernetics); Heuristic; Computer science; Constraint (computer-aided design); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.04244383824893212,"score_gpt":0.31466687842316077,"score_spread":0.27222304017422866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548142931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008916507,0.00007165403,0.9875159,0.0001313033,0.000027718432,0.00006572893,0.000018452698,0.00009263909,0.0031600383],"genre_scores_gemma":[0.36282247,0.00017476172,0.63221884,0.00018344517,0.000118635784,0.0004826341,0.00009527418,0.00013678132,0.0037671144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760723,0.0008178813,0.00014920771,0.00035801076,0.0008929278,0.00017477952],"domain_scores_gemma":[0.994823,0.0029979458,0.00063484424,0.0007079066,0.00063712726,0.00019924321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040338514,0.00058810296,0.0013634221,0.0011965955,0.0010522162,0.0017042194,0.0023581076,0.0014046122,0.0027552382],"category_scores_gemma":[0.010868212,0.00059850817,0.0013288182,0.0012874827,0.0022300263,0.0019911986,0.0026722522,0.0018380763,0.0005853162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100222394,0.00007581035,0.0013497596,0.0001384745,0.00009080617,0.00038066856,0.0002721255,0.7998241,0.0039009464,0.11678963,0.002090427,0.074987024],"study_design_scores_gemma":[0.000026848089,0.000048053436,0.000121593686,0.000014971141,0.000015965265,0.00009140385,0.000020844447,0.96975696,0.0008283987,0.027350439,0.0017117682,0.000012734641],"about_ca_topic_score_codex":0.0024175292,"about_ca_topic_score_gemma":0.0021686596,"teacher_disagreement_score":0.0040338514,"about_ca_system_score_codex":0.00053237646,"about_ca_system_score_gemma":0.0013424443,"threshold_uncertainty_score":0.021333277},"labels":[],"label_agreement":null},{"id":"W2548265241","doi":"10.1007/s11721-016-0128-z","title":"Inertia weight control strategies for particle swarm optimization","year":2016,"lang":"en","type":"article","venue":"Swarm Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inertia; Benchmark (surveying); Particle swarm optimization; Computer science; Control (management); Mathematical optimization; Selection (genetic algorithm); Convergence (economics); Population; Control theory (sociology); Mathematics; Artificial intelligence; Economics","score_opus":0.02980599871837959,"score_gpt":0.29919085737402534,"score_spread":0.26938485865564576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548265241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137450155,0.0014141035,0.9725405,0.0002493576,0.00029870655,0.00007116289,0.000016298583,0.00014360991,0.011521183],"genre_scores_gemma":[0.7553723,0.0018781677,0.22539319,0.00020998572,0.0003102885,0.00038074778,0.00008953259,0.00016854961,0.016197182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983037,0.000045052384,0.000011257479,0.000015142903,0.00008206468,0.000016139997],"domain_scores_gemma":[0.9997359,0.00009638416,0.00003589413,0.0000235738,0.00009353918,0.000014665405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055576325,0.000888413,0.00058362604,0.00067949475,0.00041643015,0.00097458175,0.0009978276,0.0009098042,0.0020339717],"category_scores_gemma":[0.0020095424,0.00031468208,0.0003336275,0.00071132154,0.00057174737,0.0009407623,0.00072961947,0.0008656163,0.0004488809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009177937,0.00011314806,0.0003402437,0.00016436526,0.000062507024,0.00008182457,0.000120351775,0.7728268,0.004630705,0.055502255,0.0034521506,0.16261385],"study_design_scores_gemma":[0.000016685224,0.000035556026,0.00007182405,0.000010553571,0.000009218008,0.0000092756445,0.000008289789,0.9931525,0.00039698693,0.005084356,0.0011998054,0.0000049025944],"about_ca_topic_score_codex":0.003388107,"about_ca_topic_score_gemma":0.002415521,"teacher_disagreement_score":0.003388107,"about_ca_system_score_codex":0.0003609911,"about_ca_system_score_gemma":0.00044200502,"threshold_uncertainty_score":0.006804347},"labels":[],"label_agreement":null},{"id":"W2548462403","doi":"10.1109/ccece.2016.7726711","title":"Analyzing surveillance videos using automatically generated processing sequences with knowledge-augmented genetic algorithms","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Western University","funders":"","keywords":"Computer science; Sharpening; Image processing; Genetic algorithm; Noise (video); Domain (mathematical analysis); Algorithm; Enhanced Data Rates for GSM Evolution; Domain knowledge; Artificial intelligence; Image (mathematics); Object (grammar); Data mining; Machine learning","score_opus":0.0340904532320344,"score_gpt":0.30765059559695823,"score_spread":0.2735601423649238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548462403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04852388,0.0000645372,0.94865006,0.00006275721,0.000016998105,0.00009065928,0.000038364833,0.0014119106,0.0011408757],"genre_scores_gemma":[0.3005941,0.00007505392,0.6979063,0.00006551908,0.000016197791,0.00017963919,0.00021132783,0.00011021348,0.00084157387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996277,0.00008237931,0.000021034837,0.00010272549,0.00012431966,0.00004174545],"domain_scores_gemma":[0.9993011,0.00032102416,0.00011899698,0.000069810354,0.00016423555,0.000024736508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006388961,0.0008969184,0.0006597353,0.0013600665,0.00038574263,0.0007042177,0.0010617509,0.0009777453,0.00088849966],"category_scores_gemma":[0.0022321981,0.00041225206,0.00073967443,0.00070373336,0.0005193462,0.0006743804,0.0004459475,0.0006370522,0.00022892035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095591175,0.00016145271,0.0010845317,0.000056461595,0.00005816517,0.00009138334,0.00010038957,0.7922718,0.014647601,0.0026948464,0.00046860767,0.18826912],"study_design_scores_gemma":[0.000008080066,0.000025928217,0.00019503068,0.0000038113408,0.000007708517,0.00001643146,0.0000106195685,0.99571013,0.0029186595,0.00088981114,0.00020872061,0.00000507456],"about_ca_topic_score_codex":0.009682032,"about_ca_topic_score_gemma":0.0077534933,"teacher_disagreement_score":0.009682032,"about_ca_system_score_codex":0.00089107285,"about_ca_system_score_gemma":0.0011853278,"threshold_uncertainty_score":0.019251347},"labels":[],"label_agreement":null},{"id":"W2550177187","doi":"10.1080/18756891.2016.1256577","title":"A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0–1 Knapsack Problems","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Hebei GEO University; Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Harmony search; Cuckoo search; Knapsack problem; Computer science; Continuous knapsack problem; Algorithm; Artificial intelligence; Mathematical optimization; Machine learning; Mathematics","score_opus":0.05379947559308494,"score_gpt":0.3403491801626603,"score_spread":0.28654970456957535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550177187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024930261,0.0011157248,0.959743,0.00017149419,0.00015984726,0.00020702391,0.00006121885,0.00075031846,0.012861059],"genre_scores_gemma":[0.49383557,0.00075292337,0.49182093,0.00034498642,0.00012638775,0.0007870713,0.00029625368,0.00022182746,0.011814005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994306,0.0001380165,0.000029983168,0.000078799654,0.0002608855,0.000061668674],"domain_scores_gemma":[0.99971694,0.000093950075,0.00003362764,0.000021229285,0.000107475935,0.000026794596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006422878,0.0011708623,0.0012119118,0.0011369311,0.0007051394,0.00086424284,0.0020732384,0.001378874,0.0028059739],"category_scores_gemma":[0.0011272748,0.00053005235,0.0007703457,0.001354599,0.0005850019,0.0009185392,0.0011770854,0.0006653665,0.0005820636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015534028,0.000089793524,0.0007888669,0.00023514408,0.00012800873,0.00015478634,0.00014262591,0.83100754,0.007408295,0.016492657,0.003996268,0.13940068],"study_design_scores_gemma":[0.000047518668,0.000058259528,0.0001212134,0.000011182873,0.00001325992,0.00005210177,0.000013518147,0.99394715,0.0008229775,0.0018664778,0.0030299048,0.000016370443],"about_ca_topic_score_codex":0.008007319,"about_ca_topic_score_gemma":0.0059535154,"teacher_disagreement_score":0.008007319,"about_ca_system_score_codex":0.0005966375,"about_ca_system_score_gemma":0.0013545112,"threshold_uncertainty_score":0.015921414},"labels":[],"label_agreement":null},{"id":"W2553081833","doi":"10.1007/s10458-016-9350-8","title":"A novel abstraction for swarm intelligence: particle field optimization","year":2016,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Abstraction; Swarm intelligence; Swarm behaviour; Computer science; Perspective (graphical); Metaheuristic; Field (mathematics); Set (abstract data type); Heuristic; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics","score_opus":0.07563508047408636,"score_gpt":0.3298468779985365,"score_spread":0.25421179752445017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553081833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013596287,0.00069902575,0.9935355,0.00020852232,0.00014796038,0.000021255426,0.000030480634,0.00011165687,0.0038860068],"genre_scores_gemma":[0.16055913,0.0036296626,0.8268811,0.00036302127,0.000708858,0.00030480887,0.00023347963,0.000292488,0.0070274225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942756,0.00025749268,0.000031390544,0.00006307453,0.00018822066,0.00003229132],"domain_scores_gemma":[0.99957114,0.00017857981,0.000038303242,0.00010503934,0.00007226529,0.000034799777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002981,0.0012207475,0.001506794,0.001198754,0.0006383315,0.0018270565,0.0014164263,0.0011437219,0.0021790783],"category_scores_gemma":[0.0025052119,0.000397494,0.0011598063,0.0020897742,0.0012084305,0.00211455,0.002067982,0.002737986,0.00075618527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045783498,0.000068648005,0.000540472,0.00024024266,0.00010915695,0.00008021931,0.00014925437,0.19497623,0.0021930113,0.6763718,0.0066339765,0.118591234],"study_design_scores_gemma":[0.000020587357,0.00003493035,0.00014592978,0.000029738927,0.000029736431,0.000055081335,0.000022816308,0.7866739,0.00053796935,0.19790061,0.014532054,0.000016557495],"about_ca_topic_score_codex":0.0015414819,"about_ca_topic_score_gemma":0.0014383319,"teacher_disagreement_score":0.0021790783,"about_ca_system_score_codex":0.0006092945,"about_ca_system_score_gemma":0.0007401271,"threshold_uncertainty_score":0.0072897673},"labels":[],"label_agreement":null},{"id":"W2555627513","doi":"10.3390/computers6010005","title":"Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm","year":2017,"lang":"en","type":"article","venue":"Computers","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Bees algorithm; Algorithm; Honey Bees; Computer science; Benchmark (surveying); Nectar; Search algorithm; Population; Set (abstract data type); Implementation; Metaheuristic; Pollen; Ecology; Biology","score_opus":0.019505825423100354,"score_gpt":0.27521930378174836,"score_spread":0.255713478358648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555627513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012425359,0.0014702629,0.9722188,0.00037338817,0.00027848117,0.0003369227,0.00019765396,0.0013716724,0.011327545],"genre_scores_gemma":[0.14861505,0.0012994619,0.83294755,0.00044331915,0.000174606,0.0006946483,0.0007951561,0.000340949,0.014689257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995524,0.00010914786,0.00002834699,0.00008637362,0.00017858992,0.00004502182],"domain_scores_gemma":[0.9996712,0.00007766032,0.00004055641,0.00007882982,0.000107572334,0.000024215953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005369122,0.0010079094,0.001268832,0.000996488,0.0007492186,0.0010621374,0.0020173697,0.001481094,0.006080213],"category_scores_gemma":[0.0012642768,0.00034154145,0.0011616079,0.00126403,0.00045860896,0.0013220363,0.001034277,0.0010703055,0.0020919114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029223945,0.00018750346,0.0017522665,0.0004277454,0.00034088665,0.0002451458,0.00026486357,0.31820253,0.016550777,0.044666477,0.024490008,0.5925796],"study_design_scores_gemma":[0.00022010248,0.00026229708,0.0007879918,0.00008172759,0.00011947994,0.0003192064,0.00007928897,0.88079345,0.006596576,0.033410806,0.077262454,0.0000666816],"about_ca_topic_score_codex":0.0034127124,"about_ca_topic_score_gemma":0.0031883128,"teacher_disagreement_score":0.006080213,"about_ca_system_score_codex":0.00040182122,"about_ca_system_score_gemma":0.0011250161,"threshold_uncertainty_score":0.020340323},"labels":[],"label_agreement":null},{"id":"W2558365135","doi":"10.4018/ijcini.2016100102","title":"Adaptive Multiobjective Memetic Optimization","year":2016,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Research Manitoba; University of Manitoba","funders":"","keywords":"Computer science; Memetic algorithm; Mathematical optimization; Benchmark (surveying); Robustness (evolution); Multi-objective optimization; Cluster analysis; Optimization problem; Artificial intelligence; Evolutionary algorithm; Machine learning; Algorithm; Mathematics","score_opus":0.021546082505127184,"score_gpt":0.30913127475491275,"score_spread":0.28758519224978557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558365135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018641343,0.0010348285,0.9713165,0.0003177997,0.0001128125,0.00009530773,0.000036199996,0.0001891778,0.008255941],"genre_scores_gemma":[0.59633183,0.0010413395,0.39436913,0.00051193434,0.00012438331,0.0006430894,0.00009553667,0.000102311606,0.0067804083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941516,0.00026850638,0.000031923424,0.00008095045,0.00015183493,0.00005168151],"domain_scores_gemma":[0.9989796,0.00062154967,0.00012755324,0.00008401234,0.00015561728,0.000031600528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017710296,0.0010581319,0.0010697219,0.0011163375,0.0005528837,0.0011320167,0.0014627464,0.0016118161,0.0014688385],"category_scores_gemma":[0.003310915,0.00045669687,0.0009162338,0.00096367084,0.0009398794,0.00083022227,0.0011909374,0.00090415904,0.0002804507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039952483,0.000043518572,0.00046305382,0.00013284324,0.00014828825,0.000063347536,0.00006567042,0.933196,0.0020443834,0.021469,0.0010615649,0.041272316],"study_design_scores_gemma":[0.000011130112,0.000025621226,0.00006986951,0.000012564361,0.000012617892,0.000019319565,0.000009421479,0.99129945,0.00050490303,0.006906638,0.0011224491,0.0000060414654],"about_ca_topic_score_codex":0.0009542097,"about_ca_topic_score_gemma":0.00081858854,"teacher_disagreement_score":0.0017710296,"about_ca_system_score_codex":0.00067907845,"about_ca_system_score_gemma":0.0007344105,"threshold_uncertainty_score":0.009366214},"labels":[],"label_agreement":null},{"id":"W2558678654","doi":"10.1109/cec.2016.7744130","title":"An superior tracking artificial bee colony for global optimization problems","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Artificial bee colony algorithm; Benchmark (surveying); Bees algorithm; Dimension (graph theory); Convergence (economics); Computer science; Global optimization; Mathematical optimization; Tracking (education); Population; Optimization problem; Artificial intelligence; Metaheuristic; Algorithm; Mathematics","score_opus":0.048139316156334454,"score_gpt":0.3261855864511146,"score_spread":0.2780462702947802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558678654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014931241,0.0007621558,0.9781933,0.00019324056,0.0001295322,0.00005639421,0.00002570471,0.00037717828,0.005331367],"genre_scores_gemma":[0.33602104,0.0009954667,0.65739554,0.00024221539,0.00008384113,0.00020832811,0.000148076,0.00008975364,0.004815698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994254,0.000125856,0.000025358968,0.000050871957,0.00034690552,0.000025619061],"domain_scores_gemma":[0.99958104,0.00012632909,0.000042759923,0.00005624149,0.00017030333,0.000023364768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080689706,0.00050871965,0.0005904312,0.0005844,0.00040568184,0.00066264695,0.00080505037,0.000861189,0.0011524063],"category_scores_gemma":[0.0021250166,0.00019245766,0.00041195727,0.0008793105,0.00034300116,0.00055141305,0.0005848112,0.00069024734,0.00035253604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007905956,0.00007060551,0.0010145657,0.00016137397,0.00006314718,0.00019583035,0.00011082105,0.643092,0.024610277,0.026389418,0.004978138,0.29923478],"study_design_scores_gemma":[0.0000108139375,0.000027964976,0.00009040438,0.000005997233,0.0000076236993,0.000041287523,0.000002921029,0.99488384,0.001074686,0.0013547292,0.002495079,0.0000045404995],"about_ca_topic_score_codex":0.0029719267,"about_ca_topic_score_gemma":0.0024521763,"teacher_disagreement_score":0.0029719267,"about_ca_system_score_codex":0.00035217614,"about_ca_system_score_gemma":0.00083484926,"threshold_uncertainty_score":0.005909264},"labels":[],"label_agreement":null},{"id":"W2559580056","doi":"10.1109/cec.2016.7743845","title":"A radius-free quantum particle swarm optimization technique for dynamic optimization problems","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Multi-swarm optimization; Particle swarm optimization; Metaheuristic; Mathematical optimization; Computer science; Derivative-free optimization; Quantum; Continuous optimization; RADIUS; Optimization problem; Physics; Mathematics; Quantum mechanics","score_opus":0.022964089647289004,"score_gpt":0.2825203099912922,"score_spread":0.25955622034400316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559580056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001888883,0.00026962633,0.9953701,0.00007751682,0.000037543068,0.000029945995,0.0000111506915,0.0001609283,0.0021542753],"genre_scores_gemma":[0.17254557,0.0008748656,0.8214603,0.00017088988,0.000087930675,0.0002382216,0.00008068495,0.00012575107,0.0044157184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.00016208798,0.000025099973,0.000054652886,0.0002128086,0.000027733184],"domain_scores_gemma":[0.99964046,0.0001544617,0.000048370526,0.00005915075,0.00007719709,0.000020276431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576689,0.0005946304,0.0009840773,0.0005855291,0.0006070492,0.00069528416,0.0012393261,0.0010964861,0.0019997014],"category_scores_gemma":[0.0014613499,0.0003399907,0.0007987444,0.0008812077,0.00068120874,0.000911891,0.00112243,0.0009891499,0.0006423986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008793917,0.00008225759,0.00051738345,0.000245846,0.00010025647,0.00020823548,0.000184604,0.6906666,0.017998321,0.115719885,0.0039758114,0.17021282],"study_design_scores_gemma":[0.0000185835,0.0000396986,0.000101684054,0.000010589559,0.000014529781,0.00006907144,0.000007929641,0.98556244,0.0013724769,0.0071028364,0.0056874943,0.000012595577],"about_ca_topic_score_codex":0.0019313635,"about_ca_topic_score_gemma":0.0016792191,"teacher_disagreement_score":0.0019997014,"about_ca_system_score_codex":0.00044385475,"about_ca_system_score_gemma":0.0009228267,"threshold_uncertainty_score":0.0066896677},"labels":[],"label_agreement":null},{"id":"W2559710837","doi":"10.1109/cec.2016.7744349","title":"Heritage-dynamic cultural algorithm for multi-population solutions","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Minnesota Pollution Control Agency","keywords":"Population; Set (abstract data type); Computer science; Limit (mathematics); Genetic algorithm; Cultural algorithm; Algorithm; Cultural heritage; Space (punctuation); Artificial intelligence; Mathematical optimization; Machine learning; Population-based incremental learning; Mathematics; Sociology; Geography; Archaeology","score_opus":0.07195878933908625,"score_gpt":0.34952968208199,"score_spread":0.2775708927429037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559710837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012747478,0.0004139783,0.97199047,0.00031391103,0.00007754549,0.00010247541,0.000048256108,0.00046673464,0.013839249],"genre_scores_gemma":[0.3262443,0.00031572935,0.66415715,0.00028577776,0.00006155408,0.00041526227,0.00020997568,0.00018171845,0.008128572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994541,0.00022534598,0.000020549052,0.00009433968,0.00014782188,0.00005783976],"domain_scores_gemma":[0.99922407,0.00041153943,0.00006366766,0.00010992406,0.00013840354,0.000052408264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012608687,0.00076494704,0.00067706674,0.000960464,0.00090805005,0.0011870407,0.00161679,0.0014824175,0.005282326],"category_scores_gemma":[0.0037070063,0.0003002397,0.0007298211,0.0008910465,0.001101042,0.0011157284,0.0018352773,0.0013702726,0.00075702055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063123756,0.00007794097,0.0010214476,0.00009081468,0.00006529563,0.00012566739,0.00019656196,0.76274514,0.0013846166,0.101568855,0.0040996578,0.12856084],"study_design_scores_gemma":[0.00002762072,0.00003269386,0.000088776585,0.000017203613,0.000010993198,0.00005837367,0.00003152966,0.97681844,0.00053001294,0.01838755,0.0039884867,0.000008310313],"about_ca_topic_score_codex":0.0037763552,"about_ca_topic_score_gemma":0.003743679,"teacher_disagreement_score":0.005282326,"about_ca_system_score_codex":0.0011741045,"about_ca_system_score_gemma":0.0014446671,"threshold_uncertainty_score":0.017671108},"labels":[],"label_agreement":null},{"id":"W2561899334","doi":"10.1007/s00500-016-2466-6","title":"Incremental cooperative coevolution for large-scale global optimization","year":2016,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Sensitivity (control systems); Coevolution; Global optimization; Computer science; Mathematical optimization; Convergence (economics); Algorithm; Artificial intelligence; Mathematics","score_opus":0.019270535777701034,"score_gpt":0.30132901702112963,"score_spread":0.2820584812434286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561899334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055434614,0.00042035407,0.93723094,0.00024092158,0.00008928103,0.00007394588,0.000013654448,0.000269231,0.006227138],"genre_scores_gemma":[0.788698,0.00020296789,0.20663753,0.00014612719,0.000059721122,0.00026427885,0.000044806246,0.00010546779,0.003841036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955326,0.00017636573,0.000019058074,0.00005266295,0.00015080125,0.00004782836],"domain_scores_gemma":[0.99831665,0.0011370485,0.00007355671,0.00019591005,0.0002035878,0.00007327755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016595221,0.0006977408,0.0011171763,0.00066391245,0.00065456564,0.00075121725,0.0019256629,0.0014650242,0.0023207876],"category_scores_gemma":[0.0050393734,0.00047574658,0.000720701,0.000802945,0.001122999,0.001384376,0.002172763,0.0014357113,0.00036106457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060635888,0.00011162404,0.00044685908,0.000053190903,0.000073645206,0.000073639516,0.00008425069,0.9283678,0.002340076,0.01757635,0.0010327057,0.049779207],"study_design_scores_gemma":[0.000005466319,0.0000097041575,0.00002401115,0.0000010693856,0.0000038916387,0.000004649525,0.0000033171095,0.9980319,0.00012869443,0.0016739928,0.000111974085,0.0000013223713],"about_ca_topic_score_codex":0.0028479737,"about_ca_topic_score_gemma":0.0038250159,"teacher_disagreement_score":0.0028479737,"about_ca_system_score_codex":0.0006378402,"about_ca_system_score_gemma":0.0006303083,"threshold_uncertainty_score":0.0087765455},"labels":[],"label_agreement":null},{"id":"W2573363997","doi":"10.3166/ria.30.393-418","title":"Un nouvel algorithme de propagation de labels avec barrages","year":2016,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.04858913367081801,"score_gpt":0.2999341714413143,"score_spread":0.25134503777049627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573363997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040672286,0.00029615083,0.9904829,0.0004868817,0.00025450622,0.00005677881,0.00006851909,0.001191858,0.0030951009],"genre_scores_gemma":[0.05735418,0.00048555149,0.92574453,0.0005333757,0.0003512786,0.00024171153,0.00034331015,0.0005721574,0.014373937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975509,0.0007282472,0.00011516633,0.0007065196,0.0006999772,0.0001992391],"domain_scores_gemma":[0.9947353,0.003392676,0.00015569084,0.00082017377,0.00072624785,0.00016997936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032144012,0.0021990885,0.0020335682,0.0021335487,0.0020586378,0.005017176,0.0043817046,0.0057226093,0.0079684835],"category_scores_gemma":[0.011140808,0.0013980216,0.0023543986,0.0016478475,0.0030048902,0.0056710024,0.0029660505,0.005382765,0.0031696665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006380396,0.00034053254,0.00085995643,0.00037297583,0.0002635211,0.00016172495,0.0003724908,0.19420739,0.006574126,0.15897353,0.015841307,0.62139446],"study_design_scores_gemma":[0.00014900585,0.00014021706,0.00024555877,0.000080017715,0.000072676805,0.00015412275,0.00005001043,0.92239076,0.005243283,0.057067253,0.014358623,0.000048525977],"about_ca_topic_score_codex":0.008700266,"about_ca_topic_score_gemma":0.0067518386,"teacher_disagreement_score":0.008700266,"about_ca_system_score_codex":0.0019133157,"about_ca_system_score_gemma":0.0018314683,"threshold_uncertainty_score":0.026657224},"labels":[],"label_agreement":null},{"id":"W2576466201","doi":"10.1609/socs.v7i1.18396","title":"Weighted Lateral Learning in Real-Time Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Null-move heuristic; Incremental heuristic search; Heuristic; Robustness (evolution); Artificial intelligence; Property (philosophy); Consistent heuristic; Machine learning; Weighting; Search algorithm; Beam search; Algorithm; Mathematical optimization; Mathematics","score_opus":0.015487406199933024,"score_gpt":0.2745171946361062,"score_spread":0.2590297884361732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576466201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056407187,0.00061718357,0.9355657,0.00035943158,0.00006689821,0.000057946723,0.000016840988,0.00039276324,0.006515955],"genre_scores_gemma":[0.8941976,0.00023076228,0.101673186,0.00013962871,0.000048091988,0.00012352229,0.000029070787,0.00007786961,0.0034802621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.00047652586,0.000052990432,0.00015963436,0.0003219476,0.00013756606],"domain_scores_gemma":[0.9953753,0.0029429602,0.00058012776,0.00042129777,0.0004887979,0.00019160574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002840795,0.0006919015,0.0009858359,0.00080667995,0.000618775,0.0016611377,0.0021277505,0.0014250239,0.0018417508],"category_scores_gemma":[0.009960738,0.0005510873,0.0004683745,0.0008946557,0.002931878,0.0034680876,0.0016222084,0.0012252271,0.0003124418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006464117,0.000040213778,0.00032888865,0.000042585107,0.000023728597,0.000034048662,0.000050323873,0.93942285,0.0007395025,0.03279993,0.00020714528,0.02624623],"study_design_scores_gemma":[0.000009385386,0.000024905836,0.000029950315,0.0000034558464,0.000002879493,0.000007941842,0.0000054554293,0.9872364,0.00027948318,0.012174046,0.00022155797,0.000004535101],"about_ca_topic_score_codex":0.0035543595,"about_ca_topic_score_gemma":0.0027048332,"teacher_disagreement_score":0.0035543595,"about_ca_system_score_codex":0.001895228,"about_ca_system_score_gemma":0.0011919054,"threshold_uncertainty_score":0.015023768},"labels":[],"label_agreement":null},{"id":"W2577609954","doi":"","title":"Explorations of Quantum-Classical Approaches to Scheduling a Mars Lander Activity Problem","year":2016,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mars landing; Mathematical optimization; Scheduling (production processes); Quantum; Quantum computer; Mars Exploration Program; Algorithm; Theoretical computer science; Mathematics; Exploration of Mars","score_opus":0.49408787309912444,"score_gpt":0.3803586932931276,"score_spread":0.11372917980599684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577609954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12681794,0.0010350707,0.8523023,0.0012790113,0.00007397482,0.000090509486,0.00005414101,0.00016386494,0.018183252],"genre_scores_gemma":[0.73477435,0.00035285795,0.26187468,0.00019731672,0.00005250694,0.00014075913,0.00004599209,0.000045616463,0.0025159107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994561,0.00033607887,0.000015503654,0.00005179376,0.00009673174,0.000043833636],"domain_scores_gemma":[0.9988618,0.00086408906,0.00006991516,0.000067479574,0.000073155534,0.00006359646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017066939,0.00047348184,0.00060343527,0.000623514,0.00064650294,0.0010227239,0.001174599,0.0009789268,0.0026363216],"category_scores_gemma":[0.00356932,0.00042351015,0.0006528352,0.00050382805,0.0016391245,0.0016645874,0.0011914065,0.0009348704,0.00016823532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007068875,0.000055527966,0.00047855568,0.0000689346,0.00003219709,0.000040117953,0.00008013714,0.9059745,0.0005682453,0.07674565,0.00047127856,0.015414141],"study_design_scores_gemma":[0.000021712325,0.000032388252,0.000096393494,0.000007056648,0.000005507875,0.0000089827245,0.000023751838,0.9739212,0.00015555452,0.025083834,0.0006387642,0.000004864439],"about_ca_topic_score_codex":0.0031204843,"about_ca_topic_score_gemma":0.0042581153,"teacher_disagreement_score":0.0031204843,"about_ca_system_score_codex":0.00095856714,"about_ca_system_score_gemma":0.0010973937,"threshold_uncertainty_score":0.009025931},"labels":[],"label_agreement":null},{"id":"W2586424584","doi":"10.1109/intech.2016.7845071","title":"Solving the MAX-SAT problem by binary enhanced fireworks algorithm","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Binary number; Binary search algorithm; Computer science; Genetic algorithm; Differential evolution; Mathematical optimization; Mathematics; Search algorithm","score_opus":0.011133409711474886,"score_gpt":0.25055273836376957,"score_spread":0.23941932865229468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586424584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02751676,0.00034790355,0.9628232,0.0002578044,0.000077016724,0.000101109894,0.00006877043,0.00053334987,0.008274064],"genre_scores_gemma":[0.3071739,0.00032023428,0.6857067,0.00021850102,0.000059853577,0.00039111523,0.00035165122,0.00016086367,0.0056171543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946743,0.0001563405,0.00003297047,0.00009427069,0.00017076779,0.000078191246],"domain_scores_gemma":[0.99934953,0.00036855947,0.00006749243,0.00007232889,0.00011255258,0.000029477502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008382741,0.00074457546,0.0009109518,0.0008957436,0.00055391603,0.001038968,0.0016343505,0.0014351419,0.0049115354],"category_scores_gemma":[0.0023090544,0.0003791409,0.0009913868,0.0009928108,0.0006713882,0.0013403498,0.0010620109,0.0010685001,0.00079071167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028448048,0.0001846317,0.0014879011,0.00025886585,0.00010097512,0.00017418707,0.00013814989,0.6562437,0.0066330233,0.058204707,0.0052829385,0.2710064],"study_design_scores_gemma":[0.00006436226,0.00006610671,0.00014538146,0.00001875356,0.000017333608,0.00006768304,0.000020847496,0.981458,0.0018215793,0.013613724,0.0026976839,0.000008475849],"about_ca_topic_score_codex":0.0019324025,"about_ca_topic_score_gemma":0.0019789096,"teacher_disagreement_score":0.0049115354,"about_ca_system_score_codex":0.00054479664,"about_ca_system_score_gemma":0.00085222675,"threshold_uncertainty_score":0.016430736},"labels":[],"label_agreement":null},{"id":"W2587275747","doi":"10.29173/cais144","title":"An Evaluation of Genetic Algorithm Solutions in Optimization and Machine Learning","year":2013,"lang":"en","type":"article","venue":"Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genetic algorithm; Selection (genetic algorithm); Set (abstract data type); Computer science; Population-based incremental learning; Population; Mathematical optimization; Algorithm; Cultural algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.04358473973625091,"score_gpt":0.27932477459704547,"score_spread":0.23574003486079456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587275747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25874063,0.06455414,0.3588675,0.006603392,0.0024324902,0.0009389477,0.0012319938,0.0017293493,0.30490163],"genre_scores_gemma":[0.672048,0.015962917,0.2909194,0.0006281778,0.00030692294,0.00038307492,0.0011390864,0.00049534877,0.01811715],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9899967,0.0043463185,0.00034193337,0.00030204782,0.004767328,0.00024581476],"domain_scores_gemma":[0.9869681,0.009056694,0.00033134644,0.0005052967,0.002938627,0.00020007888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007428088,0.0010354256,0.00080326764,0.0036453665,0.00060993363,0.0021431586,0.000849291,0.001506998,0.0032663376],"category_scores_gemma":[0.027584797,0.00015736272,0.0005958178,0.0056767166,0.0009933984,0.0019864342,0.0009381496,0.00078398956,0.00051477307],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009562095,0.0004036955,0.0066563752,0.0013658105,0.00035876498,0.000232914,0.0003863443,0.25938585,0.0023749513,0.119818196,0.01805797,0.59000295],"study_design_scores_gemma":[0.00026859876,0.0026335048,0.01192482,0.0013945783,0.00032143018,0.0006084381,0.00086877286,0.7939804,0.012700213,0.06714365,0.1080519,0.00010364979],"about_ca_topic_score_codex":0.003483014,"about_ca_topic_score_gemma":0.003314073,"teacher_disagreement_score":0.007428088,"about_ca_system_score_codex":0.002419667,"about_ca_system_score_gemma":0.001445395,"threshold_uncertainty_score":0.03928399},"labels":[],"label_agreement":null},{"id":"W2588455578","doi":"10.1109/ssci.2016.7850283","title":"A dynamic cooperative hybrid MPSO+GA on hybrid CPU+GPU fused multicore","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; SIMD; Multi-core processor; Parallel computing; Central processing unit; Particle swarm optimization; Heuristic; Metaheuristic; Hybrid algorithm (constraint satisfaction); Algorithm; Computer hardware; Artificial intelligence; Constraint satisfaction","score_opus":0.020754922683939192,"score_gpt":0.2861552619509846,"score_spread":0.2654003392670454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588455578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48847964,0.0004851876,0.49346906,0.00035717466,0.00012945425,0.000119808305,0.00008599549,0.0016802251,0.015193411],"genre_scores_gemma":[0.8112856,0.00007196246,0.18502416,0.00008395135,0.000012838676,0.00009563491,0.000057216766,0.00006631004,0.0033022743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982613,0.00003763505,0.0000057121206,0.00003863343,0.00006098678,0.000030869098],"domain_scores_gemma":[0.99983394,0.00005275883,0.000018350871,0.000031382082,0.000040281793,0.000023294178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003061266,0.00035191182,0.00046233885,0.00032207766,0.0003656566,0.000492621,0.0009605061,0.00067982834,0.0010231985],"category_scores_gemma":[0.0004823081,0.00023199723,0.0004177502,0.0003585684,0.00036578265,0.00038765863,0.00058224483,0.00038148861,0.00018251063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012336619,0.000104829924,0.0011740791,0.000044532408,0.000070846494,0.00014356057,0.000051373743,0.92890924,0.020408632,0.00335618,0.0009041555,0.044709213],"study_design_scores_gemma":[0.000013545516,0.00003634366,0.00015466638,0.0000017393158,0.0000062018667,0.000013502604,0.000006170246,0.99770385,0.0013379537,0.00031367908,0.0004086545,0.000003701503],"about_ca_topic_score_codex":0.0055700624,"about_ca_topic_score_gemma":0.006313694,"teacher_disagreement_score":0.0055700624,"about_ca_system_score_codex":0.00050660624,"about_ca_system_score_gemma":0.00067503855,"threshold_uncertainty_score":0.011075258},"labels":[],"label_agreement":null},{"id":"W2588763176","doi":"10.1109/ssci.2016.7850253","title":"Effects of centralized population initialization in differential evolution","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Initialization; Benchmark (surveying); Population; Differential evolution; Population size; Computer science; Mathematical optimization; Convergence (economics); Centroid; Algorithm; Mathematics; Artificial intelligence; Demography","score_opus":0.008625469344585879,"score_gpt":0.2578360088285876,"score_spread":0.2492105394840017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588763176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47718325,0.0051992545,0.47862852,0.0007475083,0.0005242704,0.00021718927,0.0001763667,0.0024105425,0.034913037],"genre_scores_gemma":[0.9636156,0.00049466663,0.034484867,0.000090713766,0.000024763012,0.00004540316,0.00009160433,0.00008926684,0.0010630834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990107,0.0003676779,0.00005761705,0.00018712254,0.00026431348,0.00011255445],"domain_scores_gemma":[0.9951879,0.003028839,0.0003399472,0.0005451502,0.00074715354,0.00015102729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016559779,0.00075115386,0.00090422493,0.0005059832,0.00063799944,0.001021675,0.00084689446,0.0007584962,0.0019893262],"category_scores_gemma":[0.009931162,0.00023393857,0.00035760895,0.0005469324,0.0006196432,0.001067973,0.00093299104,0.00094227976,0.0003245958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047797634,0.00021234601,0.0033386082,0.00028546358,0.00008043759,0.00034050632,0.00016086557,0.881038,0.014332031,0.00933297,0.0015634419,0.088837296],"study_design_scores_gemma":[0.00009971233,0.0004749588,0.0021728387,0.00006793153,0.00009094682,0.00015081244,0.00010384769,0.9664387,0.02436671,0.0028006877,0.003198478,0.00003434709],"about_ca_topic_score_codex":0.0031651815,"about_ca_topic_score_gemma":0.0025571794,"teacher_disagreement_score":0.0031651815,"about_ca_system_score_codex":0.0008924587,"about_ca_system_score_gemma":0.00076681253,"threshold_uncertainty_score":0.00875777},"labels":[],"label_agreement":null},{"id":"W2590432748","doi":"10.1007/s00521-017-2903-1","title":"Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem","year":2017,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Knapsack problem; Computer science; Algorithm; Mathematical optimization; Continuous knapsack problem; Combinatorial optimization; Mathematics","score_opus":0.05245572999880233,"score_gpt":0.35898073008463927,"score_spread":0.30652500008583694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590432748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057995822,0.0006579497,0.9248433,0.0005372839,0.0001664716,0.00011591395,0.0001157136,0.0003927112,0.015174762],"genre_scores_gemma":[0.75222784,0.00032742223,0.2310517,0.00030306887,0.00006225164,0.00026179192,0.00019678325,0.000098165976,0.01547099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997259,0.0000614556,0.000012636661,0.000045074794,0.00008374636,0.00007118967],"domain_scores_gemma":[0.99970335,0.00014975067,0.000033298704,0.000018682354,0.000062631516,0.000032261873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000766429,0.0008208151,0.0012683801,0.0008043886,0.0007808134,0.0012119008,0.0016400957,0.0015990258,0.0040510967],"category_scores_gemma":[0.0012463013,0.0005031521,0.0005859494,0.00081709377,0.000574747,0.00080966676,0.001121357,0.000961845,0.00039614105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013056058,0.00006527497,0.00029529017,0.00006157484,0.000040689087,0.00006137773,0.00003664018,0.9443138,0.0010720296,0.01176397,0.0018071154,0.04035165],"study_design_scores_gemma":[0.000013271062,0.000026838723,0.000049544746,0.000005321084,0.0000058164164,0.000008453962,0.0000067443825,0.9974043,0.0001649996,0.0020653738,0.0002454123,0.00000383385],"about_ca_topic_score_codex":0.01051207,"about_ca_topic_score_gemma":0.012806021,"teacher_disagreement_score":0.01051207,"about_ca_system_score_codex":0.001438206,"about_ca_system_score_gemma":0.0020396933,"threshold_uncertainty_score":0.0209018},"labels":[],"label_agreement":null},{"id":"W2595987953","doi":"","title":"Globalization Strategies for Mesh Adaptive Direct Search","year":2008,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Class (philosophy); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.030999096613937804,"score_gpt":0.2786702842659811,"score_spread":0.24767118765204332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595987953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009729945,0.0009412464,0.9761422,0.00014304297,0.000070042246,0.00006328851,0.00004064023,0.0001822246,0.012687392],"genre_scores_gemma":[0.43097094,0.0017044883,0.55423605,0.00026664181,0.000103324724,0.0006729672,0.00023499753,0.00027035206,0.011540336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978656,0.000107589454,0.00001055342,0.000023523273,0.000058280548,0.000013470099],"domain_scores_gemma":[0.9996525,0.00018639416,0.00002965078,0.00006075984,0.000047234782,0.000023532686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057641586,0.0005922413,0.0004981661,0.00064648356,0.00032706722,0.0006709043,0.00057795376,0.00049429614,0.004268362],"category_scores_gemma":[0.002016907,0.00027018096,0.00049213757,0.00047231367,0.0007166342,0.00056980713,0.0013716794,0.0006833939,0.0006395723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007052558,0.000050153263,0.0009249444,0.00023897868,0.00008547915,0.00013954786,0.00019435483,0.40676337,0.007551067,0.3562116,0.004538641,0.22323133],"study_design_scores_gemma":[0.000034409768,0.000067301255,0.00022813232,0.00003062036,0.000012348428,0.000058827573,0.000020419473,0.9143227,0.0011275805,0.075122505,0.008964755,0.000010446069],"about_ca_topic_score_codex":0.0006118043,"about_ca_topic_score_gemma":0.000703947,"teacher_disagreement_score":0.004268362,"about_ca_system_score_codex":0.00034305593,"about_ca_system_score_gemma":0.00030983798,"threshold_uncertainty_score":0.0142790675},"labels":[],"label_agreement":null},{"id":"W2596534719","doi":"","title":"Nonsmooth Optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search","year":2006,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Variable neighborhood search; Mathematical optimization; Metaheuristic; Convergence (economics); Variable (mathematics); Guided Local Search; Local search (optimization); Mathematics; Computer science; Algorithm","score_opus":0.014882220476374133,"score_gpt":0.24637892971795808,"score_spread":0.23149670924158394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596534719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077029727,0.00021973043,0.9889286,0.000051680698,0.000023749744,0.000022379503,0.0000075040766,0.000105614185,0.0029377185],"genre_scores_gemma":[0.3139094,0.0003423843,0.6799052,0.0000939691,0.00004635422,0.00025638484,0.000057710058,0.00011414208,0.0052744728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997173,0.000107367785,0.0000086256605,0.000033105607,0.00011947385,0.000014061392],"domain_scores_gemma":[0.9997098,0.00017329003,0.000036443827,0.000028311113,0.00003994712,0.000012153117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049803406,0.00046187345,0.00055946875,0.00047326164,0.00022638342,0.00045506444,0.0007506272,0.00057418796,0.0011455847],"category_scores_gemma":[0.0013696919,0.00031074736,0.0003930038,0.00046131908,0.000490548,0.00061083765,0.00088641996,0.00051073625,0.00020106243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005331366,0.0000372693,0.00048735773,0.00009691576,0.000072220726,0.00008709671,0.00008213423,0.8203311,0.0052452884,0.044076774,0.0011289361,0.12830165],"study_design_scores_gemma":[0.000011315979,0.0000238654,0.000059012025,0.00000440384,0.000004221244,0.000021371294,0.0000047068484,0.9922018,0.00056681887,0.00567109,0.0014281669,0.0000032000964],"about_ca_topic_score_codex":0.001668926,"about_ca_topic_score_gemma":0.0025053846,"teacher_disagreement_score":0.001668926,"about_ca_system_score_codex":0.00035006562,"about_ca_system_score_gemma":0.00048180032,"threshold_uncertainty_score":0.0038323402},"labels":[],"label_agreement":null},{"id":"W2599286397","doi":"10.1007/s10710-017-9298-8","title":"A univariate marginal distribution algorithm based on extreme elitism and its application to the robotic inverse displacement problem","year":2017,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"British Columbia Knowledge Development Fund; Canada Foundation for Innovation","keywords":"Particle swarm optimization; Computer science; Algorithm; Univariate; Differential evolution; Heuristic; Displacement (psychology); Domain (mathematical analysis); Mathematical optimization; Mathematics; Artificial intelligence; Machine learning","score_opus":0.019666172899434866,"score_gpt":0.2691151408858998,"score_spread":0.2494489679864649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599286397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070466334,0.00008409284,0.99137586,0.00011357444,0.000024956895,0.00001711692,0.0000075262487,0.00015525859,0.0011749313],"genre_scores_gemma":[0.3823455,0.0003062951,0.610779,0.00018896296,0.000095070296,0.00023568427,0.0000851001,0.0002762635,0.005688133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993333,0.00027510073,0.000022831624,0.00007864184,0.00022025968,0.00006979205],"domain_scores_gemma":[0.99805105,0.0013538785,0.00011910444,0.00010412944,0.00027825162,0.000093512994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00206835,0.000673617,0.0012040897,0.0009543406,0.00072837796,0.0009048902,0.0018946048,0.0013555463,0.0027580552],"category_scores_gemma":[0.005591786,0.00042669347,0.000884456,0.0012619729,0.0016389185,0.0013837472,0.0019254092,0.0018274811,0.00036284354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008008191,0.000100964986,0.00066019304,0.000046499088,0.000047115725,0.00005861304,0.00008490501,0.86057234,0.0016668052,0.04323788,0.0012005857,0.092243984],"study_design_scores_gemma":[0.0000055825394,0.00001647572,0.00005949345,0.0000023445107,0.0000035356115,0.000013366514,0.0000052282558,0.9942114,0.0002505819,0.005185074,0.00024150083,0.0000053790895],"about_ca_topic_score_codex":0.0026672892,"about_ca_topic_score_gemma":0.0025510325,"teacher_disagreement_score":0.0027580552,"about_ca_system_score_codex":0.0011206052,"about_ca_system_score_gemma":0.0014708521,"threshold_uncertainty_score":0.010938644},"labels":[],"label_agreement":null},{"id":"W2602337361","doi":"10.1109/tpds.2017.2687461","title":"Adaptive Particle Swarm Optimization with Heterogeneous Multicore Parallelism and GPU Acceleration","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Parallel computing; Multi-core processor; Data parallelism; CUDA; Xeon; Xeon Phi; Particle swarm optimization; Vectorization (mathematics); Graphics processing unit; Parallel processing; Parallelism (grammar); Algorithm","score_opus":0.041198773977055084,"score_gpt":0.27206910627444064,"score_spread":0.23087033229738557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602337361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15328038,0.0004109215,0.83648795,0.0003183694,0.0000885851,0.00006918668,0.00004484396,0.00072193047,0.008577868],"genre_scores_gemma":[0.73129076,0.00017764202,0.26613876,0.00006158554,0.000029780764,0.00008189348,0.00007816417,0.00009394024,0.0020474503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997502,0.00007636164,0.000011033593,0.00004203711,0.00008812016,0.000032296386],"domain_scores_gemma":[0.9997116,0.000091281196,0.000029300028,0.00007965106,0.00006609043,0.000022000322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038925785,0.00041862004,0.00039061168,0.00025865468,0.00029365855,0.00049194036,0.0006911702,0.00036497053,0.000622706],"category_scores_gemma":[0.000998479,0.00017680886,0.00041993085,0.0006247247,0.00032779237,0.00046371503,0.00056921627,0.0005840506,0.00015115892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111595284,0.000070523434,0.0018647418,0.000035918067,0.00007114973,0.0001380263,0.00006670265,0.9221811,0.010405159,0.008973055,0.0010921888,0.054989785],"study_design_scores_gemma":[0.000009317362,0.000019899418,0.00024444456,0.0000010822072,0.0000042294187,0.000009635558,0.0000051809643,0.9968213,0.0011130613,0.0012585128,0.00051119947,0.000002248482],"about_ca_topic_score_codex":0.0041207266,"about_ca_topic_score_gemma":0.0040446203,"teacher_disagreement_score":0.0041207266,"about_ca_system_score_codex":0.00035872447,"about_ca_system_score_gemma":0.00055483915,"threshold_uncertainty_score":0.008193493},"labels":[],"label_agreement":null},{"id":"W2604181050","doi":"10.1609/aaai.v31i1.10658","title":"Problem Difficulty and the Phase Transition in Heuristic Search","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Heuristic; Benchmark (surveying); Mathematical optimization; Computer science; Incremental heuristic search; Phase transition; Beam search; Greedy algorithm; Work (physics); Search algorithm; Mathematics; Physics; Thermodynamics","score_opus":0.09672332879444981,"score_gpt":0.35426040957173177,"score_spread":0.257537080777282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604181050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5558979,0.0037545473,0.40229014,0.006910126,0.00012928869,0.00032852424,0.00043144877,0.00054968946,0.02970838],"genre_scores_gemma":[0.9460918,0.0010981763,0.049798705,0.00037735724,0.00012102635,0.0003232097,0.000328195,0.00018853752,0.0016729684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964516,0.0017279224,0.00016686562,0.00048364722,0.00077179144,0.00039811176],"domain_scores_gemma":[0.93780357,0.052747507,0.004019325,0.0028633266,0.0015714952,0.000994745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048157773,0.00070862257,0.0011260331,0.0017590106,0.001029363,0.0031708223,0.001190951,0.0019282436,0.0040426366],"category_scores_gemma":[0.07929777,0.0010498861,0.0013010033,0.0014128125,0.0042912164,0.0077050584,0.0025743416,0.0038255847,0.00041776372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057078304,0.00045918982,0.010628535,0.00074818876,0.0002504839,0.0003350851,0.0017363523,0.42932126,0.0050797565,0.508172,0.004348453,0.03834995],"study_design_scores_gemma":[0.0001402344,0.000249205,0.0031738738,0.00011599261,0.000039980678,0.00021003607,0.0004364455,0.45350647,0.0018360451,0.5356756,0.004571169,0.000045016004],"about_ca_topic_score_codex":0.0014052638,"about_ca_topic_score_gemma":0.0008822002,"teacher_disagreement_score":0.0048157773,"about_ca_system_score_codex":0.0017458268,"about_ca_system_score_gemma":0.0012575238,"threshold_uncertainty_score":0.025468528},"labels":[],"label_agreement":null},{"id":"W2604948093","doi":"10.24963/ijcai.2017/69","title":"Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Heuristics; Consistent heuristic; Heuristic; Bidirectional search; Incremental heuristic search; Mathematical optimization; Search algorithm; Beam search; Best-first search; Mathematics; Node (physics); Null-move heuristic; Computer science; Algorithm; Combinatorics; Engineering","score_opus":0.03792417353133272,"score_gpt":0.31625790404090603,"score_spread":0.27833373050957333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604948093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103729345,0.00027757042,0.88292634,0.00014524958,0.000043370106,0.00018988248,0.00011759899,0.00095668726,0.011613995],"genre_scores_gemma":[0.4679986,0.0001096152,0.52770454,0.00014558344,0.000015138303,0.00027952247,0.0003482519,0.00015909557,0.0032396305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999358,0.0002221723,0.000037671063,0.000093912495,0.00016088069,0.0001274047],"domain_scores_gemma":[0.998762,0.0006501457,0.00011533189,0.00022195702,0.0001828541,0.00006767906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011643564,0.0008600246,0.0009873031,0.0006030544,0.00064962823,0.00075996673,0.0011782432,0.0011105235,0.0031719846],"category_scores_gemma":[0.0033879862,0.00045775383,0.00066461926,0.0006434976,0.000505739,0.000928813,0.0014706398,0.001000614,0.0006694583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004172143,0.00034299184,0.0015230938,0.00015241538,0.000055151882,0.00015901317,0.00017319531,0.73725,0.007327669,0.02327337,0.0025275634,0.22679828],"study_design_scores_gemma":[0.000029012599,0.00007075539,0.000087041655,0.000011317698,0.0000107837905,0.000029921654,0.00003673732,0.98979026,0.0015802468,0.0073651997,0.0009837983,0.000004987418],"about_ca_topic_score_codex":0.0024268113,"about_ca_topic_score_gemma":0.003986081,"teacher_disagreement_score":0.0031719846,"about_ca_system_score_codex":0.0005381328,"about_ca_system_score_gemma":0.0014207298,"threshold_uncertainty_score":0.010611355},"labels":[],"label_agreement":null},{"id":"W2610402045","doi":"10.1007/s10489-017-0926-z","title":"Cooperative co-evolution with sensitivity analysis-based budget assignment strategy for large-scale global optimization","year":2017,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Benchmark (surveying); Sensitivity (control systems); Mathematical optimization; Global optimization; Function (biology); Scale (ratio); Representation (politics); Algorithm; Mathematics; Biology","score_opus":0.032784693096042504,"score_gpt":0.33636197840259846,"score_spread":0.303577285306556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610402045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04621357,0.00042503205,0.9467167,0.00024217876,0.000050780804,0.0000966592,0.000024121537,0.00016101365,0.006069931],"genre_scores_gemma":[0.9213136,0.00017137612,0.076118894,0.000105277104,0.000024825302,0.00021376935,0.000042039923,0.000049554408,0.0019606936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993697,0.0002467573,0.000021792033,0.000093832125,0.00018107292,0.00008683169],"domain_scores_gemma":[0.99861646,0.0009332793,0.0001294175,0.000074000105,0.00018284122,0.0000639568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018827269,0.0011516743,0.0014011179,0.0010559995,0.0006071647,0.00094713614,0.0016026067,0.0013177596,0.0015767794],"category_scores_gemma":[0.003893687,0.00057937397,0.0008454556,0.0009747215,0.000762234,0.0011682098,0.001584606,0.0009979188,0.00015734532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032480402,0.00004630201,0.00027604788,0.000026356214,0.000044849636,0.000041254974,0.00003794415,0.9820571,0.0010539622,0.0038863947,0.00037136456,0.012125889],"study_design_scores_gemma":[0.000003942313,0.0000126430305,0.000032220974,0.0000016995858,0.000005328875,0.0000057815155,0.0000032964965,0.9991553,0.000092384435,0.00062156236,0.00006422308,0.0000015990681],"about_ca_topic_score_codex":0.0046826983,"about_ca_topic_score_gemma":0.003340901,"teacher_disagreement_score":0.0046826983,"about_ca_system_score_codex":0.0008862557,"about_ca_system_score_gemma":0.0010098616,"threshold_uncertainty_score":0.009956956},"labels":[],"label_agreement":null},{"id":"W2612133367","doi":"10.1007/s10846-017-0564-z","title":"An Improved Genetic Algorithm Approach on Mechanism Kinematic Structure Enumeration with Intelligent Manufacturing","year":2017,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Crossover; Genetic algorithm; Isomorphism (crystallography); Convergence (economics); Identification (biology); Algorithm; Mathematical optimization; Kinematics; Computer science; Enumeration; Rate of convergence; Kinematic chain; Process (computing); Mechanism (biology); Simple (philosophy); Mathematics; Key (lock); Artificial intelligence; Combinatorics","score_opus":0.02560892340122091,"score_gpt":0.28213616677069153,"score_spread":0.25652724336947064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612133367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011072813,0.00021509572,0.98033583,0.00008934523,0.00011082585,0.000063413405,0.000027325992,0.00027373424,0.0078115654],"genre_scores_gemma":[0.21411462,0.00021240147,0.7803569,0.000109554734,0.000055451903,0.00023599435,0.000089556095,0.000103625265,0.004721834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965024,0.00009426932,0.000013403938,0.00004889033,0.00015778831,0.000035518744],"domain_scores_gemma":[0.9997534,0.00010916387,0.000021160931,0.000036904297,0.00006797962,0.000011375646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053331803,0.00073192525,0.00094796676,0.0012329099,0.00060437893,0.0008187614,0.0017695382,0.0015218875,0.0033779333],"category_scores_gemma":[0.0010295057,0.00048798107,0.0011752072,0.0014498015,0.0004826657,0.00077458855,0.0009772186,0.00078073976,0.00051667274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042100342,0.00007748927,0.0003369645,0.000064103704,0.00005296721,0.0000815987,0.000036890422,0.8642164,0.0031927053,0.01872759,0.0010421878,0.11212894],"study_design_scores_gemma":[0.000009248194,0.000021973607,0.000072318944,0.000005321006,0.000010314233,0.000019952167,0.000004787821,0.9966833,0.0003690889,0.0021156482,0.00068432174,0.0000037646541],"about_ca_topic_score_codex":0.0033849347,"about_ca_topic_score_gemma":0.003298979,"teacher_disagreement_score":0.0033849347,"about_ca_system_score_codex":0.0005546099,"about_ca_system_score_gemma":0.0009281196,"threshold_uncertainty_score":0.011300325},"labels":[],"label_agreement":null},{"id":"W2612309007","doi":"","title":"The multi-modal traveling salesman problem","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Travelling salesman problem; Computer science; Modal; 2-opt; Mathematical optimization; Mathematics; Algorithm; Materials science","score_opus":0.023466016471735254,"score_gpt":0.26414754496934023,"score_spread":0.240681528497605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612309007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07688799,0.0030684557,0.8605148,0.0034778318,0.00047968517,0.00023067187,0.0011575741,0.00034036805,0.053842746],"genre_scores_gemma":[0.7352752,0.0031000935,0.22330378,0.0005441752,0.0005079561,0.00044396793,0.0011651407,0.00022208045,0.03543758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942315,0.00019889076,0.000020390044,0.00015012219,0.000121991216,0.0000855129],"domain_scores_gemma":[0.99929976,0.00042991986,0.000077508215,0.00003882064,0.0000792404,0.00007465759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007621559,0.0007473831,0.0010229168,0.00070744206,0.0008121515,0.0022241012,0.0015532544,0.002665191,0.0076722465],"category_scores_gemma":[0.0028174263,0.0005554937,0.0009268863,0.0014171002,0.00087711937,0.0023855271,0.0013167189,0.0016926884,0.00078466034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024554142,0.0001841254,0.00062709925,0.00064612937,0.00015609631,0.00038992584,0.0002017999,0.6181775,0.0025174678,0.2729602,0.018568028,0.08532613],"study_design_scores_gemma":[0.000038730366,0.000056294764,0.00023893524,0.000038175098,0.000037894853,0.00013862948,0.0001263504,0.8476725,0.00065995986,0.14207622,0.00889327,0.000023074283],"about_ca_topic_score_codex":0.003915722,"about_ca_topic_score_gemma":0.0026836286,"teacher_disagreement_score":0.0076722465,"about_ca_system_score_codex":0.0011941497,"about_ca_system_score_gemma":0.0012381674,"threshold_uncertainty_score":0.025666237},"labels":[],"label_agreement":null},{"id":"W2618467698","doi":"10.1007/s12293-017-0234-5","title":"A Hybrid grey wolf optimizer and genetic algorithm for minimizing potential energy function","year":2017,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":131,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Premature convergence; Crossover; Maxima and minima; Algorithm; Population; Genetic algorithm; Population-based incremental learning; Mathematical optimization; Computer science; Benchmark (surveying); Curse of dimensionality; Operator (biology); Convergence (economics); Mathematics; Artificial intelligence","score_opus":0.0210543000855937,"score_gpt":0.2711286795990178,"score_spread":0.2500743795134241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618467698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015536291,0.00078022043,0.975054,0.00018365722,0.00012788147,0.00007419106,0.000035147732,0.0004790617,0.007729596],"genre_scores_gemma":[0.3533109,0.0005869452,0.63315237,0.00023610091,0.000112850816,0.00027516155,0.00010467057,0.0001933374,0.012027624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997055,0.00007125396,0.000011752527,0.000036548365,0.00015181606,0.00002309279],"domain_scores_gemma":[0.9998627,0.000057149908,0.000011789076,0.000016757509,0.000042881224,0.000008736868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238335,0.00060274004,0.0011716702,0.00080072886,0.0004368832,0.0007489477,0.0012775906,0.001739429,0.0025949837],"category_scores_gemma":[0.000769774,0.0003733227,0.00078172056,0.00091388414,0.00044607036,0.00074441975,0.0007192286,0.0007228454,0.0006513545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001359743,0.00009939056,0.00047284501,0.0001823371,0.00016427696,0.0001896523,0.00006350255,0.8098974,0.015887203,0.021218957,0.0030059123,0.14868253],"study_design_scores_gemma":[0.000017161543,0.000037230202,0.00009028826,0.0000063570174,0.000017169416,0.00003299624,0.0000037795703,0.9961553,0.0011006219,0.0013642621,0.001168408,0.000006324195],"about_ca_topic_score_codex":0.002236996,"about_ca_topic_score_gemma":0.0022293695,"teacher_disagreement_score":0.0025949837,"about_ca_system_score_codex":0.0004491221,"about_ca_system_score_gemma":0.00063476764,"threshold_uncertainty_score":0.008681059},"labels":[],"label_agreement":null},{"id":"W2626465488","doi":"10.1007/s11750-017-0452-5","title":"Rejoinder on: On learning and branching: a survey","year":2017,"lang":"en","type":"article","venue":"Top","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branching (polymer chemistry); Computer science; Mathematical economics; Mathematics; Chemistry","score_opus":0.062619957460186,"score_gpt":0.3566546196720717,"score_spread":0.2940346622118857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626465488","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007930438,0.25081933,0.67771024,0.009391351,0.001898302,0.000121429985,0.00035036477,0.0012943726,0.050484184],"genre_scores_gemma":[0.12717165,0.2045265,0.62425673,0.005273104,0.006893762,0.00033063398,0.0014631909,0.002277618,0.027806869],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973182,0.0007915945,0.00017634669,0.0006200815,0.000866097,0.00022770432],"domain_scores_gemma":[0.99172145,0.0057968805,0.0002446569,0.0011033342,0.0008292477,0.0003045301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003903744,0.0018182988,0.003399865,0.0028694062,0.001562083,0.0062079667,0.0044306046,0.0029277604,0.013187001],"category_scores_gemma":[0.014518056,0.0009297547,0.0015340158,0.008966528,0.0028501456,0.009970298,0.004167948,0.0063134367,0.004667537],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637111,0.00019571064,0.001183862,0.0015418207,0.00008992303,0.00005511251,0.000342102,0.026529338,0.00054911023,0.22223279,0.03786782,0.7092661],"study_design_scores_gemma":[0.00007453006,0.00019556053,0.00066399353,0.0014444124,0.00015648497,0.00039210852,0.00030228117,0.11252376,0.0018904434,0.57815033,0.3041348,0.000071329414],"about_ca_topic_score_codex":0.0031163977,"about_ca_topic_score_gemma":0.003264756,"teacher_disagreement_score":0.013187001,"about_ca_system_score_codex":0.002057299,"about_ca_system_score_gemma":0.0027768645,"threshold_uncertainty_score":0.044114888},"labels":[],"label_agreement":null},{"id":"W2716434414","doi":"10.1109/ccece.2017.7946758","title":"Comparative strategies for knowledge migration in Multi Objective Optimization Problems","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Benchmark (surveying); Premature convergence; Population; Convergence (economics); Context (archaeology); Diversity (politics); Negotiation; Local optimum; Management science; Artificial intelligence; Mathematical optimization; Operations research; Machine learning; Particle swarm optimization; Geography; Economics; Mathematics; Sociology; Economic growth","score_opus":0.13882465547835723,"score_gpt":0.3944310061601637,"score_spread":0.2556063506818065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2716434414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13427685,0.0059977574,0.8259484,0.0009901426,0.00018774103,0.00040532535,0.0000620878,0.00016367725,0.031967934],"genre_scores_gemma":[0.84581083,0.0014130858,0.14835456,0.00014179299,0.000040516967,0.00034148444,0.00006479454,0.00003446152,0.0037984026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987556,0.0007327025,0.000057452562,0.00008150997,0.0002941595,0.00007846643],"domain_scores_gemma":[0.99813783,0.0013428645,0.0001726691,0.000064465996,0.00019424579,0.000087931905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030437706,0.0010129397,0.0008743897,0.0018319008,0.0007587575,0.0016570379,0.0014291437,0.0016103312,0.0020723785],"category_scores_gemma":[0.007584484,0.0003316667,0.00075318664,0.0010943459,0.0009402498,0.0016723315,0.0012013173,0.00071529654,0.00021573291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017256166,0.00014403486,0.001452632,0.00033686808,0.0001688344,0.00023294437,0.00032858268,0.8284411,0.0018536414,0.07962525,0.0010506501,0.08619288],"study_design_scores_gemma":[0.000034363173,0.00031482082,0.00047151957,0.000094058305,0.000054330347,0.00013864627,0.0001338222,0.9769835,0.0008320676,0.018234223,0.0026898114,0.000018804809],"about_ca_topic_score_codex":0.001973729,"about_ca_topic_score_gemma":0.0015438705,"teacher_disagreement_score":0.0030437706,"about_ca_system_score_codex":0.0014634549,"about_ca_system_score_gemma":0.0010940941,"threshold_uncertainty_score":0.016097188},"labels":[],"label_agreement":null},{"id":"W2724857582","doi":"10.1109/cec.2017.7969333","title":"Optimal parameter regions for particle swarm optimization algorithms","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Benchmark (surveying); Particle swarm optimization; Mathematical optimization; Computer science; Parameter space; Network topology; Neighbourhood (mathematics); Set (abstract data type); Algorithm; Multi-swarm optimization; Mathematics; Statistics","score_opus":0.07439562715932886,"score_gpt":0.34799736460180053,"score_spread":0.2736017374424717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724857582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010045823,0.0020499732,0.977809,0.00029932364,0.00005696746,0.00011839546,0.000115178,0.0003576287,0.00914775],"genre_scores_gemma":[0.52172446,0.002640231,0.46947432,0.0002699047,0.00016122572,0.0011043593,0.00059398153,0.00047490158,0.0035566434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986499,0.00073047617,0.00007175663,0.00016324187,0.00030810136,0.00007653773],"domain_scores_gemma":[0.9959901,0.0029887322,0.0003258744,0.00022057524,0.000413275,0.000061391656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035251402,0.0014742814,0.0013424392,0.0018198382,0.00062988704,0.0021614537,0.0014815214,0.0016668688,0.0031290639],"category_scores_gemma":[0.017986497,0.00082794385,0.0010946227,0.0010577469,0.0016197984,0.0018595913,0.0018712512,0.0019474493,0.0010592312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004877227,0.000021076634,0.00033219272,0.000109590255,0.000033015134,0.00003398148,0.00008332553,0.9471549,0.00047534134,0.031589087,0.00081553846,0.019303162],"study_design_scores_gemma":[0.000016910832,0.00003021587,0.00012085978,0.00006001909,0.000012211737,0.000021642178,0.000027008386,0.9678628,0.00042725302,0.0294776,0.001932139,0.000011362862],"about_ca_topic_score_codex":0.0026712143,"about_ca_topic_score_gemma":0.0012029341,"teacher_disagreement_score":0.0035251402,"about_ca_system_score_codex":0.0010959348,"about_ca_system_score_gemma":0.0011385422,"threshold_uncertainty_score":0.018642962},"labels":[],"label_agreement":null},{"id":"W2726889624","doi":"10.1109/cec.2017.7969373","title":"Schematic study on interaction and imbalance effects of variables for Large-Scale Optimization","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Computer science; Feature (linguistics); Set (abstract data type); Variable (mathematics); Scale (ratio); Range (aeronautics); Class (philosophy); Artificial intelligence; Mathematical optimization; Machine learning; Mathematics; Engineering","score_opus":0.02319838527638896,"score_gpt":0.3350724411407125,"score_spread":0.31187405586432354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726889624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12148968,0.0021897366,0.86137587,0.00088316185,0.00015602855,0.00016468414,0.00009316588,0.00028767643,0.0133600915],"genre_scores_gemma":[0.8792862,0.0008038858,0.11727203,0.00017845262,0.000113115086,0.00018858568,0.0001444886,0.00008235335,0.0019308272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998288,0.00076731446,0.00006342998,0.0002243125,0.000505516,0.00015140184],"domain_scores_gemma":[0.99540246,0.0033506518,0.00037371845,0.0003576562,0.00040123358,0.00011430588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029091323,0.00091961765,0.00072706136,0.00083498686,0.000698452,0.001217095,0.00089380366,0.0005463819,0.0022656044],"category_scores_gemma":[0.009436146,0.00023712876,0.00079703104,0.0013297411,0.0008371654,0.0018883286,0.0012415164,0.0016034906,0.00016462407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026389284,0.00020363607,0.0070744776,0.00027102776,0.00011089803,0.00026756205,0.00013236984,0.8340473,0.006383187,0.05842558,0.001675635,0.09114441],"study_design_scores_gemma":[0.000013890884,0.00009620416,0.0013444332,0.000016126007,0.000028704239,0.000059562106,0.000047062622,0.97639436,0.0016444221,0.018476695,0.0018709538,0.000007644144],"about_ca_topic_score_codex":0.0014798562,"about_ca_topic_score_gemma":0.0010313734,"teacher_disagreement_score":0.0029091323,"about_ca_system_score_codex":0.0006404366,"about_ca_system_score_gemma":0.0007840134,"threshold_uncertainty_score":0.015385151},"labels":[],"label_agreement":null},{"id":"W2727779323","doi":"10.1145/3071178.3071294","title":"Reconsidering constraint release for active-set evolution strategies","year":2017,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Set (abstract data type); Computer science; Constraint (computer-aided design); Mathematics; Programming language","score_opus":0.07974443942710047,"score_gpt":0.2980548241210974,"score_spread":0.21831038469399694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727779323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040740263,0.00032325115,0.9508663,0.0009414495,0.00009751285,0.00012453733,0.000020434385,0.00020241603,0.006683891],"genre_scores_gemma":[0.73915297,0.00037710043,0.25604922,0.00045567058,0.00009996904,0.00032345703,0.000049931416,0.00018837272,0.003303194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842924,0.0007346325,0.000099161385,0.00016301122,0.00041973862,0.00015419173],"domain_scores_gemma":[0.9915537,0.0063642366,0.00046678635,0.0006644655,0.00065627287,0.00029449732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035600183,0.00087645766,0.0010088874,0.00042439057,0.00062941655,0.0019578163,0.0025805668,0.0021679683,0.0025658181],"category_scores_gemma":[0.017060783,0.00043171464,0.00069759483,0.00041115828,0.0016067863,0.0028427327,0.0017609624,0.0028739392,0.00042150842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031718292,0.0003017135,0.0015545039,0.00025039684,0.00013471606,0.0006226077,0.0007273311,0.6664581,0.01516117,0.2268787,0.0016617001,0.08593191],"study_design_scores_gemma":[0.00004341773,0.00012995423,0.00008311345,0.00003239688,0.000017909062,0.00006401023,0.000035639663,0.97065485,0.0031192615,0.023756646,0.002044313,0.000018524916],"about_ca_topic_score_codex":0.0010247784,"about_ca_topic_score_gemma":0.0010140332,"teacher_disagreement_score":0.0035600183,"about_ca_system_score_codex":0.00055278285,"about_ca_system_score_gemma":0.0011960433,"threshold_uncertainty_score":0.018827438},"labels":[],"label_agreement":null},{"id":"W2729624476","doi":"10.1109/cec.2017.7969582","title":"Analyzing effects of ordering vectors in mutation schemes on performance of Differential Evolution","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Mutation; Benchmark (surveying); Differential evolution; Evolutionary algorithm; Computer science; Algorithm; Monte Carlo method; Mathematical optimization; Population; Mathematics; Closeness; Scheme (mathematics); Statistics","score_opus":0.013935486590853162,"score_gpt":0.2830008049415279,"score_spread":0.26906531835067476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729624476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92742443,0.0011931342,0.06801728,0.00019141156,0.000058302336,0.000060233415,0.00006227821,0.00018487056,0.002808027],"genre_scores_gemma":[0.988513,0.00017688822,0.0110375015,0.000014415477,0.000003884131,0.000015948812,0.00004113008,0.000013222395,0.00018404081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985037,0.00051731354,0.00013225159,0.0001624823,0.0004841434,0.00020022158],"domain_scores_gemma":[0.9868356,0.010058806,0.00090894336,0.00083466776,0.0011438067,0.00021822128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026744544,0.0006920413,0.00048255202,0.0010653356,0.000305422,0.0007038205,0.00050657266,0.00065028766,0.00045614195],"category_scores_gemma":[0.015714016,0.00020451003,0.00032142736,0.0007826239,0.0005317027,0.0009116017,0.00042467608,0.00055411115,0.00007205961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005936823,0.0002461619,0.011803219,0.00017609216,0.00010432329,0.0001433849,0.0001009115,0.89979416,0.026746288,0.0038461057,0.00030340475,0.0561424],"study_design_scores_gemma":[0.00003778181,0.00056164153,0.004054812,0.0000176382,0.00005332196,0.00008218659,0.000036858335,0.97266364,0.021309303,0.0008239959,0.0003336146,0.000025211279],"about_ca_topic_score_codex":0.0019361796,"about_ca_topic_score_gemma":0.0013028478,"teacher_disagreement_score":0.0026744544,"about_ca_system_score_codex":0.0006956327,"about_ca_system_score_gemma":0.00049017987,"threshold_uncertainty_score":0.014144063},"labels":[],"label_agreement":null},{"id":"W2733295096","doi":"","title":"Topological Order Based Planner for Solving POMDPs","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Domain (mathematical analysis); Computer science; Exploit; Topology (electrical circuits); Planner; Partially observable Markov decision process; Space (punctuation); Focus (optics); Point (geometry); Order (exchange); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Markov chain; Machine learning; Geometry","score_opus":0.02806009940555429,"score_gpt":0.2753866726496715,"score_spread":0.2473265732441172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733295096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07703776,0.0005670583,0.8865042,0.0008625843,0.0001904426,0.0005237294,0.0014572798,0.00512356,0.027733315],"genre_scores_gemma":[0.65444255,0.00028299657,0.33322045,0.00015603997,0.00004485507,0.00080327014,0.0017718704,0.00055478734,0.008723183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896145,0.00032987032,0.00005519119,0.00015431881,0.00036740987,0.00013189194],"domain_scores_gemma":[0.99634874,0.0026354436,0.00015351223,0.00028296246,0.0003709604,0.00020841375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014367083,0.0008386596,0.0009492103,0.0010186965,0.0006517504,0.000999734,0.0013680246,0.0012137878,0.01968751],"category_scores_gemma":[0.0068929857,0.0004093204,0.0007910554,0.0009829341,0.0008323967,0.0013958925,0.0013840813,0.0016571846,0.002043569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006885892,0.00019740399,0.0007842022,0.00047144637,0.000034890727,0.00006963297,0.0001231421,0.85802925,0.0022410965,0.031019337,0.005866076,0.100474976],"study_design_scores_gemma":[0.00010790614,0.00013331175,0.00014844384,0.00002120741,0.000016079477,0.00001897269,0.00003345382,0.9750862,0.0012123303,0.020959232,0.00225205,0.00001086706],"about_ca_topic_score_codex":0.0040380103,"about_ca_topic_score_gemma":0.0066341422,"teacher_disagreement_score":0.01968751,"about_ca_system_score_codex":0.0012302229,"about_ca_system_score_gemma":0.002388287,"threshold_uncertainty_score":0.065861285},"labels":[],"label_agreement":null},{"id":"W2734286001","doi":"10.1609/socs.v8i1.18432","title":"Cost-Based Heuristics and Node Re-Expansions across the Phase Transition","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Heuristics; Heuristic; Mathematical optimization; Node (physics); Operator (biology); Phase transition; Computer science; Incremental heuristic search; Function (biology); Mathematics; Search algorithm; Beam search; Physics; Chemistry","score_opus":0.036317253744548195,"score_gpt":0.33844281529169334,"score_spread":0.30212556154714515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734286001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42336512,0.0014043706,0.55625373,0.0014427206,0.00007272968,0.00024234188,0.000103214465,0.0003467989,0.016768884],"genre_scores_gemma":[0.9006002,0.00035387216,0.09704624,0.0001312071,0.000019860456,0.00014228873,0.000056402307,0.00007553756,0.0015743838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916184,0.00039521192,0.000034610577,0.00008676935,0.00017634981,0.00014509475],"domain_scores_gemma":[0.9897564,0.007915677,0.0011202655,0.000499696,0.00044061945,0.000267329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018693438,0.0004418441,0.0007024616,0.0010445849,0.00056886754,0.0011657804,0.0009268012,0.0007588663,0.0025694794],"category_scores_gemma":[0.013266226,0.00040859779,0.0004906537,0.0007611898,0.0012538215,0.0021773963,0.0009877661,0.0010928613,0.00018833592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028739334,0.00022732039,0.0029578258,0.0001914235,0.00006457775,0.0001744454,0.00024203553,0.8175314,0.0050507914,0.11812999,0.0012251607,0.05391764],"study_design_scores_gemma":[0.000052113726,0.00020538874,0.0010603047,0.00004453406,0.00002710807,0.00008132347,0.00013219377,0.9171847,0.002483991,0.07707799,0.0016333743,0.000016912994],"about_ca_topic_score_codex":0.0013630255,"about_ca_topic_score_gemma":0.0021402948,"teacher_disagreement_score":0.0025694794,"about_ca_system_score_codex":0.0010261969,"about_ca_system_score_gemma":0.0011205294,"threshold_uncertainty_score":0.009886205},"labels":[],"label_agreement":null},{"id":"W2737764623","doi":"10.5539/mas.v11n8p98","title":"Polar Particle Swarm Algorithm for Solving Cloud Data Migration Optimization Problem","year":2017,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maxima and minima; Particle swarm optimization; Algorithm; Computer science; Node (physics); Benchmark (surveying); Cloud computing; Mathematical optimization; Set (abstract data type); Metaheuristic; Swarm behaviour; Mathematics","score_opus":0.06585642420768888,"score_gpt":0.327663178659391,"score_spread":0.2618067544517021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737764623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011430545,0.00065964786,0.98188466,0.0002294413,0.00010850698,0.000067647015,0.000044518903,0.00018909991,0.00538594],"genre_scores_gemma":[0.49989423,0.001998139,0.49027902,0.00022979236,0.0001446584,0.00041829605,0.00037510085,0.00009552942,0.006565341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981326,0.000057538313,0.000012043411,0.000031775373,0.00006321638,0.000022243285],"domain_scores_gemma":[0.9998437,0.000064007065,0.00002287291,0.000011760487,0.000045683104,0.000011940494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042707252,0.0007972999,0.00067336473,0.00055248523,0.00044821197,0.0007714233,0.00059368555,0.00078143534,0.0014643345],"category_scores_gemma":[0.0008252009,0.00024671367,0.0005478854,0.0008284323,0.00035001372,0.00054369896,0.00063928583,0.00081690465,0.00033822213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008889668,0.00004743585,0.0013541618,0.00018304298,0.000055454584,0.0001128064,0.00007598966,0.88968456,0.0037399468,0.017881699,0.0031193532,0.08365665],"study_design_scores_gemma":[0.00001711034,0.000027203043,0.00014353101,0.000008799739,0.000008521633,0.000027492748,0.000018709095,0.9944125,0.0006977001,0.0024937931,0.0021394554,0.000005314856],"about_ca_topic_score_codex":0.004526545,"about_ca_topic_score_gemma":0.0024052248,"teacher_disagreement_score":0.004526545,"about_ca_system_score_codex":0.0003575309,"about_ca_system_score_gemma":0.0010737808,"threshold_uncertainty_score":0.009000421},"labels":[],"label_agreement":null},{"id":"W2738900493","doi":"10.1016/j.advengsoft.2017.07.002","title":"Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems","year":2017,"lang":"en","type":"article","venue":"Advances in Engineering Software","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4981,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Convergence (economics); Computer science; Swarm behaviour; Pareto principle; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.02226714207504294,"score_gpt":0.28126251541246283,"score_spread":0.2589953733374199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738900493","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006000032,0.00039716813,0.98590416,0.000202611,0.00012776638,0.00006865242,0.000073046394,0.00078793865,0.0064385035],"genre_scores_gemma":[0.15062928,0.0006716617,0.8398271,0.00026493514,0.0001144188,0.0004392186,0.00026219714,0.0003882228,0.0074030086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997389,0.0000730133,0.000012814019,0.000023258488,0.00013683365,0.00001515108],"domain_scores_gemma":[0.99969375,0.00014380355,0.00003120493,0.00003526055,0.000077916375,0.000018012932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057718466,0.0008914983,0.001020917,0.0006318583,0.00038525404,0.0006862427,0.0008949707,0.0012907112,0.0022718809],"category_scores_gemma":[0.0015557018,0.00033071282,0.00063444226,0.0007302326,0.0004125882,0.00051500543,0.00064718205,0.0011355414,0.0009155584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080036814,0.00006386064,0.00038444574,0.00021284832,0.00008384379,0.00009258897,0.00007478644,0.7892789,0.0061220834,0.014219604,0.007664883,0.1817221],"study_design_scores_gemma":[0.000021110478,0.000021401507,0.00004878722,0.000009299189,0.00000973004,0.00001607936,0.000005525657,0.99255615,0.00076425046,0.0026419864,0.0039016267,0.0000040689783],"about_ca_topic_score_codex":0.001748276,"about_ca_topic_score_gemma":0.0018663522,"teacher_disagreement_score":0.0022718809,"about_ca_system_score_codex":0.00038674986,"about_ca_system_score_gemma":0.0007870241,"threshold_uncertainty_score":0.007600248},"labels":[],"label_agreement":null},{"id":"W2745034076","doi":"10.23977/jaip.2017.21001","title":"Comparison of Three Evolutionary Algorithms: PSOA, ACOA and BCOA on Recognition Arabic Characters Problem","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Practice","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; Particle swarm optimization; Metaheuristic; Swarm intelligence; Artificial bee colony algorithm; Meta-optimization; Computer science; Genetic algorithm; Multi-swarm optimization; Parallel metaheuristic; Mathematical optimization; Evolutionary computation; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Machine learning","score_opus":0.18043772774683559,"score_gpt":0.4225814047868751,"score_spread":0.24214367704003953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745034076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20223896,0.0101150805,0.74754024,0.0015563745,0.0005712198,0.00022597858,0.00017367207,0.0012042345,0.036374237],"genre_scores_gemma":[0.6675021,0.0040118545,0.3195486,0.0002906628,0.00012905466,0.00020745078,0.00033627308,0.00014951827,0.007824383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994836,0.00013117128,0.00004853231,0.000074056035,0.00021459132,0.000048043443],"domain_scores_gemma":[0.9991062,0.00040213167,0.00006090951,0.000057716938,0.00033544062,0.00003768845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080191245,0.00071331393,0.00084420835,0.0012272624,0.00059147883,0.0009869556,0.00062133215,0.00093626225,0.0015862022],"category_scores_gemma":[0.0027263474,0.00017359,0.0006081055,0.0013004483,0.00033081693,0.00092528085,0.00038269555,0.0004965755,0.0003081215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039794116,0.00027860657,0.0054664756,0.00054576143,0.00018770645,0.00013578121,0.00014242444,0.29348892,0.0062062405,0.008660797,0.005051695,0.6794377],"study_design_scores_gemma":[0.000052688327,0.00022696059,0.0031222221,0.00005241219,0.00007192512,0.00018755982,0.00011894533,0.9836271,0.0052848887,0.0028184433,0.0044133114,0.0000235286],"about_ca_topic_score_codex":0.006862344,"about_ca_topic_score_gemma":0.004759862,"teacher_disagreement_score":0.006862344,"about_ca_system_score_codex":0.0004110362,"about_ca_system_score_gemma":0.00097340695,"threshold_uncertainty_score":0.0136448145},"labels":[],"label_agreement":null},{"id":"W2745529579","doi":"10.5539/cis.v10n3p60","title":"The Application of Possibility Distribution for Solving Standard Quadratic Optimization Problems","year":2017,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Conestoga College","funders":"","keywords":"Simplex; Computer science; Mathematical optimization; Simplex algorithm; Distribution (mathematics); Applied mathematics; Function (biology); Quadratic equation; Quadratic function; Quadratic form (statistics); Quadratic programming; Set (abstract data type); Optimization problem; Mathematics; Algorithm; Linear programming; Mathematical analysis; Combinatorics","score_opus":0.019187210960543048,"score_gpt":0.30762612544560974,"score_spread":0.2884389144850667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745529579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002531788,0.00023625171,0.99543095,0.00020808737,0.000022967311,0.000020596899,0.0000097664715,0.000037006525,0.0015026048],"genre_scores_gemma":[0.4013242,0.0014676776,0.59225565,0.00024147656,0.00022150853,0.00039892228,0.00013604746,0.00015645278,0.0037981574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979152,0.0010218036,0.000093314266,0.00027876353,0.0005641859,0.00012676236],"domain_scores_gemma":[0.9965249,0.0026796286,0.00014912871,0.00012772075,0.0004358672,0.00008277709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032312586,0.0009546725,0.0011131607,0.0015441865,0.0011399926,0.0016030595,0.0014213278,0.0013355796,0.0030104336],"category_scores_gemma":[0.010049607,0.0005818068,0.0015281207,0.0017487296,0.0019797601,0.0030379882,0.0023226684,0.0028752512,0.00040269265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007300253,0.000054858072,0.00078359613,0.00027548053,0.000080870865,0.0001764463,0.00021910794,0.5671666,0.002091053,0.32781178,0.0021961778,0.09907097],"study_design_scores_gemma":[0.000011610412,0.000027133981,0.000065284374,0.00001761172,0.000008054579,0.000043228803,0.000015682841,0.904952,0.000584838,0.09286054,0.0013998501,0.000014201328],"about_ca_topic_score_codex":0.002398752,"about_ca_topic_score_gemma":0.0012478776,"teacher_disagreement_score":0.0032312586,"about_ca_system_score_codex":0.0011970891,"about_ca_system_score_gemma":0.0015860943,"threshold_uncertainty_score":0.017088711},"labels":[],"label_agreement":null},{"id":"W2746560485","doi":"10.1155/2017/4851493","title":"Self-Adaptive Artificial Bee Colony for Function Optimization","year":2017,"lang":"en","type":"article","venue":"Journal of Control Science and Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Hunan Province; China Scholarship Council; Guizhou Science and Technology Department; National Natural Science Foundation of China","keywords":"Position (finance); Local search (optimization); Mathematical optimization; Population; Global optimization; Artificial bee colony algorithm; Set (abstract data type); Computer science; Function optimization; Artificial intelligence; Mathematics; Genetic algorithm","score_opus":0.017110231790516607,"score_gpt":0.25928566604580516,"score_spread":0.24217543425528856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746560485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076656113,0.0022846637,0.97979397,0.00017042922,0.000117842865,0.000080070764,0.000040618044,0.0005044313,0.009342288],"genre_scores_gemma":[0.31681663,0.003300456,0.66888547,0.0002861038,0.0001414706,0.0005122268,0.00030146394,0.00016644293,0.009589665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996892,0.000069456095,0.000017165048,0.000034158595,0.00017450089,0.000015580083],"domain_scores_gemma":[0.99976057,0.00008058176,0.000025796482,0.000032586337,0.00009196348,0.000008492072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033048433,0.00060638256,0.00072980474,0.00066022534,0.00030674244,0.00052914245,0.00088941195,0.0007701874,0.00167162],"category_scores_gemma":[0.0010570986,0.00016603926,0.00053928787,0.0010794685,0.00030000936,0.00055350043,0.00047554597,0.0008622618,0.0006195744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043733093,0.000115483075,0.0012145968,0.00039152926,0.0001248453,0.00019931053,0.0001065218,0.5024398,0.015645307,0.047847353,0.009403011,0.4224685],"study_design_scores_gemma":[0.000013417964,0.000024338562,0.00019969964,0.000017419881,0.0000117267955,0.000066650755,0.0000066235234,0.9851105,0.0011873954,0.0051798373,0.0081737945,0.000008696251],"about_ca_topic_score_codex":0.0017741219,"about_ca_topic_score_gemma":0.0014717326,"teacher_disagreement_score":0.0017741219,"about_ca_system_score_codex":0.00030101874,"about_ca_system_score_gemma":0.0004402114,"threshold_uncertainty_score":0.005592108},"labels":[],"label_agreement":null},{"id":"W2747118187","doi":"10.1016/j.artint.2017.05.004","title":"MM: A bidirectional search algorithm that is guaranteed to meet in the middle","year":2017,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Incremental heuristic search; Bidirectional search; Beam search; Heuristic; Best-first search; Search algorithm; Algorithm; Computer science; Disjoint sets; Node (physics); Search problem; Depth-first search; Iterative deepening depth-first search; Null-move heuristic; Mathematics; Artificial intelligence","score_opus":0.2313199868634884,"score_gpt":0.3798248892331862,"score_spread":0.1485049023696978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747118187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021785472,0.0005098265,0.9558762,0.00089177646,0.00038836614,0.00017674739,0.00023312261,0.0031787236,0.016959805],"genre_scores_gemma":[0.27133504,0.00028893029,0.70640415,0.0006849403,0.00016887802,0.00069688994,0.0006949221,0.0012372913,0.018489033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889475,0.0003556185,0.000045577985,0.00020074692,0.00028549827,0.00021779507],"domain_scores_gemma":[0.9983438,0.0007417893,0.00014570016,0.00030284302,0.00027271407,0.00019315173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021579065,0.0014513314,0.0016486045,0.0016425467,0.0014659768,0.0018738001,0.0032488233,0.0042607626,0.011465181],"category_scores_gemma":[0.008676331,0.0008623649,0.0011066687,0.0013392989,0.0010739767,0.0027943715,0.005474955,0.002623571,0.0038248708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016557492,0.0004756122,0.0014751973,0.00042699132,0.00016573945,0.00017228341,0.0002721822,0.28270692,0.007821004,0.17430823,0.03723826,0.49328178],"study_design_scores_gemma":[0.00016134999,0.00019754031,0.00012658467,0.000058525882,0.000029303588,0.00007016478,0.00006629271,0.93231845,0.0025987464,0.053788282,0.010553036,0.000031699543],"about_ca_topic_score_codex":0.0028835,"about_ca_topic_score_gemma":0.0031495597,"teacher_disagreement_score":0.011465181,"about_ca_system_score_codex":0.0010893543,"about_ca_system_score_gemma":0.0027993144,"threshold_uncertainty_score":0.038354874},"labels":[],"label_agreement":null},{"id":"W275567961","doi":"","title":"Knowledge Sharing Through Agent Migration with Multi-Population Cultural Algorithm.","year":2013,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Knowledge transfer; Population; Algorithm; Multi-agent system; Knowledge sharing; Space (punctuation); Machine learning; Artificial intelligence; Knowledge management","score_opus":0.12282401886980042,"score_gpt":0.401062454957069,"score_spread":0.27823843608726856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W275567961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051473174,0.0005440635,0.93815935,0.00036044983,0.00010104565,0.00018546841,0.000020965726,0.00030955783,0.008846043],"genre_scores_gemma":[0.62869734,0.00029404982,0.36644667,0.00020538345,0.000052678413,0.00030958134,0.000049447917,0.00005419771,0.0038905635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894065,0.0004798153,0.000042878753,0.0001532852,0.00031810327,0.00006533585],"domain_scores_gemma":[0.9980046,0.0009801907,0.00023281103,0.0004116963,0.00026457538,0.000106107014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017816331,0.00056184246,0.00058875413,0.0009127372,0.0009752333,0.0012958149,0.0017330586,0.0011978494,0.0013556166],"category_scores_gemma":[0.0062254975,0.0002417089,0.00071488315,0.0007041556,0.0010767597,0.0021154708,0.001886497,0.0009331533,0.00029991442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001882509,0.00048994366,0.003570259,0.00025761244,0.00037918033,0.00031205936,0.0013615512,0.48417294,0.015233992,0.07119896,0.002386991,0.42044824],"study_design_scores_gemma":[0.000054029828,0.000160039,0.0004928109,0.000034552413,0.000058534217,0.00017760695,0.00017293039,0.9704756,0.0053077145,0.017360417,0.0056784274,0.000027197428],"about_ca_topic_score_codex":0.001846444,"about_ca_topic_score_gemma":0.0018046251,"teacher_disagreement_score":0.001846444,"about_ca_system_score_codex":0.0007055582,"about_ca_system_score_gemma":0.0008324732,"threshold_uncertainty_score":0.009422243},"labels":[],"label_agreement":null},{"id":"W2755736673","doi":"10.1007/s00500-017-2833-y","title":"Self-feedback differential evolution adapting to fitness landscape characteristics","year":2017,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Science and Technology Planning Project of Guangdong Province; National Natural Science Foundation of China","keywords":"Fitness landscape; Differential evolution; Mathematical optimization; Benchmark (surveying); Local optimum; Evolutionary algorithm; Computer science; Population; Unimodality; Evolutionary computation; Fitness approximation; Convergence (economics); Suite; Fitness function; Mathematics; Genetic algorithm","score_opus":0.022423525962077775,"score_gpt":0.2862679210519532,"score_spread":0.26384439508987545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755736673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40974733,0.0004221363,0.56830186,0.00030471015,0.00017216043,0.000079341466,0.000034387256,0.00043761608,0.020500368],"genre_scores_gemma":[0.97086054,0.000081213,0.025055623,0.00006413294,0.000013581844,0.00003619042,0.00002119724,0.000034407894,0.0038331316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990535,0.000020261852,0.0000037943303,0.00001719898,0.000040587813,0.000012700347],"domain_scores_gemma":[0.9996357,0.00015643843,0.000039114086,0.000044828736,0.0000969784,0.00002693422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003020882,0.00026470306,0.00037257784,0.0003120337,0.0002924167,0.00052587024,0.0007181978,0.0005141133,0.0015422815],"category_scores_gemma":[0.0014482801,0.00015480972,0.00022100995,0.0002821013,0.00036399186,0.00042862786,0.0006897946,0.0003015185,0.00018873501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105180254,0.00016755775,0.0033069686,0.00014296564,0.000085535336,0.00032115835,0.00034994562,0.77537626,0.062357273,0.03545629,0.0017919882,0.1205389],"study_design_scores_gemma":[0.0000099308645,0.000026723219,0.0003160096,0.000003368752,0.0000068584386,0.00004852916,0.000012922148,0.9957948,0.0012255429,0.002016589,0.0005338529,0.0000048808784],"about_ca_topic_score_codex":0.00085278443,"about_ca_topic_score_gemma":0.00087114645,"teacher_disagreement_score":0.0015422815,"about_ca_system_score_codex":0.00040276503,"about_ca_system_score_gemma":0.0002685169,"threshold_uncertainty_score":0.005159378},"labels":[],"label_agreement":null},{"id":"W2760225670","doi":"10.1016/j.swevo.2017.09.010","title":"Opposition based learning: A literature review","year":2017,"lang":"en","type":"review","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":465,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Opposition (politics); Reinforcement learning; Variety (cybernetics); Artificial intelligence; Artificial neural network; Machine learning; Management science; Operations research; Law; Mathematics; Political science","score_opus":0.0812765835477228,"score_gpt":0.39083411779178967,"score_spread":0.30955753424406685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760225670","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021187482,0.9978192,0.0005152286,0.00029767107,0.00015668357,0.000010232389,0.000032766606,0.0000067823084,0.0009495715],"genre_scores_gemma":[0.0015847957,0.9967925,0.00089026114,0.00018522247,0.00020192737,0.000012645628,0.00004114722,0.0000028075397,0.00028883576],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99960643,0.0000674464,0.00008836911,0.00007932106,0.00013591403,0.000022465061],"domain_scores_gemma":[0.99821496,0.0012359819,0.00016342697,0.000028394094,0.00030511047,0.000052211388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009942453,0.00088803,0.0016372256,0.0041364306,0.00031979362,0.0021026065,0.0010417114,0.0013111127,0.0043315226],"category_scores_gemma":[0.0032308486,0.00036903968,0.00074533647,0.0068873125,0.00057267153,0.0021710063,0.0008037086,0.0010734214,0.001105553],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085208034,0.000116751144,0.00046377216,0.054617666,0.00015752441,0.00016177756,0.00008275391,0.0009294026,0.00061510655,0.0044981944,0.017503064,0.9207688],"study_design_scores_gemma":[0.000068082176,0.00025612232,0.0029595415,0.049514737,0.0013913951,0.0022991009,0.00042962196,0.0016100602,0.0009459555,0.009816876,0.930598,0.00011038862],"about_ca_topic_score_codex":0.0018009406,"about_ca_topic_score_gemma":0.0030303118,"teacher_disagreement_score":0.0043315226,"about_ca_system_score_codex":0.0006547559,"about_ca_system_score_gemma":0.0025139626,"threshold_uncertainty_score":0.014490426},"labels":[],"label_agreement":null},{"id":"W2761792028","doi":"10.3390/e19100533","title":"Cross Entropy Method Based Hybridization of Dynamic Group Optimization Algorithm","year":2017,"lang":"en","type":"article","venue":"Entropy","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Universidade de Macau","keywords":"Algorithm; Group (periodic table); Mathematics; Optimization algorithm; Entropy (arrow of time); Computer science; Mathematical optimization; Physics; Thermodynamics","score_opus":0.016868376212537336,"score_gpt":0.34071398765853517,"score_spread":0.3238456114459978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761792028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030033791,0.0002972476,0.9642547,0.00010686066,0.000072307535,0.00004820424,0.0000144961095,0.00029197268,0.004880489],"genre_scores_gemma":[0.68702465,0.00027887986,0.3062125,0.00021707651,0.0000863064,0.0002863697,0.00012577763,0.000113144015,0.0056552184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931717,0.00019224954,0.000036538175,0.00012185724,0.00027192087,0.000060225473],"domain_scores_gemma":[0.99949646,0.00023141805,0.000051892213,0.000043885684,0.00014554364,0.000030717598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011743858,0.00069454935,0.000908888,0.001069807,0.00048789268,0.00074204884,0.0009714886,0.00087322335,0.0017395772],"category_scores_gemma":[0.0019023174,0.0003132074,0.0006820471,0.0008240466,0.00061458524,0.0009472625,0.0011931509,0.00056907634,0.0002606291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011110312,0.00008674632,0.0013678267,0.0000865603,0.00013047647,0.00011417866,0.00017208546,0.79748195,0.010213546,0.017004134,0.001272953,0.17195846],"study_design_scores_gemma":[0.000009823078,0.000043074804,0.00017010601,0.000003795066,0.00001281678,0.00003140529,0.0000071534023,0.9960377,0.0011485536,0.0017734239,0.0007557964,0.000006336597],"about_ca_topic_score_codex":0.0014091643,"about_ca_topic_score_gemma":0.00091685785,"teacher_disagreement_score":0.0017395772,"about_ca_system_score_codex":0.00056065305,"about_ca_system_score_gemma":0.0006292549,"threshold_uncertainty_score":0.0062108636},"labels":[],"label_agreement":null},{"id":"W2765104507","doi":"10.3390/a10040120","title":"A Comparative Study on Recently-Introduced Nature-Based Global Optimization Methods in Complex Mechanical System Design","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Firefly algorithm; Robustness (evolution); Metaheuristic; Computer science; Multi-objective optimization; Global optimization; Optimization problem; Benchmark (surveying); Cuckoo search; Engineering optimization; Derivative-free optimization; Imperialist competitive algorithm; Mathematics; Meta-optimization; Particle swarm optimization","score_opus":0.14554111394063857,"score_gpt":0.4533124861904382,"score_spread":0.3077713722497996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765104507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07824017,0.018021265,0.88461626,0.00051667966,0.00020723959,0.00008669387,0.0000497154,0.00028468092,0.017977301],"genre_scores_gemma":[0.53523827,0.013042402,0.4449295,0.00025975142,0.00016178878,0.00022429226,0.0001964538,0.00019393353,0.005753576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992175,0.0003221059,0.000043239357,0.00007216873,0.00031874573,0.000026189682],"domain_scores_gemma":[0.9984999,0.0009969444,0.00010860619,0.000115853836,0.00025092033,0.00002791252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016222988,0.00072011055,0.0007217956,0.0010096154,0.00028726598,0.00072727096,0.00059165416,0.00091352116,0.0011079061],"category_scores_gemma":[0.0028377804,0.0002067879,0.00085874024,0.0011846382,0.0005132782,0.000717778,0.00045678508,0.0006948731,0.00022054283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009889183,0.00012303743,0.0026174493,0.00078457576,0.00018401694,0.00010792151,0.00016330431,0.66068447,0.0071053025,0.01746581,0.0013669457,0.3092983],"study_design_scores_gemma":[0.000017792745,0.0002680481,0.0018683235,0.00008841708,0.000057010624,0.00016282874,0.000046623238,0.9809316,0.0044562216,0.0029803424,0.009098624,0.000024152689],"about_ca_topic_score_codex":0.0011003577,"about_ca_topic_score_gemma":0.0015751154,"teacher_disagreement_score":0.0016222988,"about_ca_system_score_codex":0.00037240065,"about_ca_system_score_gemma":0.0005405348,"threshold_uncertainty_score":0.008579671},"labels":[],"label_agreement":null},{"id":"W2765572224","doi":"10.3390/a10040123","title":"A Selection Process for Genetic Algorithm Using Clustering Analysis","year":2017,"lang":"en","type":"article","venue":"Algorithms","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Rimouski; Université du Québec à Chicoutimi","funders":"","keywords":"Cluster analysis; Selection (genetic algorithm); Benchmark (surveying); Fitness function; Population; Genetic algorithm; Computer science; Fitness proportionate selection; Mathematical optimization; Mathematics; Data mining; Artificial intelligence","score_opus":0.06824753057029719,"score_gpt":0.37790900271863154,"score_spread":0.30966147214833434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765572224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026576086,0.000112870024,0.99578875,0.00006127309,0.000023497865,0.00003832222,0.0000069200505,0.00013528434,0.0011756022],"genre_scores_gemma":[0.1239876,0.00034459995,0.8727523,0.00008807522,0.00007335739,0.00020911051,0.00006546875,0.00015215116,0.0023273567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986405,0.0004804228,0.00005572425,0.00019139319,0.0005794016,0.000052537693],"domain_scores_gemma":[0.99919313,0.00041190383,0.000051162235,0.000093124014,0.00022958644,0.00002114397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015020925,0.0005966855,0.0007178263,0.0009879764,0.0007078798,0.0009857477,0.0010463245,0.00090971834,0.0014779866],"category_scores_gemma":[0.0035388463,0.00027454548,0.0007525062,0.0010774836,0.0009568417,0.0009060015,0.00080390467,0.0009970198,0.00051697524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008811665,0.00007223986,0.001047461,0.00017634535,0.00016272273,0.0002034099,0.00032392214,0.46130463,0.01582983,0.13535112,0.0024691666,0.38297102],"study_design_scores_gemma":[0.00001941128,0.00005580405,0.00024859046,0.00002221822,0.000026548905,0.000079695994,0.000019320174,0.97343135,0.0038639358,0.016704002,0.005509152,0.000019873063],"about_ca_topic_score_codex":0.0015269876,"about_ca_topic_score_gemma":0.0012967897,"teacher_disagreement_score":0.0015269876,"about_ca_system_score_codex":0.00068585144,"about_ca_system_score_gemma":0.00086380536,"threshold_uncertainty_score":0.007943928},"labels":[],"label_agreement":null},{"id":"W2770783293","doi":"10.1007/s11721-017-0150-9","title":"Self-adaptive particle swarm optimization: a review and analysis of convergence","year":2017,"lang":"en","type":"review","venue":"Swarm Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":144,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Particle swarm optimization; Computer science; Flocking (texture); A priori and a posteriori; Mathematical optimization; Convergence (economics); Population; Swarm behaviour; Multi-swarm optimization; Algorithm; Mathematics","score_opus":0.15445702536842004,"score_gpt":0.41579937633606756,"score_spread":0.2613423509676475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770783293","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093294744,0.98053414,0.0143186785,0.00058059016,0.0003554232,0.00002974849,0.00003816053,0.000041536558,0.0031686863],"genre_scores_gemma":[0.011215327,0.97395825,0.012871657,0.00029948252,0.0005977519,0.00005028782,0.0000781109,0.000019934365,0.0009091643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994067,0.000114752016,0.00008968136,0.00009545466,0.00026434718,0.000029000408],"domain_scores_gemma":[0.9983797,0.0009877644,0.00013238848,0.00006442483,0.00039683207,0.000038985112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015444675,0.0010504824,0.0017807372,0.0020450582,0.00033097368,0.0017561092,0.0016081462,0.0014224898,0.0023810372],"category_scores_gemma":[0.003732527,0.00040530477,0.00080291985,0.0043227524,0.000706201,0.0018650256,0.0010571174,0.0012170137,0.001092434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000598217,0.000081288876,0.0004518304,0.01276774,0.00012392366,0.000071526025,0.000062851184,0.006563284,0.0010042347,0.010284235,0.00867842,0.95985085],"study_design_scores_gemma":[0.000084950705,0.0007608062,0.0031594594,0.011565141,0.0009212254,0.0018828554,0.00028662145,0.044572785,0.006139386,0.032957364,0.8974964,0.00017311376],"about_ca_topic_score_codex":0.0015581792,"about_ca_topic_score_gemma":0.0013462899,"teacher_disagreement_score":0.0023810372,"about_ca_system_score_codex":0.0006178451,"about_ca_system_score_gemma":0.0017332945,"threshold_uncertainty_score":0.008167982},"labels":[],"label_agreement":null},{"id":"W2772539238","doi":"10.1109/smc.2017.8122931","title":"Improving firefly algorithm performance using fuzzy logic","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Firefly algorithm; Benchmark (surveying); Fuzzy logic; Firefly protocol; Mathematical optimization; Computer science; Set (abstract data type); Algorithm; Mathematics; Artificial intelligence; Particle swarm optimization","score_opus":0.06505188777408158,"score_gpt":0.3275452574985629,"score_spread":0.26249336972448134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772539238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13285138,0.0012380597,0.8528401,0.00037826414,0.00018585823,0.00009054803,0.00003467674,0.001273667,0.011107389],"genre_scores_gemma":[0.69395214,0.0005824853,0.30263716,0.00012219234,0.00004746733,0.000060835206,0.000049981383,0.00008259673,0.002465114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953544,0.000082870305,0.000027686403,0.000058413512,0.00023903356,0.000056621775],"domain_scores_gemma":[0.9994399,0.0002541324,0.000048108144,0.000048098602,0.00018709441,0.000022690829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904592,0.0006030299,0.00063418166,0.000850834,0.0005694645,0.0007078798,0.00082371064,0.000837597,0.0010083613],"category_scores_gemma":[0.002186603,0.00018037096,0.00042297677,0.0005322752,0.0003327895,0.0009688451,0.00045686457,0.0006468361,0.00023163695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031453808,0.0002559476,0.0026372834,0.00020459168,0.00009323513,0.00017795757,0.0002145436,0.551542,0.049429122,0.01276875,0.0029337655,0.3794283],"study_design_scores_gemma":[0.000031264095,0.00007759945,0.00037093426,0.000009069557,0.00001828798,0.000047925638,0.000009503001,0.9864052,0.010543164,0.0010403055,0.0014318689,0.000014915784],"about_ca_topic_score_codex":0.0045213974,"about_ca_topic_score_gemma":0.0027260142,"teacher_disagreement_score":0.0045213974,"about_ca_system_score_codex":0.00067753025,"about_ca_system_score_gemma":0.00080404495,"threshold_uncertainty_score":0.008990169},"labels":[],"label_agreement":null},{"id":"W2775992423","doi":"10.5539/mas.v12n1p32","title":"Supernova Optimizer: A Novel Natural Inspired Meta-Heuristic","year":2017,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Metaheuristic; Particle swarm optimization; Mathematical optimization; Multi-swarm optimization; Derivative-free optimization; Benchmark (surveying); Maxima and minima; Optimization problem; Heuristic; Meta-optimization; Convergence (economics); Swarm intelligence; Algorithm; Artificial intelligence; Mathematics","score_opus":0.07607040322973167,"score_gpt":0.316116814479459,"score_spread":0.2400464112497273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775992423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029214507,0.0043693273,0.9496484,0.00037723582,0.0002667838,0.00021404041,0.0002011134,0.0007992734,0.014909334],"genre_scores_gemma":[0.37907383,0.0033793729,0.60765815,0.0003363109,0.00014920962,0.0006230903,0.00058747776,0.00028149816,0.007911072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997193,0.00008795833,0.00002064391,0.00004134742,0.00010250521,0.000028195764],"domain_scores_gemma":[0.9998118,0.000073811956,0.000033752185,0.000020247035,0.000043906566,0.000016495484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006242242,0.0008140101,0.0010499251,0.00093861984,0.00042565344,0.0009825091,0.0012643015,0.0010041681,0.001468984],"category_scores_gemma":[0.0008019453,0.00034900612,0.0013375386,0.0009996855,0.00047517847,0.00062553654,0.0006758245,0.00078293163,0.00036094067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009069655,0.00007984394,0.0017208145,0.00036201547,0.00029910845,0.00016573882,0.00007011789,0.8582099,0.00579527,0.023093259,0.0031482684,0.10696492],"study_design_scores_gemma":[0.00004695157,0.00011452111,0.0003218223,0.000044851302,0.00006085361,0.0001196774,0.000020505558,0.9802184,0.0017948453,0.005242059,0.011997442,0.00001817047],"about_ca_topic_score_codex":0.0029422503,"about_ca_topic_score_gemma":0.0027280787,"teacher_disagreement_score":0.0029422503,"about_ca_system_score_codex":0.0005439991,"about_ca_system_score_gemma":0.0013887897,"threshold_uncertainty_score":0.0058502555},"labels":[],"label_agreement":null},{"id":"W2779495064","doi":"10.5539/mas.v12n1p148","title":"Movement Particle Swarm Optimization Algorithm","year":2017,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Metaheuristic; Maxima and minima; Benchmark (surveying); Mathematical optimization; Derivative-free optimization; Algorithm; Trigonometric functions; Computer science; Firefly algorithm; Heuristic; Sine; Optimization problem; Meta-optimization; Meta heuristic; Mathematics","score_opus":0.029166827466259485,"score_gpt":0.29766299813020297,"score_spread":0.2684961706639435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779495064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006319969,0.0023542948,0.9600542,0.0005729744,0.00041146533,0.00029661224,0.0002881128,0.0013715277,0.02833089],"genre_scores_gemma":[0.30773056,0.0056909104,0.636039,0.000770958,0.0003667015,0.0011558092,0.0018173393,0.00037863472,0.046050087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942315,0.00013767711,0.00004023595,0.00011528909,0.00023517135,0.000048434413],"domain_scores_gemma":[0.99965453,0.00011680579,0.00005076293,0.00004653721,0.000112599824,0.000018720108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006027966,0.0009549305,0.0013122346,0.00066374603,0.0006937459,0.0015399313,0.0012185212,0.0013246036,0.0053247446],"category_scores_gemma":[0.0015098217,0.00030490095,0.0008604205,0.00097198394,0.0004925383,0.0010178825,0.0011778858,0.001190808,0.0023589197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014328845,0.00015233859,0.0023477757,0.0006670106,0.00022188274,0.00028133288,0.00014548788,0.46674716,0.009318005,0.05738345,0.025719587,0.43687263],"study_design_scores_gemma":[0.00008533603,0.00015202684,0.00087901053,0.00009904621,0.00007396248,0.00028020958,0.000060899558,0.8768886,0.0036156734,0.02032573,0.09749284,0.00004671932],"about_ca_topic_score_codex":0.003738241,"about_ca_topic_score_gemma":0.0017767585,"teacher_disagreement_score":0.0053247446,"about_ca_system_score_codex":0.00054800475,"about_ca_system_score_gemma":0.0013089753,"threshold_uncertainty_score":0.017813087},"labels":[],"label_agreement":null},{"id":"W2782154123","doi":"10.5539/cis.v11n1p26","title":"Enhanced Firefly Algorithm Using Fuzzy Parameter Tuner","year":2018,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Firefly algorithm; Metaheuristic; Computer science; Algorithm; Benchmark (surveying); Firefly protocol; Mathematical optimization; Fuzzy logic; Artificial intelligence; Mathematics","score_opus":0.028264744141957353,"score_gpt":0.3069744063316145,"score_spread":0.27870966218965715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782154123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033858057,0.0005673427,0.95883197,0.00015916352,0.0000963661,0.00009059373,0.000047532023,0.00085181545,0.0054971436],"genre_scores_gemma":[0.49794823,0.00045672135,0.49483705,0.00017375524,0.000065406,0.00022342755,0.0001311916,0.0001002011,0.006064003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968255,0.00005811864,0.000019137402,0.000054391196,0.00014596137,0.00003974092],"domain_scores_gemma":[0.9997409,0.00008680863,0.0000337264,0.00003482149,0.00008852837,0.000015156226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006005945,0.00066886295,0.0009789417,0.0007483285,0.00057144725,0.00059986394,0.0013166657,0.0012254623,0.0013814245],"category_scores_gemma":[0.0010874055,0.00027347438,0.00071949593,0.0005714796,0.00038249936,0.00087710045,0.00052696303,0.0007953744,0.00036681487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025402737,0.00017404383,0.0015135207,0.0002024041,0.00012438779,0.00019933416,0.00022259272,0.64119923,0.044241894,0.016137388,0.0037781498,0.29195303],"study_design_scores_gemma":[0.000060399867,0.00007883144,0.00032603284,0.000009952335,0.000026045183,0.00011129977,0.000011098449,0.9876672,0.006489323,0.0020018835,0.003192596,0.000025297188],"about_ca_topic_score_codex":0.0035718207,"about_ca_topic_score_gemma":0.0023482924,"teacher_disagreement_score":0.0035718207,"about_ca_system_score_codex":0.0005894422,"about_ca_system_score_gemma":0.00075043016,"threshold_uncertainty_score":0.0071020126},"labels":[],"label_agreement":null},{"id":"W2782645119","doi":"10.1016/j.swevo.2018.01.006","title":"Optimal parameter regions and the time-dependence of control parameter values for the particle swarm optimization algorithm","year":2018,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation, United Arab Emirates; National Research Foundation","keywords":"Benchmark (surveying); Particle swarm optimization; Acceleration; Computer science; Parameter space; Mathematical optimization; Set (abstract data type); Swarm behaviour; Algorithm; Mathematics; Statistics","score_opus":0.01850253828105613,"score_gpt":0.2757660492307485,"score_spread":0.25726351094969235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782645119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16838256,0.0015875216,0.81270266,0.0010050329,0.000069993956,0.000076101074,0.00008215737,0.000178497,0.01591542],"genre_scores_gemma":[0.9489261,0.00055546465,0.048299227,0.00008371255,0.000035452445,0.00009401586,0.00006638351,0.00011841805,0.0018213165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996635,0.00017274873,0.000013364596,0.000037294387,0.00007888463,0.00003427996],"domain_scores_gemma":[0.9952043,0.0039447066,0.00026133982,0.0001469818,0.00037443184,0.000068225105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002879776,0.00060505094,0.00053305656,0.0008710424,0.0005228118,0.0013043123,0.0006146453,0.0010614344,0.001208936],"category_scores_gemma":[0.017997684,0.00065886194,0.00047894192,0.0004506821,0.0014810644,0.0015740172,0.00082704495,0.0010109397,0.00017480482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001212608,0.000020942485,0.00039626972,0.000048171274,0.000015605194,0.00004294034,0.00011570797,0.9673058,0.0018426621,0.022911685,0.000290377,0.006888698],"study_design_scores_gemma":[0.000009004475,0.000017503942,0.00020938039,0.000011937686,0.0000067760816,0.000008211728,0.000011150932,0.9928148,0.0005581382,0.0061760745,0.0001697912,0.0000072661464],"about_ca_topic_score_codex":0.003873004,"about_ca_topic_score_gemma":0.0016485183,"teacher_disagreement_score":0.003873004,"about_ca_system_score_codex":0.00071337406,"about_ca_system_score_gemma":0.00081830897,"threshold_uncertainty_score":0.01522994},"labels":[],"label_agreement":null},{"id":"W2785532129","doi":"10.1109/ssci.2017.8285170","title":"Differential evolution with self-adaptive mutation scaling factor","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Crossover; Benchmark (surveying); Differential evolution; Mutation; Adaptive mutation; Evolutionary algorithm; Mathematical optimization; Computer science; Scaling; Evolutionary computation; Factor (programming language); Algorithm; Mathematics; Genetic algorithm; Artificial intelligence","score_opus":0.026464571282159826,"score_gpt":0.28347648962304134,"score_spread":0.2570119183408815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785532129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03303037,0.00085578265,0.957878,0.00016086015,0.00013426968,0.00011264891,0.000027602984,0.00032549043,0.007474944],"genre_scores_gemma":[0.7125552,0.00083775667,0.27930048,0.00012280115,0.00006081986,0.0003297707,0.00006804178,0.000044891753,0.0066801854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997069,0.00006945758,0.000020038155,0.00005536459,0.00012758416,0.00002051442],"domain_scores_gemma":[0.9996729,0.00012579236,0.000042427902,0.00003939549,0.00010513593,0.000014344942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005621023,0.00052540976,0.0007887122,0.00044943066,0.00028127225,0.000521827,0.0009867807,0.0006312245,0.0009353773],"category_scores_gemma":[0.0015427984,0.00019051593,0.00047827789,0.00055063894,0.0004395866,0.0004889416,0.0005471013,0.00055855524,0.0002135884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007274506,0.00009170073,0.0021730873,0.0002015194,0.000107094864,0.00038264794,0.00017560113,0.7190374,0.029083489,0.04784424,0.0018891481,0.19894138],"study_design_scores_gemma":[0.000023747236,0.000055428336,0.000304637,0.000009496507,0.00001588,0.00013901551,0.000007421528,0.99073654,0.0027320955,0.0025852248,0.0033785591,0.000011928192],"about_ca_topic_score_codex":0.000992002,"about_ca_topic_score_gemma":0.0006832409,"teacher_disagreement_score":0.000992002,"about_ca_system_score_codex":0.0004052642,"about_ca_system_score_gemma":0.00032883842,"threshold_uncertainty_score":0.0031291246},"labels":[],"label_agreement":null},{"id":"W2785593625","doi":"10.1109/ssci.2017.8285208","title":"Particle swarm optimization for large-scale clustering on apache spark","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"SPARK (programming language); Cluster analysis; Computer science; Particle swarm optimization; Big data; Data mining; Canopy clustering algorithm; CURE data clustering algorithm; Correlation clustering; Algorithm; Machine learning","score_opus":0.05665801471600643,"score_gpt":0.33550272724398117,"score_spread":0.2788447125279747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785593625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011607738,0.00010832291,0.97822696,0.00020583656,0.00008496,0.00009453815,0.00015222766,0.0035810778,0.005938397],"genre_scores_gemma":[0.22076228,0.00013798886,0.7731828,0.00009782709,0.00003785498,0.00040734635,0.0006249088,0.0008512641,0.0038977636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999432,0.00014910888,0.000034049386,0.0000786929,0.00023715428,0.00006882824],"domain_scores_gemma":[0.9992373,0.0002871655,0.000053416592,0.00009939489,0.00025307896,0.00006960913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010651224,0.00077927916,0.0008939293,0.0004930226,0.0010165583,0.0008494103,0.0015018194,0.00077320513,0.0029031509],"category_scores_gemma":[0.0024025626,0.00043758296,0.0007892302,0.0008564779,0.00048719908,0.0006276811,0.0010097005,0.0010980781,0.0009552326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000957814,0.000075978445,0.0006092288,0.00009192489,0.000056746274,0.00010732493,0.00009467436,0.9379448,0.0024162084,0.015735902,0.0070188204,0.035752602],"study_design_scores_gemma":[0.000020910546,0.000008583652,0.00007339554,0.0000022395934,0.0000027137048,0.000009761464,0.000012744747,0.9938471,0.000670854,0.0035021815,0.0018442031,0.0000053739914],"about_ca_topic_score_codex":0.011354202,"about_ca_topic_score_gemma":0.008574797,"teacher_disagreement_score":0.011354202,"about_ca_system_score_codex":0.0008297339,"about_ca_system_score_gemma":0.0019456752,"threshold_uncertainty_score":0.022576213},"labels":[],"label_agreement":null},{"id":"W2786860463","doi":"10.1109/ssci.2017.8280865","title":"Enhancing discrete differential evolution by conducting election","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Population; Evolutionary algorithm; Benchmark (surveying); Computer science; Voting; Algorithm; Mathematical optimization; Differential evolution; Optimization problem; Artificial intelligence; Mathematics; Law","score_opus":0.03544235075367868,"score_gpt":0.3211389056219243,"score_spread":0.28569655486824563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786860463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04133589,0.000345216,0.94802964,0.00016989591,0.0000746051,0.00007242431,0.000025484616,0.00016332872,0.009783555],"genre_scores_gemma":[0.7537062,0.00044574594,0.24054687,0.00014313962,0.000041997453,0.00020011059,0.00008682735,0.00004567114,0.0047833873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999617,0.00013088489,0.000020006832,0.000054094846,0.00014383985,0.00003420463],"domain_scores_gemma":[0.9994041,0.0003625241,0.00005979152,0.00004828738,0.000100811674,0.000024471972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082320574,0.00041708568,0.0007073622,0.000383197,0.0002550434,0.000706337,0.00074056524,0.00053342764,0.0012016114],"category_scores_gemma":[0.0024312667,0.00018003624,0.00048602436,0.000479608,0.00045797904,0.0005588412,0.00073080487,0.0005444924,0.0001871125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005350174,0.00006946908,0.0013534625,0.00012468116,0.000045754354,0.0001128341,0.000114224604,0.86741936,0.009486297,0.029570434,0.0009256954,0.090724334],"study_design_scores_gemma":[0.000011538446,0.00003194493,0.00012366657,0.000004825856,0.000007895553,0.0000254944,0.0000069979683,0.99510396,0.0011200049,0.0018920002,0.0016676919,0.000003986371],"about_ca_topic_score_codex":0.001333934,"about_ca_topic_score_gemma":0.0010176087,"teacher_disagreement_score":0.001333934,"about_ca_system_score_codex":0.00043801594,"about_ca_system_score_gemma":0.00048284032,"threshold_uncertainty_score":0.0043535233},"labels":[],"label_agreement":null},{"id":"W2786922041","doi":"10.1109/ssci.2017.8280938","title":"Differential evolution with center-based mutation for large-scale optimization","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Differential evolution; Mutation; Crossover; Mathematical optimization; Convergence (economics); Dimension (graph theory); Scheme (mathematics); Computer science; Optimization problem; Algorithm; Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.020182096716315913,"score_gpt":0.2914879912554281,"score_spread":0.2713058945391122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786922041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013890149,0.0004414141,0.9837458,0.00006893123,0.000037175894,0.00004466216,0.00000929838,0.00022045376,0.0015420985],"genre_scores_gemma":[0.5980078,0.000637203,0.39881414,0.00008644635,0.000051162893,0.00027075238,0.000061927305,0.000077128876,0.0019934587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995332,0.000145081,0.00002179248,0.000055540677,0.00021587852,0.000028513266],"domain_scores_gemma":[0.9994306,0.00031349968,0.00006598767,0.000064877386,0.0001032617,0.000021689937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011551495,0.00066585524,0.0008415531,0.0006730744,0.00036779357,0.0004721795,0.0010898681,0.0007376113,0.00064626976],"category_scores_gemma":[0.002027727,0.00027044615,0.0006151379,0.0010284445,0.0008308332,0.0005798559,0.0009210703,0.0008678925,0.0001330219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036786023,0.00004117738,0.0004178602,0.00007869645,0.000054516164,0.00010002665,0.00005344939,0.89608955,0.00768836,0.024540069,0.0005384495,0.07036108],"study_design_scores_gemma":[0.0000079607025,0.000019815803,0.00006110745,0.0000022663216,0.0000049409896,0.000018298573,0.00000190571,0.99624985,0.00083722913,0.002227953,0.00056494155,0.0000036911877],"about_ca_topic_score_codex":0.0016564204,"about_ca_topic_score_gemma":0.0010107051,"teacher_disagreement_score":0.0016564204,"about_ca_system_score_codex":0.0006788795,"about_ca_system_score_gemma":0.0006435249,"threshold_uncertainty_score":0.0061091185},"labels":[],"label_agreement":null},{"id":"W2787282612","doi":"10.1109/ssci.2017.8280800","title":"A sugeno-based search width decay schedule in the ACO&lt;inf&gt;R&lt;/inf&gt; algorithm","year":2017,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Parameterized complexity; Ant colony optimization algorithms; Algorithm; Computer science; Artificial intelligence; Schedule; Mathematics","score_opus":0.0404433890114737,"score_gpt":0.3231557445284848,"score_spread":0.28271235551701107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787282612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031402815,0.00066417735,0.95602566,0.0005198889,0.00018801153,0.00019668258,0.00010065413,0.000624982,0.01027713],"genre_scores_gemma":[0.5217768,0.0005140134,0.4647268,0.0003411372,0.00015724271,0.00048094778,0.00027930172,0.00017288685,0.011550856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992218,0.0002186465,0.0000516325,0.0001957592,0.00022298231,0.00008924751],"domain_scores_gemma":[0.9989374,0.00043540937,0.00010017438,0.00015645444,0.00026603087,0.000104541665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014462844,0.0009218266,0.0015568584,0.0008709706,0.0008493136,0.0011419246,0.002344767,0.0013079398,0.004715817],"category_scores_gemma":[0.004545982,0.00049903226,0.00074501237,0.0010591167,0.0011592022,0.0012784695,0.0010146662,0.0018793306,0.0009823219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003390929,0.00016932393,0.00089644315,0.00017741544,0.000062461164,0.00010260412,0.00015843607,0.7792718,0.0038464002,0.039771736,0.0050512794,0.17015304],"study_design_scores_gemma":[0.00004031645,0.00006738722,0.00011473725,0.000011355846,0.000012787376,0.000017695282,0.00001054225,0.99314636,0.00054052816,0.0049662828,0.0010609482,0.000010988194],"about_ca_topic_score_codex":0.007895487,"about_ca_topic_score_gemma":0.011764785,"teacher_disagreement_score":0.007895487,"about_ca_system_score_codex":0.0012020287,"about_ca_system_score_gemma":0.0030898566,"threshold_uncertainty_score":0.015776038},"labels":[],"label_agreement":null},{"id":"W2789395900","doi":"10.5267/j.dsl.2018.2.001","title":"A new MCDM-based approach using BWM and SAW for optimal search model","year":2018,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multiple-criteria decision analysis; Mathematical optimization; Computer science; Operations research; Mathematics; Management science; Engineering","score_opus":0.09725112470109384,"score_gpt":0.375205683065182,"score_spread":0.2779545583640881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789395900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052641463,0.00029939142,0.9886093,0.00032927436,0.000055261135,0.00014676528,0.00014044082,0.000069764414,0.005085627],"genre_scores_gemma":[0.33122188,0.00081493723,0.661621,0.00017919045,0.00006983212,0.0009265906,0.00039484416,0.00004603813,0.004725749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978415,0.00092977594,0.00014022384,0.00033120613,0.0006088834,0.0001484181],"domain_scores_gemma":[0.99911803,0.00048137092,0.00008103366,0.000036974234,0.0002408456,0.000041754498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002883345,0.00121852,0.0014972757,0.0036363653,0.0009729541,0.0026020752,0.002443575,0.001749369,0.0057529104],"category_scores_gemma":[0.0033499824,0.0006925262,0.0021245677,0.0039282623,0.00084912794,0.001756279,0.0019177756,0.0015530147,0.0003691259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005845189,0.00007521429,0.001145774,0.00046490162,0.00015787987,0.00020227277,0.00019427559,0.85792315,0.0011260695,0.072223954,0.0021207326,0.06430731],"study_design_scores_gemma":[0.000014008188,0.000035503686,0.00014266172,0.000032969845,0.000023732346,0.000036551868,0.000065769585,0.97809213,0.00017989539,0.019511158,0.001852772,0.000012957655],"about_ca_topic_score_codex":0.009703975,"about_ca_topic_score_gemma":0.011164773,"teacher_disagreement_score":0.009703975,"about_ca_system_score_codex":0.0023485816,"about_ca_system_score_gemma":0.0026197645,"threshold_uncertainty_score":0.019294977},"labels":[],"label_agreement":null},{"id":"W2790288482","doi":"10.1093/imaman/dpy002","title":"The alpha male genetic algorithm","year":2018,"lang":"en","type":"article","venue":"IMA Journal of Management Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Alpha (finance); Computer science; Algorithm; Mathematics; Statistics","score_opus":0.01650732607309121,"score_gpt":0.2827583594331851,"score_spread":0.2662510333600939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790288482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015970986,0.0006495321,0.95787835,0.0003515623,0.00018169118,0.00014063645,0.00009754552,0.00065889687,0.024070842],"genre_scores_gemma":[0.3102333,0.0010732356,0.6574818,0.0005274558,0.0002006119,0.0004625505,0.00035774315,0.0002085626,0.029454906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999198,0.00031756074,0.00002824553,0.00011468485,0.00024030553,0.00010125034],"domain_scores_gemma":[0.99923444,0.00031679973,0.00008629873,0.000111305744,0.00019296247,0.000058281592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011571518,0.0007268279,0.00067155715,0.000985502,0.0007200601,0.0011317737,0.0015652886,0.0011781214,0.004759094],"category_scores_gemma":[0.0029070128,0.00029535222,0.0006374053,0.0010321233,0.00078093243,0.00082074857,0.0009641483,0.0010466778,0.0015179052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001696091,0.00016817191,0.0026091156,0.00019525613,0.00013019447,0.0002544685,0.00023653025,0.44746932,0.004276979,0.1292851,0.012761107,0.4024442],"study_design_scores_gemma":[0.000078569734,0.00017671313,0.0005366037,0.000065630695,0.000056383604,0.000312762,0.000054432905,0.91378015,0.0032925662,0.048300333,0.033317838,0.000028039332],"about_ca_topic_score_codex":0.0016914512,"about_ca_topic_score_gemma":0.0014222222,"teacher_disagreement_score":0.004759094,"about_ca_system_score_codex":0.00069035526,"about_ca_system_score_gemma":0.0012447092,"threshold_uncertainty_score":0.015920758},"labels":[],"label_agreement":null},{"id":"W2791361378","doi":"10.1142/s1469026818500025","title":"Focus Group: An Optimization Algorithm Inspired by Human Behavior","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Shahid Rajaee Teacher Training University","keywords":"Computer science; Benchmark (surveying); Evolutionary algorithm; Genetic algorithm; Focus (optics); Mathematical optimization; Algorithm; Optimization problem; Optimization algorithm; Meta-optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03366772749157315,"score_gpt":0.3608316276317359,"score_spread":0.3271639001401627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791361378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008270934,0.00027846257,0.98828083,0.0001374478,0.000052587293,0.00007294786,0.000011723991,0.00021240047,0.002682667],"genre_scores_gemma":[0.22406378,0.00063534896,0.7695914,0.00035791792,0.0001173435,0.0006297352,0.00010100999,0.00015661705,0.0043467814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996835,0.000107868276,0.000011845888,0.000053975178,0.000113347145,0.000029514362],"domain_scores_gemma":[0.9996822,0.00018999672,0.00003925342,0.000022125665,0.00004925196,0.000017236613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009532306,0.000945075,0.0008461483,0.0009015197,0.0007137437,0.0004849161,0.0011972665,0.0012497909,0.002406733],"category_scores_gemma":[0.0012604971,0.0003148303,0.00066922547,0.0006379408,0.00066428556,0.0012750761,0.0010210298,0.000619296,0.00039867134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001890062,0.00022682475,0.0020634232,0.0003203933,0.0002231853,0.00019479688,0.0006162232,0.53603804,0.013926221,0.05089702,0.0069948942,0.38830996],"study_design_scores_gemma":[0.00008469409,0.00021542009,0.00033737838,0.00003133846,0.000043208158,0.00014556466,0.00006656623,0.9729759,0.0026912277,0.0145066185,0.00888037,0.00002180252],"about_ca_topic_score_codex":0.0015892582,"about_ca_topic_score_gemma":0.0011780749,"teacher_disagreement_score":0.002406733,"about_ca_system_score_codex":0.00038027696,"about_ca_system_score_gemma":0.0006467282,"threshold_uncertainty_score":0.008051395},"labels":[],"label_agreement":null},{"id":"W2793816938","doi":"10.1007/s10462-018-9616-4","title":"A comprehensive investigation into the performance, robustness, scalability and convergence of chaos-enhanced evolutionary algorithms with boundary constraints","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chaotic; Robustness (evolution); Computer science; Scalability; Evolutionary algorithm; Algorithm; Mathematical optimization; Convergence (economics); Heuristic; Mathematics; Machine learning; Artificial intelligence","score_opus":0.05226224469424341,"score_gpt":0.31553211472671294,"score_spread":0.26326987003246954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793816938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09435219,0.3648917,0.50315166,0.0017398439,0.00048004166,0.00014374232,0.00008056127,0.000204944,0.034955338],"genre_scores_gemma":[0.6241591,0.2183034,0.15069757,0.00048541382,0.0005734702,0.00016061749,0.00018759364,0.00011392722,0.005318865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995735,0.0001090716,0.000031231837,0.00005574978,0.00020097589,0.00002946168],"domain_scores_gemma":[0.99849164,0.0010681568,0.00010196016,0.00006982756,0.00024679574,0.000021612288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013835753,0.00053967146,0.0010193906,0.0007790105,0.00023731783,0.0010802937,0.0007835855,0.0008024505,0.0006340466],"category_scores_gemma":[0.0052072853,0.00024804389,0.0006083971,0.0011907201,0.0003697327,0.0016826671,0.00056388706,0.0008999303,0.00014184567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015933605,0.00014777805,0.0024743422,0.003250993,0.00033762466,0.00020006232,0.00015568525,0.26918557,0.019382367,0.10329394,0.0026402273,0.5987721],"study_design_scores_gemma":[0.000048176345,0.0007247706,0.003377445,0.0009850593,0.00038651447,0.0006690534,0.00011970234,0.8783483,0.019352887,0.04261665,0.05329101,0.00008039754],"about_ca_topic_score_codex":0.00048912177,"about_ca_topic_score_gemma":0.00037594378,"teacher_disagreement_score":0.0013835753,"about_ca_system_score_codex":0.00033811075,"about_ca_system_score_gemma":0.00052208744,"threshold_uncertainty_score":0.007317126},"labels":[],"label_agreement":null},{"id":"W2795749052","doi":"10.1007/s40747-018-0071-2","title":"A quarter century of particle swarm optimization","year":2018,"lang":"en","type":"article","venue":"Complex & Intelligent Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Shenzhen Municipal Science and Technology Innovation Council; National Natural Science Foundation of China","keywords":"Quarter (Canadian coin); Computational intelligence; Particle swarm optimization; Particle (ecology); Swarm intelligence; Computer science; Artificial intelligence; Biology; Geography; Algorithm","score_opus":0.06197484055818507,"score_gpt":0.3127475510839839,"score_spread":0.2507727105257988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795749052","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009153837,0.23371539,0.48456764,0.06422447,0.02679277,0.00021026566,0.0008059606,0.0009594835,0.17957027],"genre_scores_gemma":[0.24866515,0.34585845,0.23362365,0.017834207,0.022444699,0.00053593935,0.0015384844,0.0008363746,0.12866306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986362,0.00042850297,0.000110648194,0.00027259107,0.00048452592,0.00006758578],"domain_scores_gemma":[0.9988293,0.0005130714,0.000084105995,0.00017020853,0.00032128568,0.00008210818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015977748,0.0007947535,0.0010713454,0.00093735126,0.0009588795,0.0026895811,0.000957454,0.0025600488,0.005198837],"category_scores_gemma":[0.0053798067,0.00033602797,0.0006288005,0.001883003,0.0027789066,0.0034949868,0.0016735761,0.0035917284,0.0029559107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011258728,0.000067450106,0.0014727113,0.00073822215,0.00010253026,0.00025644974,0.00049554516,0.026880993,0.00090912223,0.4604799,0.098352425,0.41013208],"study_design_scores_gemma":[0.000019951322,0.000062398474,0.0004878988,0.0005229012,0.00001919822,0.0002522294,0.00014709479,0.018517338,0.00054633763,0.19089161,0.7884832,0.000049788126],"about_ca_topic_score_codex":0.0023008566,"about_ca_topic_score_gemma":0.0013863398,"teacher_disagreement_score":0.005198837,"about_ca_system_score_codex":0.0013524707,"about_ca_system_score_gemma":0.0018631703,"threshold_uncertainty_score":0.01739186},"labels":[],"label_agreement":null},{"id":"W2799537251","doi":"10.1139/tcsme-2002-0012","title":"EXHAUSTIVE SEARCH APPROXIMATIONS IN DESIGN OPTIMIZATION: AN ALGORITHMIC IMPLEMENTATION","year":2002,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Convergence (economics); Extension (predicate logic); Computer science; Sensitivity (control systems); Variance (accounting); Optimization problem; Algorithm; Mathematics; Engineering","score_opus":0.047804559404910366,"score_gpt":0.275645289553464,"score_spread":0.22784073014855366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799537251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019156716,0.00010329474,0.99534094,0.00008932555,0.000011320342,0.000023096492,0.000009637035,0.00013524026,0.002371459],"genre_scores_gemma":[0.12518357,0.00046520628,0.870611,0.000147618,0.00005240083,0.0003871515,0.000068643254,0.0000885418,0.0029959176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989567,0.00051332114,0.000035443398,0.00008551008,0.00034966937,0.000059383645],"domain_scores_gemma":[0.9982497,0.001374836,0.000074387775,0.0001534627,0.00012198029,0.000025651549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017613315,0.00066249096,0.0009185431,0.0006701777,0.00038081803,0.00095699244,0.00090638007,0.0009908358,0.0032263862],"category_scores_gemma":[0.0057638856,0.00048345208,0.00057928363,0.0012282875,0.00090855424,0.0014356655,0.0012266764,0.0014726347,0.0006585038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051071056,0.000051880495,0.00034000239,0.00009708132,0.000029375897,0.000051813946,0.00008783927,0.7805259,0.0006461434,0.14478526,0.0014442931,0.07188931],"study_design_scores_gemma":[0.000014285121,0.000020365153,0.00003661667,0.000013371583,0.0000052051046,0.000019488443,0.000011602451,0.9634256,0.00019798582,0.034394845,0.0018573229,0.0000033974625],"about_ca_topic_score_codex":0.0024928749,"about_ca_topic_score_gemma":0.0034093068,"teacher_disagreement_score":0.0032263862,"about_ca_system_score_codex":0.0006954041,"about_ca_system_score_gemma":0.001258782,"threshold_uncertainty_score":0.010793388},"labels":[],"label_agreement":null},{"id":"W2800623967","doi":"10.1108/ijicc-05-2017-0050","title":"Synchronous self-learning Pareto strategy","year":2018,"lang":"en","type":"article","venue":"International Journal of Intelligent Computing and Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Evolutionary algorithm; Mathematical optimization; Pareto principle; Artificial intelligence; Robustness (evolution); Multi-objective optimization; Benchmark (surveying); Machine learning; Mathematics","score_opus":0.016422321517909722,"score_gpt":0.30956461577052047,"score_spread":0.29314229425261074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800623967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043038834,0.00037362662,0.9344151,0.00024575065,0.00004977884,0.00014641785,0.000034264933,0.0002425128,0.021453701],"genre_scores_gemma":[0.8580664,0.0003103917,0.1307501,0.00014452283,0.000035903013,0.00025475287,0.00006430555,0.000041566564,0.010332093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996631,0.000092721064,0.000015647249,0.000057248577,0.00012982031,0.000041531264],"domain_scores_gemma":[0.9995741,0.00016506077,0.000060614908,0.00005031113,0.000115922965,0.00003386425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066602376,0.0006358563,0.00056345295,0.000583162,0.00044040493,0.000881891,0.0008659764,0.00057813636,0.0027015682],"category_scores_gemma":[0.0011682299,0.00018267831,0.000564598,0.00045140638,0.0008400036,0.0006605529,0.0007382322,0.00044585124,0.00048290126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007255831,0.000078769415,0.00084373535,0.00012437266,0.00004559459,0.00011368907,0.00008571256,0.81811386,0.0050377008,0.06789236,0.001410965,0.10618071],"study_design_scores_gemma":[0.000009918937,0.000053677446,0.00007473478,0.000008150665,0.00000525415,0.00002195776,0.000011296086,0.98987025,0.0007598443,0.008199666,0.0009803211,0.000004771574],"about_ca_topic_score_codex":0.001988287,"about_ca_topic_score_gemma":0.001007427,"teacher_disagreement_score":0.0027015682,"about_ca_system_score_codex":0.0007877256,"about_ca_system_score_gemma":0.0009886723,"threshold_uncertainty_score":0.0090376735},"labels":[],"label_agreement":null},{"id":"W2802761309","doi":"10.1016/j.aci.2018.04.001","title":"Hybrid binary bat enhanced particle swarm optimization algorithm for solving feature selection problems","year":2018,"lang":"en","type":"article","venue":"Applied Computing and Informatics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Particle swarm optimization; Computer science; Multi-swarm optimization; Feature (linguistics); Algorithm; Feature selection; Binary number; Set (abstract data type); Binary search algorithm; Metaheuristic; Swarm behaviour; Hybrid algorithm (constraint satisfaction); Bat algorithm; Mathematical optimization; Meta-optimization; Selection (genetic algorithm); Feature vector; Search algorithm; Artificial intelligence; Mathematics; Constraint satisfaction","score_opus":0.012673804922401007,"score_gpt":0.25712613895544956,"score_spread":0.24445233403304856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802761309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010663848,0.00042842352,0.986226,0.00013624447,0.00007362621,0.00005346229,0.000032343436,0.0002612731,0.0021247708],"genre_scores_gemma":[0.3399542,0.00052184885,0.65344095,0.00028506413,0.00010799598,0.00042399194,0.0002854631,0.00010872888,0.004871733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936825,0.00019125413,0.000041912746,0.00008693962,0.00026106412,0.00005064517],"domain_scores_gemma":[0.99939036,0.00028621772,0.000056190613,0.000047110752,0.00019335716,0.000026706159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009006101,0.0007925085,0.0011566415,0.00074292155,0.00043698,0.000822297,0.0011123462,0.0010548447,0.0015592596],"category_scores_gemma":[0.0017858392,0.0003869119,0.0006294061,0.000979767,0.00042384092,0.0007949008,0.0007142792,0.00097625644,0.0005438218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017145935,0.0001309578,0.0017873767,0.00020630175,0.00015681384,0.000109927125,0.00010125377,0.7651731,0.008025309,0.009385897,0.0032318581,0.21151976],"study_design_scores_gemma":[0.000021661608,0.00003207285,0.000216778,0.0000054540774,0.000008692415,0.000028215794,0.000006920654,0.99687046,0.00065143086,0.0011892,0.0009637468,0.0000054272004],"about_ca_topic_score_codex":0.0035382342,"about_ca_topic_score_gemma":0.002388276,"teacher_disagreement_score":0.0035382342,"about_ca_system_score_codex":0.0003280337,"about_ca_system_score_gemma":0.0007532724,"threshold_uncertainty_score":0.0070352554},"labels":[],"label_agreement":null},{"id":"W2809652621","doi":"10.5539/mas.v12n7p73","title":"Collaborative Strategy for Grey Wolf Optimization Algorithm","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Particle swarm optimization; Algorithm; Computer science; Set (abstract data type); Mathematical optimization; Metaheuristic; Feature (linguistics); Heuristics; Search algorithm; Mathematics","score_opus":0.027697085923670064,"score_gpt":0.31303267740908164,"score_spread":0.2853355914854116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809652621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013861607,0.0005124099,0.97539574,0.00018392336,0.00008431963,0.00009523817,0.000025734926,0.00022327834,0.009617816],"genre_scores_gemma":[0.70477146,0.0005872363,0.2841609,0.00026571224,0.00007324591,0.00047524407,0.00012701367,0.000084369385,0.009454761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994137,0.00016418814,0.000036098452,0.000107548825,0.00020990953,0.0000685095],"domain_scores_gemma":[0.99961543,0.00018076957,0.000042369098,0.000034595432,0.00010213821,0.00002462921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092522305,0.0008398872,0.0011063146,0.00066742767,0.0004884872,0.00095298956,0.0012671901,0.001416817,0.0029513205],"category_scores_gemma":[0.0018264453,0.00028147263,0.0007425489,0.00067088415,0.00078157533,0.0007953126,0.0010746067,0.00070199574,0.000541671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079470294,0.000054541364,0.0007007282,0.00012832553,0.00009171957,0.00019847907,0.00012579237,0.85545886,0.004973885,0.04472905,0.0022090087,0.09125011],"study_design_scores_gemma":[0.000022301152,0.0000549614,0.00008449703,0.0000074240716,0.000012640483,0.000033920947,0.000009487946,0.99158466,0.00071669236,0.0056923586,0.001774077,0.000006955021],"about_ca_topic_score_codex":0.0030587458,"about_ca_topic_score_gemma":0.0018251722,"teacher_disagreement_score":0.0030587458,"about_ca_system_score_codex":0.0006709152,"about_ca_system_score_gemma":0.0010133336,"threshold_uncertainty_score":0.009873152},"labels":[],"label_agreement":null},{"id":"W2882970722","doi":"10.1007/s40092-018-0282-6","title":"An improved particle swarm optimization with a new swap operator for team formation problem","year":2018,"lang":"en","type":"article","venue":"Journal of industrial engineering international","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Swap (finance); Mathematical optimization; Computer science; Multi-swarm optimization; Operator (biology); Benchmark (surveying); Swarm intelligence; Metaheuristic; Algorithm; Mathematics","score_opus":0.02977743464231963,"score_gpt":0.2796475117979031,"score_spread":0.24987007715558346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2882970722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013935834,0.00026637415,0.9827473,0.0002114085,0.00013090773,0.000071803246,0.0000376326,0.00015112777,0.0024476314],"genre_scores_gemma":[0.5110505,0.0004677935,0.4831853,0.00028898162,0.00018378701,0.0004958878,0.00029508132,0.00007535073,0.0039572744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940825,0.00023219122,0.000039234692,0.00009620016,0.00016582158,0.000058367044],"domain_scores_gemma":[0.9994677,0.00024440678,0.00006109739,0.000043126787,0.00014291787,0.000040714658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012098184,0.00093292346,0.0011081785,0.00067490473,0.0005499916,0.00075002195,0.0011942384,0.0013216956,0.0014848441],"category_scores_gemma":[0.0020329084,0.0003465052,0.00084568694,0.0006897476,0.00057231064,0.0010336555,0.0009726426,0.0010126792,0.00025218047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110285146,0.00008838998,0.0010662341,0.000098051205,0.0000701714,0.000097462005,0.00008707209,0.9135266,0.002208053,0.009546382,0.0032545263,0.06984664],"study_design_scores_gemma":[0.000019254478,0.0000333441,0.000088508204,0.0000032697837,0.00000649549,0.000012317119,0.0000077195455,0.99812144,0.00020109372,0.0009574816,0.000545554,0.000003465074],"about_ca_topic_score_codex":0.004398093,"about_ca_topic_score_gemma":0.0025878525,"teacher_disagreement_score":0.004398093,"about_ca_system_score_codex":0.00049036724,"about_ca_system_score_gemma":0.0011477562,"threshold_uncertainty_score":0.008745015},"labels":[],"label_agreement":null},{"id":"W2883655384","doi":"10.5539/mas.v12n8p142","title":"Travelling Salesman Problem Solution Based-on Grey Wolf Algorithm over Hypercube Interconnection Network","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypercube; Travelling salesman problem; Computer science; Benchmark (surveying); Speedup; Algorithm; Interconnection; Mathematical optimization; Path (computing); Parallel computing; Mathematics","score_opus":0.022408285008274048,"score_gpt":0.2692940664572157,"score_spread":0.24688578144894166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883655384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10707644,0.0010452225,0.86932236,0.00052198896,0.00012419933,0.00016914288,0.00010154231,0.0007162787,0.020922821],"genre_scores_gemma":[0.735972,0.0008101112,0.2528657,0.00010932325,0.000053955264,0.00026402855,0.00021073796,0.00008726981,0.009626885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998323,0.000045270655,0.000007381258,0.00003340813,0.00005376444,0.000027916867],"domain_scores_gemma":[0.9998591,0.0000552965,0.000021200678,0.000012081477,0.00004111321,0.000011152227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030079726,0.0005351303,0.00080217834,0.0005386693,0.00047509558,0.0006871998,0.0008026559,0.0007563777,0.002562784],"category_scores_gemma":[0.0005672954,0.00023529549,0.0004990153,0.000748101,0.00037257143,0.00068257865,0.00046105045,0.00041354017,0.00024749443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044701905,0.000032669665,0.00036733612,0.00006710038,0.00003496007,0.00010245481,0.00004652396,0.9469543,0.0019309842,0.0066300086,0.0012649648,0.042523965],"study_design_scores_gemma":[0.000013960272,0.00002385354,0.00007171403,0.0000036215454,0.000005852478,0.000016832511,0.000011642817,0.9963367,0.00043029446,0.0024985534,0.0005840196,0.0000029661799],"about_ca_topic_score_codex":0.006301694,"about_ca_topic_score_gemma":0.0045568813,"teacher_disagreement_score":0.006301694,"about_ca_system_score_codex":0.0006483222,"about_ca_system_score_gemma":0.0011274805,"threshold_uncertainty_score":0.012530029},"labels":[],"label_agreement":null},{"id":"W2885803011","doi":"10.1007/s00500-018-3448-7","title":"A self-feedback strategy differential evolution with fitness landscape analysis","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Fitness landscape; Mathematical optimization; Differential evolution; Computer science; Evolutionary algorithm; Fitness approximation; Convergence (economics); Global optimization; Range (aeronautics); Fitness function; Genetic algorithm; Mathematics; Engineering","score_opus":0.013702865392779696,"score_gpt":0.26663239255909643,"score_spread":0.2529295271663167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885803011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012371366,0.0003042302,0.98153037,0.00010097267,0.000039678438,0.000051316187,0.000017335517,0.00014696283,0.0054377117],"genre_scores_gemma":[0.56475025,0.00053731573,0.42659628,0.00018028538,0.000043538163,0.00035467086,0.00008903538,0.00007709927,0.007371613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999788,0.000050195787,0.000011041558,0.000034523284,0.000100819634,0.000015362832],"domain_scores_gemma":[0.9997845,0.000105517734,0.000021075992,0.000016810298,0.00006231617,0.0000097773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044555552,0.0005583157,0.0006338439,0.00055395905,0.0002960553,0.00065213436,0.00091961725,0.00080085633,0.0013569393],"category_scores_gemma":[0.0010116864,0.00026454564,0.0006369487,0.0005122437,0.00046659893,0.0006336156,0.00064838375,0.00048164584,0.00020493889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034570032,0.000059551414,0.0012897655,0.00013293135,0.000076963755,0.00017492054,0.00013118758,0.8100608,0.016034365,0.04870851,0.0011882738,0.12210826],"study_design_scores_gemma":[0.000006873569,0.000020716316,0.00010045974,0.0000046563973,0.0000057847924,0.000036389316,0.0000030694334,0.99596834,0.0007651264,0.0019151624,0.001168583,0.000004790404],"about_ca_topic_score_codex":0.0017096986,"about_ca_topic_score_gemma":0.0010349054,"teacher_disagreement_score":0.0017096986,"about_ca_system_score_codex":0.00054361706,"about_ca_system_score_gemma":0.00047877347,"threshold_uncertainty_score":0.0045393705},"labels":[],"label_agreement":null},{"id":"W2886040690","doi":"10.1016/j.amc.2018.07.037","title":"Estimation distribution algorithms on constrained optimization problems","year":2018,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"EDAS; Estimation of distribution algorithm; Mathematical optimization; Mathematics; Selection (genetic algorithm); Benchmark (surveying); Evolutionary algorithm; Optimization problem; Algorithm; Gaussian; Computer science; Artificial intelligence","score_opus":0.025235277532960235,"score_gpt":0.2853783659093228,"score_spread":0.2601430883763626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886040690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002523657,0.0002874755,0.9959735,0.00025294372,0.000027259523,0.000020532658,0.000014246665,0.00007769323,0.0008226409],"genre_scores_gemma":[0.32441154,0.0017588243,0.66343045,0.000538,0.0003539356,0.0006410915,0.00041197275,0.0005150863,0.007939026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997677,0.0014847518,0.00009084063,0.0002480778,0.0003800232,0.00011932887],"domain_scores_gemma":[0.9795395,0.018009769,0.00062858773,0.000564117,0.00103435,0.00022362234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00638009,0.0014337151,0.002114705,0.0017075097,0.0007073369,0.002179152,0.0028057632,0.0025691958,0.004110751],"category_scores_gemma":[0.03670632,0.0013376927,0.000927036,0.0027672313,0.0020635545,0.0042984043,0.0033099034,0.0035066996,0.00067414617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009955738,0.00006958389,0.0005066917,0.00015557339,0.0000688586,0.00003571519,0.000071059716,0.8469576,0.00038788616,0.08415928,0.0019748348,0.06551331],"study_design_scores_gemma":[0.000014282587,0.000009013938,0.000043174783,0.000011175155,0.0000053469466,0.000006534569,0.0000059400295,0.97534186,0.000106825595,0.024103202,0.00034920886,0.0000034756965],"about_ca_topic_score_codex":0.0049259407,"about_ca_topic_score_gemma":0.002806724,"teacher_disagreement_score":0.00638009,"about_ca_system_score_codex":0.0016511282,"about_ca_system_score_gemma":0.001847753,"threshold_uncertainty_score":0.033741593},"labels":[],"label_agreement":null},{"id":"W2889022283","doi":"10.1109/ccece.2018.8447811","title":"IIR Filter Design Using Constrained Multiobjective Cuckoo Search Algorithm","year":2018,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Passband; Infinite impulse response; Stopband; Cuckoo search; Cuckoo; Computer science; Finite impulse response; Minification; Algorithm; Digital filter; Filter (signal processing); Control theory (sociology); Mathematical optimization; Mathematics; Band-pass filter; Electronic engineering; Engineering; Artificial intelligence; Particle swarm optimization","score_opus":0.09338677641159308,"score_gpt":0.3447761642855397,"score_spread":0.2513893878739466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889022283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015288531,0.00043527287,0.9796252,0.000059524624,0.000025405892,0.00007247024,0.00002215916,0.00020502757,0.0042664595],"genre_scores_gemma":[0.54830855,0.0006280425,0.44334406,0.00017221556,0.000040404022,0.000502451,0.00013333015,0.00014426468,0.006726773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963045,0.000105866726,0.00001669693,0.000061734674,0.0001527039,0.000032636824],"domain_scores_gemma":[0.99957687,0.00022362429,0.00006346942,0.000022530803,0.00009972648,0.000013679117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005542989,0.0010529913,0.0008310319,0.0008085962,0.00037302208,0.0007411527,0.0006020755,0.0009957507,0.0020543993],"category_scores_gemma":[0.001277234,0.00042045515,0.00053362694,0.0006620993,0.00042067404,0.00044405073,0.00034264068,0.00036792207,0.00034733652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046254183,0.000028332595,0.00024457776,0.00015004218,0.000053737316,0.000048511287,0.0000426789,0.94424444,0.008148746,0.006845431,0.0007360616,0.03941119],"study_design_scores_gemma":[0.000011654533,0.000037740745,0.00008099191,0.0000086813725,0.0000080618565,0.000016962584,0.0000050615786,0.9970198,0.0011266472,0.0008770355,0.0008013433,0.0000060913435],"about_ca_topic_score_codex":0.004085968,"about_ca_topic_score_gemma":0.0034748856,"teacher_disagreement_score":0.004085968,"about_ca_system_score_codex":0.00059390423,"about_ca_system_score_gemma":0.0007768565,"threshold_uncertainty_score":0.0081243515},"labels":[],"label_agreement":null},{"id":"W2889120335","doi":"10.1109/access.2018.2868236","title":"Gradient Population Optimization: A Tensorflow-Based Heterogeneous Non-Von-Neumann Paradigm for Large-Scale Search","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Scale (ratio); Von Neumann architecture; Artificial intelligence; Cartography; Geography","score_opus":0.04404424430391283,"score_gpt":0.34496184066283403,"score_spread":0.3009175963589212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889120335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008316264,0.00022926723,0.987362,0.00027168653,0.00006147882,0.000047436075,0.000029449684,0.0001787346,0.0035036243],"genre_scores_gemma":[0.47893792,0.0006003229,0.5145725,0.0003914162,0.00013621782,0.00046053337,0.00016659891,0.00020014666,0.004534255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997074,0.00011149157,0.000011243371,0.00004177626,0.00009466057,0.000033465727],"domain_scores_gemma":[0.99952257,0.00025216548,0.00005585007,0.000046202083,0.0000858843,0.000037254653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096104573,0.00083916483,0.00081483007,0.0004702245,0.00056554703,0.0008364162,0.0012623918,0.000916078,0.0013364817],"category_scores_gemma":[0.0018453029,0.0003756928,0.0007212029,0.00059481175,0.0010453968,0.0012391579,0.0012270088,0.0011637006,0.00024715273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024638273,0.00002538704,0.00031160418,0.000043987195,0.000033750348,0.000040517418,0.0000366453,0.92384434,0.0015875188,0.05492622,0.0013681302,0.017757203],"study_design_scores_gemma":[0.000003713148,0.0000069969383,0.000015021838,0.0000016632155,0.0000015842114,0.0000038638627,0.000001975364,0.9926166,0.00010956729,0.0068651075,0.00037204215,0.0000019043342],"about_ca_topic_score_codex":0.0036574632,"about_ca_topic_score_gemma":0.003169442,"teacher_disagreement_score":0.0036574632,"about_ca_system_score_codex":0.00096036616,"about_ca_system_score_gemma":0.0014898145,"threshold_uncertainty_score":0.0072723627},"labels":[],"label_agreement":null},{"id":"W2889458022","doi":"10.1109/ccece.2018.8447876","title":"Length Scale-Based Differential Evolution","year":2018,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Metric (unit); Scale (ratio); Similarity (geometry); Mathematical optimization; Algorithm; Computer science; Mathematics; Differential evolution; Population; Function (biology); Artificial intelligence; Engineering","score_opus":0.01655239095856732,"score_gpt":0.2738917590475778,"score_spread":0.2573393680890105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889458022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02039443,0.00059043546,0.9696829,0.00017423388,0.000080223705,0.00006237439,0.000040637296,0.00019131468,0.008783375],"genre_scores_gemma":[0.69006747,0.0008832891,0.29913712,0.00027839356,0.00007745483,0.00033784937,0.00018890912,0.00009561658,0.008933785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996424,0.00008813712,0.000018185783,0.00006563809,0.0001577451,0.000027781227],"domain_scores_gemma":[0.99956113,0.00021460204,0.000050468963,0.000041503314,0.00011215571,0.00002015143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062237727,0.00057947583,0.0008129865,0.0005468412,0.00028751203,0.0008018161,0.0011113558,0.0008370082,0.0015906215],"category_scores_gemma":[0.0019730362,0.00021257985,0.0006740238,0.0006916358,0.0005610748,0.0007314525,0.0009321936,0.000674798,0.00027634596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000432883,0.000044251847,0.0011577598,0.00011571588,0.000071706076,0.0001319473,0.0000983894,0.83196706,0.0096972985,0.04175475,0.001576121,0.1133418],"study_design_scores_gemma":[0.000008518219,0.00002644488,0.0001594248,0.0000052068885,0.000008626193,0.000033313776,0.000004566075,0.99294525,0.00074686814,0.0043391655,0.0017146429,0.000007967174],"about_ca_topic_score_codex":0.0016010131,"about_ca_topic_score_gemma":0.0010627451,"teacher_disagreement_score":0.0016010131,"about_ca_system_score_codex":0.00074569986,"about_ca_system_score_gemma":0.0004503257,"threshold_uncertainty_score":0.005410433},"labels":[],"label_agreement":null},{"id":"W2892078476","doi":"10.1007/s00500-018-3530-1","title":"Majority voting for discrete population-based optimization algorithms","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Voting; Computer science; Algorithm; Population; Political science","score_opus":0.02588868168157974,"score_gpt":0.3187401715354348,"score_spread":0.29285148985385506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892078476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011995066,0.00036507443,0.9840805,0.00023869371,0.000098073746,0.000057094723,0.000023905854,0.0001131987,0.0030284198],"genre_scores_gemma":[0.6474498,0.00043795918,0.34198087,0.0003239081,0.00022168437,0.00048792874,0.00019391054,0.00020495143,0.008699025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588215,0.0021674316,0.00017120755,0.00051533204,0.000933976,0.0003299341],"domain_scores_gemma":[0.9906949,0.006861193,0.0003897604,0.0006874929,0.0011630361,0.00020365203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007883637,0.0009669159,0.002734019,0.0009482531,0.0011992438,0.002552948,0.0035187653,0.0020714249,0.003259356],"category_scores_gemma":[0.02162997,0.0008059734,0.001101066,0.0012703339,0.0018697546,0.0030096981,0.0027542217,0.0023430912,0.0005775278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002596599,0.0001094047,0.0007013077,0.00014426993,0.00014569963,0.000047583482,0.00011508007,0.7843239,0.0012111462,0.09822647,0.0022160972,0.11249938],"study_design_scores_gemma":[0.00001681589,0.000020641864,0.000037894864,0.000007476964,0.0000099988365,0.000005551493,0.000007708337,0.9769065,0.00027783355,0.022380384,0.00032571895,0.0000035379765],"about_ca_topic_score_codex":0.002289418,"about_ca_topic_score_gemma":0.0024065226,"teacher_disagreement_score":0.007883637,"about_ca_system_score_codex":0.0013719492,"about_ca_system_score_gemma":0.0014364437,"threshold_uncertainty_score":0.04169315},"labels":[],"label_agreement":null},{"id":"W2893066337","doi":"10.1007/s00500-018-3536-8","title":"Phasor particle swarm optimization: a simple and efficient variant of PSO","year":2018,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":262,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Particle swarm optimization; Phasor; Multi-swarm optimization; Benchmark (surveying); Mathematical optimization; Mathematics; Derivative-free optimization; Algorithm; Meta-optimization; Computer science; Electric power system; Power (physics)","score_opus":0.021212477101301974,"score_gpt":0.29485239913755534,"score_spread":0.27363992203625337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893066337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043136855,0.00035173094,0.98644316,0.00011014163,0.00022207078,0.00010835661,0.00008488332,0.00083692186,0.007529083],"genre_scores_gemma":[0.16599254,0.0007009256,0.8174807,0.00016955027,0.00021098636,0.00027176322,0.0002996281,0.00033899027,0.014534962],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967766,0.000081438775,0.000018317844,0.00004604917,0.00015918986,0.000017314349],"domain_scores_gemma":[0.9998035,0.000054110198,0.000019009907,0.000051061495,0.00005789641,0.000014433535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035212294,0.0006341381,0.000969358,0.00037328372,0.00028973568,0.0007279058,0.0008442481,0.00080289034,0.0027813746],"category_scores_gemma":[0.0010356145,0.00025575564,0.00042807762,0.0009478082,0.00030066393,0.00069262885,0.0006741728,0.0010028353,0.0014639029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022183704,0.00016176786,0.00094193075,0.00031623477,0.00017974644,0.00023876218,0.00008682874,0.35716394,0.017852671,0.042761862,0.011801736,0.56827265],"study_design_scores_gemma":[0.000056150053,0.000070073336,0.00042972696,0.000013367112,0.000030244379,0.00013119956,0.000012290404,0.96989936,0.0037523352,0.008225502,0.017362341,0.000017343193],"about_ca_topic_score_codex":0.0020852298,"about_ca_topic_score_gemma":0.0025730808,"teacher_disagreement_score":0.0027813746,"about_ca_system_score_codex":0.00020216934,"about_ca_system_score_gemma":0.00043987375,"threshold_uncertainty_score":0.009304583},"labels":[],"label_agreement":null},{"id":"W2896746300","doi":"10.1016/j.eswa.2018.10.034","title":"Optimal learning group formation: A multi-objective heuristic search strategy for enhancing inter-group homogeneity and intra-group heterogeneity","year":2018,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Machine learning; Artificial intelligence; Sorting; Heuristic; Cluster analysis; Genetic algorithm; Homogeneity (statistics); Algorithm","score_opus":0.03849707131950852,"score_gpt":0.3231924971725831,"score_spread":0.28469542585307456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896746300","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030321786,0.00015925487,0.96578336,0.00020024244,0.00005644226,0.00018338376,0.000023025848,0.00021315127,0.003059273],"genre_scores_gemma":[0.6291437,0.0000986858,0.36669996,0.00026857504,0.000063578314,0.00045522343,0.000083416526,0.00009589068,0.003090982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989396,0.00042435716,0.00004340509,0.00020107726,0.00023310135,0.000158561],"domain_scores_gemma":[0.9978599,0.0010934602,0.0003213978,0.00016390286,0.00038810086,0.00017316084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026768479,0.0013669073,0.0016091212,0.0017475978,0.0011257875,0.001035471,0.0026902861,0.0019744628,0.0029576076],"category_scores_gemma":[0.005667108,0.0005432066,0.0009558089,0.0010041384,0.0013598509,0.0018834368,0.002607893,0.0010719728,0.00038683595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024658255,0.00030114563,0.0008851944,0.00010656419,0.00011131287,0.00011860328,0.00028098963,0.8788032,0.0031084493,0.01576515,0.0021302435,0.0981426],"study_design_scores_gemma":[0.000036583817,0.000095654774,0.000070887654,0.000008108973,0.000019677209,0.000020356483,0.000032234704,0.99532616,0.00059656234,0.0034860864,0.00030000886,0.000007635931],"about_ca_topic_score_codex":0.0029316577,"about_ca_topic_score_gemma":0.0033577783,"teacher_disagreement_score":0.0029576076,"about_ca_system_score_codex":0.0012292818,"about_ca_system_score_gemma":0.0017511544,"threshold_uncertainty_score":0.014156699},"labels":[],"label_agreement":null},{"id":"W2898330572","doi":"10.1007/s10732-018-9397-6","title":"Swarm hyperheuristic framework","year":2018,"lang":"fr","type":"article","venue":"Journal of Heuristics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Metaheuristic; Computer science; Swarm behaviour; Swarm intelligence; Benchmark (surveying); Parallel metaheuristic; Heuristics; Novelty; Artificial intelligence; Mathematical optimization; Algorithm; Machine learning; Mathematics; Particle swarm optimization; Meta-optimization","score_opus":0.0637507977471381,"score_gpt":0.35187492677389764,"score_spread":0.28812412902675955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898330572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009774608,0.0029839172,0.8766768,0.0011286284,0.0007892709,0.00015911029,0.00014864936,0.00035520547,0.107983835],"genre_scores_gemma":[0.42091516,0.00470825,0.47730318,0.00083361106,0.0008691502,0.00060733204,0.0005347759,0.00026128176,0.09396729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996666,0.00013331472,0.000012537088,0.000049064325,0.000107987085,0.000030593565],"domain_scores_gemma":[0.99983156,0.000053122523,0.000014196428,0.000033639448,0.00004995561,0.00001751317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047220464,0.0006501467,0.0007057549,0.0007159717,0.0004992492,0.0016531369,0.0012465958,0.0013138902,0.007805852],"category_scores_gemma":[0.0009556326,0.00023573427,0.0006388303,0.0007998869,0.00052876025,0.0010764556,0.001030542,0.001247274,0.00178011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005745492,0.000097360324,0.00030282923,0.00016774551,0.000113761176,0.00014752174,0.00006731352,0.26885748,0.002790575,0.595128,0.010993609,0.12127648],"study_design_scores_gemma":[0.000035579313,0.00007271135,0.00013780082,0.000037564194,0.000033586537,0.00009246658,0.0000320283,0.84285873,0.0012879217,0.12275353,0.032642648,0.000015415448],"about_ca_topic_score_codex":0.001131807,"about_ca_topic_score_gemma":0.0012325775,"teacher_disagreement_score":0.007805852,"about_ca_system_score_codex":0.00064145157,"about_ca_system_score_gemma":0.001008824,"threshold_uncertainty_score":0.026113212},"labels":[],"label_agreement":null},{"id":"W2898430231","doi":"10.1016/j.jcde.2018.10.006","title":"A hybridization of differential evolution and monarch butterfly optimization for solving systems of nonlinear equations","year":2018,"lang":"en","type":"article","venue":"Journal of Computational Design and Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metaheuristic; Nonlinear system; Mathematical optimization; Differential evolution; Maxima and minima; Heuristic; Optimization problem; Computer science; Mathematics; Algorithm","score_opus":0.02470235642766716,"score_gpt":0.2602231180731059,"score_spread":0.23552076164543873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898430231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037974007,0.0007084937,0.954174,0.00029754202,0.00008756625,0.00007136998,0.000022564667,0.00025107432,0.0064134593],"genre_scores_gemma":[0.55454475,0.0004050758,0.4392238,0.0003256804,0.00004479248,0.00024316546,0.00008769498,0.00006752815,0.0050575407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996208,0.00011385615,0.000022692815,0.00005968825,0.00014558215,0.000037386555],"domain_scores_gemma":[0.999716,0.00016160906,0.00003241321,0.000025494417,0.00004738916,0.00001703935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088069186,0.00064212317,0.0007794968,0.00083981117,0.00047446133,0.00055841927,0.0011603346,0.0010019777,0.0011320356],"category_scores_gemma":[0.0010751483,0.00039719683,0.00070451177,0.00064989517,0.00053167285,0.0005654651,0.00096415024,0.00061679253,0.00015726342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072368886,0.0000866504,0.0012026645,0.00011958587,0.00013028523,0.00008308916,0.000083088045,0.88366187,0.0067295614,0.016498769,0.00077522505,0.090556905],"study_design_scores_gemma":[0.000009032933,0.000027699121,0.00010394518,0.000005996522,0.0000076578435,0.000015560456,0.000005970581,0.9972356,0.00062208984,0.0009814868,0.0009808688,0.000004132306],"about_ca_topic_score_codex":0.004690276,"about_ca_topic_score_gemma":0.005408857,"teacher_disagreement_score":0.004690276,"about_ca_system_score_codex":0.0008218231,"about_ca_system_score_gemma":0.00086426263,"threshold_uncertainty_score":0.009325981},"labels":[],"label_agreement":null},{"id":"W2898701277","doi":"10.1007/s10489-018-1313-0","title":"A new method for feature selection based on intelligent water drops","year":2018,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Feature selection; Artificial intelligence; Classifier (UML); Generalization; Data mining; Pattern recognition (psychology); Support vector machine; Fitness function; Visualization; Feature (linguistics); Machine learning; Genetic algorithm; Mathematics","score_opus":0.029857906943767703,"score_gpt":0.3428462592031508,"score_spread":0.3129883522593831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898701277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009317628,0.00023178264,0.9885604,0.000072173025,0.00013224801,0.000071103976,0.000044179364,0.00044072416,0.0011298144],"genre_scores_gemma":[0.30184457,0.0003930654,0.6896353,0.0001798723,0.00021784446,0.00032663895,0.00034382622,0.00019032268,0.00686864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995859,0.000044362103,0.000029549275,0.0000950632,0.0002052682,0.000039761268],"domain_scores_gemma":[0.9996586,0.00009672016,0.000024035815,0.000026848795,0.00017587957,0.00001791178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042705116,0.00081830117,0.0012484418,0.0014057163,0.00057232013,0.0008500046,0.0014135184,0.0008526308,0.0022290736],"category_scores_gemma":[0.0011032721,0.00032042502,0.00090065825,0.0015950683,0.00032476048,0.001102013,0.00074678083,0.00064410444,0.00052374724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028086797,0.00018358565,0.0017465245,0.00020306821,0.00018242715,0.00022597729,0.000090898655,0.0889246,0.046013806,0.0071330033,0.0055263056,0.8494889],"study_design_scores_gemma":[0.00003844322,0.00007158725,0.0006634695,0.0000067739543,0.000042196018,0.00008585228,0.000013855921,0.9892307,0.0056532915,0.0014470886,0.0027281237,0.000018719798],"about_ca_topic_score_codex":0.0034221478,"about_ca_topic_score_gemma":0.0029592447,"teacher_disagreement_score":0.0034221478,"about_ca_system_score_codex":0.00036257278,"about_ca_system_score_gemma":0.0006058701,"threshold_uncertainty_score":0.0074569583},"labels":[],"label_agreement":null},{"id":"W2898863354","doi":"10.1007/978-3-319-99719-3_4","title":"A General Method for Selection Function Optimization in Genetic Algorithms","year":2018,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Selection (genetic algorithm); Mathematical optimization; Population; Computer science; Fitness function; Set (abstract data type); Genetic algorithm; Mutation; Optimization problem; Algorithm; Meta-optimization; Artificial intelligence; Mathematics","score_opus":0.030879790552336295,"score_gpt":0.308801472387631,"score_spread":0.2779216818352947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898863354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001802887,0.0004829531,0.99700576,0.00007391007,0.00013839861,0.000025137428,0.000032145126,0.00012015704,0.0019412867],"genre_scores_gemma":[0.013582554,0.0011584841,0.9734947,0.00024234471,0.00029636736,0.00036540965,0.00015872784,0.00052636606,0.010174997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990841,0.00041821328,0.000045451878,0.00012250573,0.0002915173,0.00003815831],"domain_scores_gemma":[0.9994011,0.0003213142,0.00002339525,0.000101627054,0.00013040539,0.000022182776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016787777,0.0014337766,0.0012370156,0.0013396147,0.0006588378,0.0014897692,0.0022868381,0.0024474824,0.007331997],"category_scores_gemma":[0.0038401936,0.0006597768,0.0021788948,0.0023309628,0.0014421159,0.0016589573,0.0018041957,0.003588467,0.0040037828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004959241,0.00007143309,0.00023553315,0.0005453298,0.00015849953,0.0001601226,0.00018389492,0.1487055,0.0063186255,0.5547798,0.018202472,0.2705892],"study_design_scores_gemma":[0.00004387951,0.000060619823,0.00020990559,0.00011054909,0.000060885817,0.00023739868,0.00002518383,0.6491371,0.0016645131,0.28616872,0.062237043,0.00004423948],"about_ca_topic_score_codex":0.0015501849,"about_ca_topic_score_gemma":0.002202456,"teacher_disagreement_score":0.007331997,"about_ca_system_score_codex":0.0007145372,"about_ca_system_score_gemma":0.0008671758,"threshold_uncertainty_score":0.024527967},"labels":[],"label_agreement":null},{"id":"W2898968595","doi":"10.1109/dasc/picom/datacom/cyberscitec.2018.00053","title":"Hunting Algorithm Visualization and Performance Evaluation Through BDI Agent Simulation","year":2018,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"NetLogo; Computer science; Flexibility (engineering); Convergence (economics); Perception; Visualization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.06939797069354116,"score_gpt":0.38293928044087483,"score_spread":0.3135413097473337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898968595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7955172,0.00020969039,0.18818194,0.00025563248,0.00008699348,0.00023709856,0.00042786973,0.0015679963,0.013515642],"genre_scores_gemma":[0.9408632,0.00007966608,0.057983525,0.000020625152,0.0000033352032,0.0001171679,0.00017033838,0.000071066475,0.00069116184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995308,0.00022016418,0.000031034873,0.000038460512,0.00013216423,0.000047469846],"domain_scores_gemma":[0.9970873,0.0021213768,0.00013166749,0.00018317773,0.00039020416,0.00008625054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014778981,0.00069665414,0.00047646023,0.0008306052,0.0004039632,0.0008374837,0.00077430333,0.0006215563,0.0014575794],"category_scores_gemma":[0.003388843,0.000255461,0.00038112147,0.00054904434,0.0005034918,0.00058179104,0.00053110044,0.00064536225,0.00014963566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023505441,0.0002032487,0.0027205488,0.00010215532,0.00003504604,0.00005617769,0.00014000204,0.9752808,0.0027703932,0.0027224773,0.0004066767,0.015327413],"study_design_scores_gemma":[0.000013946338,0.00007282141,0.00021098698,0.000004449019,0.000004796542,0.000007779336,0.000020242882,0.99713314,0.0019127178,0.00037119508,0.00024313557,0.0000046575456],"about_ca_topic_score_codex":0.004482976,"about_ca_topic_score_gemma":0.0029731633,"teacher_disagreement_score":0.004482976,"about_ca_system_score_codex":0.0007750663,"about_ca_system_score_gemma":0.00057347916,"threshold_uncertainty_score":0.008913755},"labels":[],"label_agreement":null},{"id":"W2899710160","doi":"10.1007/s13369-018-3617-0","title":"Discrete Sine-Cosine Algorithm (DSCA) with Local Search for Solving Traveling Salesman Problem","year":2018,"lang":"en","type":"article","venue":"Arabian Journal for Science and Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Trigonometric functions; Mathematical optimization; Algorithm; Crossover; Computer science; Heuristic; Optimization problem; Mathematics; Artificial intelligence","score_opus":0.018594481368583046,"score_gpt":0.2773544058793667,"score_spread":0.25875992451078367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899710160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030941552,0.0012314145,0.9594462,0.00024082864,0.00025004562,0.00011423253,0.000044439174,0.0003148069,0.007416422],"genre_scores_gemma":[0.401633,0.00072787935,0.5911947,0.00016889561,0.00013142018,0.00031415495,0.00018432744,0.000106557905,0.005539145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996039,0.00012672524,0.000024881867,0.000064873355,0.00014204766,0.00003757992],"domain_scores_gemma":[0.99956113,0.00022430682,0.00003169908,0.00003244004,0.00012108479,0.000029314735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007469709,0.00061842805,0.00115751,0.00077586184,0.00058557454,0.0006300173,0.0012890287,0.0009927517,0.0031334935],"category_scores_gemma":[0.0018589763,0.0003078393,0.00067634124,0.0015109918,0.00049906457,0.0008230002,0.0007283398,0.001183468,0.00041341106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018519716,0.0002592155,0.0007603249,0.00026738676,0.000082655555,0.00006565393,0.00010986096,0.7411332,0.004246966,0.030944511,0.0044155437,0.21752949],"study_design_scores_gemma":[0.00002570072,0.00006942742,0.00006434719,0.0000062971453,0.000008183253,0.000021923157,0.000011306824,0.9961985,0.00045831612,0.0021208648,0.0010109713,0.000004185317],"about_ca_topic_score_codex":0.0049613644,"about_ca_topic_score_gemma":0.004289644,"teacher_disagreement_score":0.0049613644,"about_ca_system_score_codex":0.0005685279,"about_ca_system_score_gemma":0.0016938928,"threshold_uncertainty_score":0.010482609},"labels":[],"label_agreement":null},{"id":"W2901417794","doi":"10.1016/j.eswa.2018.11.031","title":"Using semi-independent variables to enhance optimization search","year":2018,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Science Foundation","keywords":"Mathematical optimization; Simulated annealing; Variable neighborhood search; Computer science; Particle swarm optimization; Variable (mathematics); Convergence (economics); Population; Optimization problem; Algorithm; Metaheuristic; Mathematics","score_opus":0.03783625714219308,"score_gpt":0.35223674048402737,"score_spread":0.3144004833418343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901417794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020889087,0.00023149679,0.97474355,0.000099746285,0.000102070226,0.000040883904,0.000032868436,0.00025311843,0.0036070908],"genre_scores_gemma":[0.4270453,0.00027671806,0.56943583,0.00019544741,0.00011886171,0.0001826523,0.0001374245,0.00020826889,0.002399485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913126,0.0004473552,0.000052765266,0.000072547875,0.00025278897,0.000043292443],"domain_scores_gemma":[0.9969488,0.0018920682,0.00025297658,0.0003042452,0.00053183595,0.00007001898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00220546,0.00092814566,0.0008145312,0.00079882774,0.00031669677,0.0011383621,0.0010082398,0.0010822074,0.0030092716],"category_scores_gemma":[0.006055145,0.00043422572,0.0006584119,0.0010197728,0.0005787249,0.0018183923,0.0014108293,0.0014148651,0.0005534738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038854592,0.0003445481,0.001275846,0.00024208223,0.00015530392,0.000078466175,0.000096524425,0.7717767,0.0126005225,0.028976861,0.0019284205,0.1821362],"study_design_scores_gemma":[0.000020840056,0.000061724204,0.00013872843,0.0000106730495,0.000018144667,0.000012099387,0.000005643843,0.9936,0.0019753734,0.0034834458,0.00066755246,0.0000058032565],"about_ca_topic_score_codex":0.0005876852,"about_ca_topic_score_gemma":0.0010861156,"teacher_disagreement_score":0.0030092716,"about_ca_system_score_codex":0.00025338578,"about_ca_system_score_gemma":0.0006298108,"threshold_uncertainty_score":0.011663735},"labels":[],"label_agreement":null},{"id":"W2902191103","doi":"10.1109/access.2018.2884130","title":"A Double Evolutionary Learning Moth-Flame Optimization for Real-Parameter Global Optimization Problems","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Scholarship Council; Education Department of Jiangxi Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Scalability; Differential evolution; Evolutionary algorithm; Computer science; Test suite; Mathematical optimization; Global optimization; Optimization problem; Algorithm; Artificial intelligence; Machine learning; Test case; Mathematics","score_opus":0.05894618279539715,"score_gpt":0.3579400372393824,"score_spread":0.29899385444398524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902191103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049679294,0.000766409,0.9437144,0.00030663185,0.00010808227,0.000121940415,0.00004645529,0.00053174625,0.0047250553],"genre_scores_gemma":[0.53037,0.00033651316,0.46520802,0.00023826517,0.000060527935,0.0002885721,0.0001484381,0.00011013577,0.003239524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997019,0.00008004733,0.00001587075,0.000053114116,0.00010712752,0.000041907155],"domain_scores_gemma":[0.9995566,0.00022017951,0.00005234612,0.000033400065,0.00009276532,0.00004472374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011741801,0.0010587611,0.0008103904,0.000834291,0.00047192207,0.0005970832,0.0013427339,0.0012865113,0.001410638],"category_scores_gemma":[0.0022765994,0.00041927682,0.00084495026,0.00046343994,0.00053415674,0.0007310177,0.0012685601,0.0009967596,0.00018139975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092443144,0.000090723544,0.0014414581,0.00009519905,0.00005707491,0.00008994897,0.000053441665,0.90377283,0.0024058407,0.006144666,0.0011040266,0.08465231],"study_design_scores_gemma":[0.000017345219,0.000044007807,0.000084656676,0.0000057924153,0.0000051218212,0.00001754183,0.0000050740355,0.99818283,0.00034515222,0.0008240569,0.00046390927,0.000004489764],"about_ca_topic_score_codex":0.0032276837,"about_ca_topic_score_gemma":0.002973668,"teacher_disagreement_score":0.0032276837,"about_ca_system_score_codex":0.0004768069,"about_ca_system_score_gemma":0.00096003455,"threshold_uncertainty_score":0.006417811},"labels":[],"label_agreement":null},{"id":"W2902772664","doi":"10.5539/mas.v13n1p10","title":"Moth Flame Optimization Based on Golden Section Search and its Application for Link Prediction Problem","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Heuristic; Link (geometry); Meta heuristic; Computer science; Connection (principal bundle); Point (geometry); Algorithm; Section (typography); Interval (graph theory); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.024354603280323378,"score_gpt":0.28074872257577305,"score_spread":0.25639411929544964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902772664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17514786,0.0027896308,0.81160337,0.0007239248,0.0002143588,0.00017535812,0.0002927739,0.0008530968,0.008199627],"genre_scores_gemma":[0.68186414,0.0009125859,0.313795,0.00023362543,0.000059660757,0.00023741879,0.00043888396,0.0001329578,0.0023256473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.00009130649,0.000019940724,0.00006256216,0.00008423011,0.000045304292],"domain_scores_gemma":[0.99923193,0.0004892357,0.000077102355,0.000038386326,0.0001262444,0.0000371263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012867821,0.00082758727,0.001028712,0.0014979808,0.000509611,0.00069807534,0.0011181026,0.0012449417,0.0012596246],"category_scores_gemma":[0.0026606636,0.00037434374,0.0011549554,0.0011403989,0.0004898097,0.00090515194,0.0006920145,0.00082091166,0.00013816841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007250208,0.00004068158,0.0016970967,0.000061160106,0.000047498128,0.000048223024,0.000030155388,0.952536,0.00092341204,0.0034021966,0.00078299566,0.04035806],"study_design_scores_gemma":[0.0000096390995,0.000025745014,0.00012330612,0.0000059953923,0.0000069935527,0.000010541245,0.000007384509,0.9985379,0.00026922647,0.00076356705,0.0002362875,0.0000034754507],"about_ca_topic_score_codex":0.010135841,"about_ca_topic_score_gemma":0.0055295792,"teacher_disagreement_score":0.010135841,"about_ca_system_score_codex":0.00088494224,"about_ca_system_score_gemma":0.0013230798,"threshold_uncertainty_score":0.020153642},"labels":[],"label_agreement":null},{"id":"W2903829737","doi":"","title":"A unified modular analysis of online and stochastic optimization: adaptivity, optimism, non-convexity","year":2016,"lang":"en","type":"article","venue":"Spiral (Imperial College London)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Modular design; Computer science; Optimism; Mathematical optimization; Mathematics; Economics; Psychology; Programming language; Financial economics","score_opus":0.021208500633754263,"score_gpt":0.26850188312055157,"score_spread":0.2472933824867973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903829737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030038701,0.00016828786,0.99389523,0.000265868,0.00002881178,0.000019458788,0.000021778824,0.000062497755,0.0025341266],"genre_scores_gemma":[0.57598585,0.0013619144,0.40912202,0.00062565727,0.0005201353,0.0004241675,0.00017393993,0.00050102366,0.011285285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988539,0.0004164507,0.00004770382,0.00018470004,0.00035763741,0.00013952637],"domain_scores_gemma":[0.9981042,0.001047457,0.00019282583,0.0002981238,0.00022560141,0.00013168441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003275192,0.0017632791,0.0012065168,0.0010347674,0.00045669713,0.0017734177,0.0022428841,0.0012192281,0.0037893546],"category_scores_gemma":[0.007322328,0.00067502854,0.001941269,0.0007634167,0.0025128352,0.003736902,0.003535419,0.0038382604,0.0007479674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036768473,0.00004060037,0.00031433476,0.0001092728,0.0000607155,0.00008615203,0.000088848064,0.3332564,0.002426363,0.64320934,0.0015787155,0.018792499],"study_design_scores_gemma":[0.0000062538984,0.000025047606,0.00008216422,0.0000120523255,0.000010190615,0.000016675553,0.000007709097,0.86552536,0.000475533,0.13298056,0.0008506799,0.000007721105],"about_ca_topic_score_codex":0.0010395343,"about_ca_topic_score_gemma":0.0009627963,"teacher_disagreement_score":0.0037893546,"about_ca_system_score_codex":0.0016471086,"about_ca_system_score_gemma":0.0013201532,"threshold_uncertainty_score":0.01732105},"labels":[],"label_agreement":null},{"id":"W2903934645","doi":"","title":"Online variance-reducing optimization","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Variance (accounting); Business","score_opus":0.074319189957712,"score_gpt":0.38425176134099914,"score_spread":0.3099325713832871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903934645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013476317,0.00087131077,0.9715389,0.000930052,0.00047491043,0.000054737047,0.0000861519,0.0006458852,0.011921691],"genre_scores_gemma":[0.50168324,0.0008136636,0.4659577,0.001040633,0.00070689985,0.00028391185,0.0005544239,0.00075511954,0.028204432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839157,0.0006683226,0.0000665473,0.00027211037,0.0004413494,0.00016009208],"domain_scores_gemma":[0.997922,0.0012102253,0.00012285446,0.00032758125,0.00032004993,0.00009734802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955318,0.0014488519,0.0020625943,0.00091114145,0.0006760918,0.0020996202,0.0017850796,0.0022684918,0.0067054415],"category_scores_gemma":[0.006133486,0.00076100155,0.0013485658,0.001360606,0.0011008804,0.0018749617,0.0026330473,0.0035288385,0.0014074825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025326968,0.00044196448,0.00046027385,0.00018439052,0.00016255313,0.000083374725,0.00007986992,0.6001364,0.0029783682,0.07471131,0.018373577,0.30213472],"study_design_scores_gemma":[0.000013591878,0.000026224056,0.000055998775,0.0000077559935,0.00001106061,0.000013435592,0.000004668165,0.9859871,0.0004398495,0.012484225,0.0009511334,0.0000049428004],"about_ca_topic_score_codex":0.0023076402,"about_ca_topic_score_gemma":0.0027147725,"teacher_disagreement_score":0.0067054415,"about_ca_system_score_codex":0.0010655522,"about_ca_system_score_gemma":0.0016180674,"threshold_uncertainty_score":0.02243191},"labels":[],"label_agreement":null},{"id":"W2904097672","doi":"10.22111/ieco.2018.26308.1072","title":"OSA: Orientation Search Algorithm","year":2019,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematical optimization; Algorithm; Particle swarm optimization; Set (abstract data type); Computer science; Series (stratigraphy); Orientation (vector space); Position (finance); Meta-optimization; Optimization problem; Optimization algorithm; Genetic algorithm; Metaheuristic; Mathematics","score_opus":0.24301169876003859,"score_gpt":0.5708841893507449,"score_spread":0.32787249059070633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904097672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01800811,0.0014726402,0.9334753,0.0006003065,0.0005256557,0.00030243787,0.000513054,0.004358693,0.040743716],"genre_scores_gemma":[0.29453725,0.0015577347,0.65605986,0.0008841409,0.00032114616,0.0007971955,0.00256032,0.0006366692,0.04264564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996985,0.00006179991,0.000019781392,0.000068249086,0.000097758115,0.000053929267],"domain_scores_gemma":[0.99979144,0.000051616575,0.000021233378,0.000044238423,0.000065652755,0.000025795236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040252513,0.0006907722,0.00069553166,0.00095628295,0.0005556271,0.0010920896,0.0008525107,0.00086512783,0.010217673],"category_scores_gemma":[0.0012118309,0.00019221118,0.0005234328,0.001089375,0.00052437914,0.0010350745,0.0012399801,0.0008737655,0.0042282958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042076752,0.00024059862,0.002557666,0.00024951316,0.00008080208,0.00011960259,0.000092522256,0.102513455,0.008279899,0.07694919,0.040208984,0.768287],"study_design_scores_gemma":[0.00026024392,0.00025047903,0.00137902,0.00005831261,0.000060009912,0.00035912052,0.00007773595,0.8302681,0.006893976,0.05217429,0.10817489,0.00004384607],"about_ca_topic_score_codex":0.0020232978,"about_ca_topic_score_gemma":0.0025458618,"teacher_disagreement_score":0.010217673,"about_ca_system_score_codex":0.00038715304,"about_ca_system_score_gemma":0.0015023256,"threshold_uncertainty_score":0.034181476},"labels":[],"label_agreement":null},{"id":"W2904101610","doi":"10.1142/s1469026818500220","title":"Multidirectional Grey Wolf Optimizer Algorithm for Solving Global Optimization Problems","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Minimax; Heuristics; Algorithm; Integer programming; Integer (computer science); Local search (optimization); Convergence (economics); Search algorithm; Mathematics","score_opus":0.035359440985362985,"score_gpt":0.348958549445557,"score_spread":0.313599108460194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904101610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009170547,0.00076835544,0.9870073,0.000115369825,0.000041027775,0.000046179775,0.00001902663,0.00021701146,0.002615109],"genre_scores_gemma":[0.3282992,0.0011827799,0.66408694,0.00030483052,0.000058129644,0.00044134224,0.00017106807,0.0001532491,0.0053024576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995166,0.00015154683,0.000028392808,0.00007597106,0.00017967717,0.000047882284],"domain_scores_gemma":[0.9997739,0.00010779473,0.000030127863,0.000023946835,0.000050716488,0.000013439237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085424667,0.00092629873,0.0011439746,0.0009056605,0.00042022756,0.0008646968,0.0013346391,0.001261747,0.0015973084],"category_scores_gemma":[0.0011450672,0.00045200164,0.0010681648,0.00089191674,0.00052607304,0.0010171623,0.00083035044,0.0010569914,0.00040131132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005446984,0.000057186175,0.0007832359,0.00018177109,0.0001972356,0.0001354801,0.0001224144,0.8558791,0.005484269,0.023793578,0.0018008834,0.11151044],"study_design_scores_gemma":[0.000023488077,0.000043338354,0.00014134154,0.00001338701,0.000022610442,0.00004161803,0.00001238331,0.9920439,0.0009846592,0.0046705543,0.0019939558,0.000008739577],"about_ca_topic_score_codex":0.0025316593,"about_ca_topic_score_gemma":0.0020374185,"teacher_disagreement_score":0.0025316593,"about_ca_system_score_codex":0.0005758132,"about_ca_system_score_gemma":0.00091588474,"threshold_uncertainty_score":0.0053435564},"labels":[],"label_agreement":null},{"id":"W2906805910","doi":"10.5430/air.v7n2p74","title":"Expansion of Particle Multi-Swarm Optimization","year":2018,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Swarm behaviour; Benchmark (surveying); Computer science; Metaheuristic; Mathematical optimization; Key (lock); Swarm intelligence; Algorithm; Artificial intelligence; Mathematics","score_opus":0.31086710282853114,"score_gpt":0.4640725909067391,"score_spread":0.15320548807820794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906805910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077196164,0.0008482744,0.98508376,0.00017570898,0.00013471367,0.00005249827,0.000020740958,0.0001458921,0.0058187596],"genre_scores_gemma":[0.5071302,0.0018893335,0.4826546,0.00026251105,0.0003153875,0.00037733425,0.00013756333,0.00010968906,0.007123344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.00020324672,0.00003020238,0.00008778106,0.00026992892,0.000029207062],"domain_scores_gemma":[0.9996038,0.00018277206,0.000034638404,0.00005341866,0.00010641049,0.000018917754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001064381,0.0007271708,0.00079038175,0.000637608,0.00030489193,0.00055075233,0.0008807837,0.0006570397,0.0014346123],"category_scores_gemma":[0.002389419,0.00024447558,0.0006510023,0.0007341061,0.00044911331,0.0010630474,0.0012041528,0.00090023084,0.0004194911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000685491,0.000070865106,0.0011362383,0.00021700158,0.000063579806,0.00013288046,0.00011165448,0.7426531,0.004609652,0.056583,0.0030246365,0.19132893],"study_design_scores_gemma":[0.000005984382,0.000019591836,0.00009940725,0.000006898579,0.0000057567045,0.000021614662,0.000004082356,0.9938793,0.0003871535,0.0033624342,0.0022041753,0.0000035121636],"about_ca_topic_score_codex":0.00135694,"about_ca_topic_score_gemma":0.00093382614,"teacher_disagreement_score":0.0014346123,"about_ca_system_score_codex":0.00035077802,"about_ca_system_score_gemma":0.0005076801,"threshold_uncertainty_score":0.005629003},"labels":[],"label_agreement":null},{"id":"W2909544216","doi":"10.1109/smc.2018.00055","title":"A New Optimization Algorithm Based on the Behavior of BrunsVigia Flower","year":2018,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Algorithm; Curse of dimensionality; Optimization algorithm; Property (philosophy); Optimization problem; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.02280422490466756,"score_gpt":0.2831225132978113,"score_spread":0.26031828839314375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909544216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02354163,0.000536046,0.97172886,0.00017695186,0.000099889454,0.00008260611,0.00005294556,0.0003140763,0.0034669852],"genre_scores_gemma":[0.35030082,0.0004568987,0.6447028,0.00017809047,0.000044927518,0.00034500402,0.00025820787,0.000117109885,0.0035960597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998209,0.000047171332,0.00001109346,0.000040861752,0.000054840642,0.000025204296],"domain_scores_gemma":[0.99982834,0.000077168756,0.000019162622,0.000011744738,0.0000500324,0.0000134260545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041091535,0.00055754837,0.00082553946,0.00064084685,0.00047109084,0.0005848938,0.0011192278,0.00096157426,0.00126372],"category_scores_gemma":[0.0008121306,0.0003000048,0.00079805014,0.0006673402,0.00042000908,0.00051639753,0.00058606145,0.0006301272,0.00020858277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010581233,0.00003962717,0.0015210343,0.00012831285,0.00007227944,0.00008925566,0.00008711334,0.86289823,0.013130442,0.012463485,0.0022970787,0.10716735],"study_design_scores_gemma":[0.000021306869,0.00003728273,0.00016241883,0.000006693975,0.000007683878,0.000042313764,0.000008960544,0.9956476,0.0010233488,0.0013716714,0.0016612009,0.000009533331],"about_ca_topic_score_codex":0.006465817,"about_ca_topic_score_gemma":0.0042891875,"teacher_disagreement_score":0.006465817,"about_ca_system_score_codex":0.00065567443,"about_ca_system_score_gemma":0.00088059035,"threshold_uncertainty_score":0.012856364},"labels":[],"label_agreement":null},{"id":"W2911022377","doi":"10.47749/t/unicamp.2017.986608","title":"Meta-heurísticas GRASP e BRKGA aplicadas ao problema da diversidade máxima","year":2017,"lang":"gl","type":"dissertation","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada); Adidas (Canada)","funders":"","keywords":"GRASP; Metaheuristic; Mathematical optimization; Path (computing); Sorting; Heuristics; Mathematics; Benchmark (surveying); Local search (optimization); Set (abstract data type); Function (biology); Fitness landscape; Greedy randomized adaptive search procedure; Computer science; Algorithm; Greedy algorithm; Population","score_opus":0.17508494056828378,"score_gpt":0.37026980972015305,"score_spread":0.19518486915186928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911022377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04823077,0.0028687506,0.93759876,0.00042369353,0.000120699515,0.0001804926,0.00013922762,0.0005895493,0.009848004],"genre_scores_gemma":[0.52046317,0.002561417,0.4711939,0.0002079355,0.000114299226,0.0005000311,0.00023624934,0.00018315967,0.0045398325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919456,0.00032869572,0.000035992307,0.00009938381,0.0002339141,0.000107394575],"domain_scores_gemma":[0.99893636,0.0006498147,0.0001687388,0.00008954201,0.00011619245,0.00003936215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012772883,0.0014459499,0.0013332766,0.0017166105,0.00053369283,0.0014614648,0.0013039378,0.0016761003,0.0022508502],"category_scores_gemma":[0.0031620597,0.00047522964,0.0016426546,0.0016356232,0.0007570725,0.0011572604,0.00089580374,0.0011102384,0.0004790702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071509596,0.000079994745,0.0005431947,0.00025746465,0.000110293935,0.00007792333,0.000056439912,0.92161083,0.0016854345,0.0146960085,0.00081369793,0.0599972],"study_design_scores_gemma":[0.000024214029,0.0000878911,0.00018789555,0.000041015177,0.00003850382,0.000080210586,0.000044516117,0.9886663,0.0012770732,0.007215254,0.002325639,0.000011533236],"about_ca_topic_score_codex":0.002076218,"about_ca_topic_score_gemma":0.002154288,"teacher_disagreement_score":0.0022508502,"about_ca_system_score_codex":0.0010793636,"about_ca_system_score_gemma":0.0014419326,"threshold_uncertainty_score":0.007831395},"labels":[],"label_agreement":null},{"id":"W2912697490","doi":"10.3311/ppci.12813","title":"Parallel Ant Colony Algorithm for Shortest Path Problem","year":2019,"lang":"en","type":"article","venue":"Periodica Polytechnica Civil Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Shortest path problem; Ant colony; Novelty; Cloud computing; Path (computing); Routing (electronic design automation); Algorithm; State (computer science); Swarm intelligence; Mathematical optimization; Artificial intelligence; Theoretical computer science; Particle swarm optimization; Mathematics; Computer network","score_opus":0.009268536292438226,"score_gpt":0.2346189388027018,"score_spread":0.22535040251026356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912697490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01702514,0.0018012569,0.9623774,0.00061711285,0.00021727956,0.00021952047,0.00019756418,0.00059260696,0.016952028],"genre_scores_gemma":[0.39355004,0.0022647153,0.5882786,0.00017137252,0.00014644687,0.00060363614,0.00060788885,0.00019346259,0.014183871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996333,0.000100038174,0.000018360368,0.000077647295,0.00012684238,0.000043798198],"domain_scores_gemma":[0.99976534,0.00010244748,0.00002800574,0.000020867508,0.000066931534,0.00001633897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031288236,0.00077913626,0.0009465083,0.00058399467,0.0005569232,0.00085675373,0.0011327297,0.000873205,0.0029421607],"category_scores_gemma":[0.001032715,0.00025573053,0.0005485914,0.0009814636,0.00034775186,0.00071762,0.0006794105,0.0010543378,0.0006150409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007747239,0.000067139925,0.00040653802,0.00025876838,0.000048712525,0.00016567827,0.000072562485,0.8691355,0.00337679,0.020505954,0.006161964,0.09972287],"study_design_scores_gemma":[0.0000261771,0.000030558953,0.00008276783,0.000009516018,0.000008869617,0.000071056034,0.000017787776,0.98393077,0.00051157665,0.010502393,0.0048012137,0.000007211669],"about_ca_topic_score_codex":0.0046606236,"about_ca_topic_score_gemma":0.003525676,"teacher_disagreement_score":0.0046606236,"about_ca_system_score_codex":0.0004957011,"about_ca_system_score_gemma":0.0013850557,"threshold_uncertainty_score":0.009842575},"labels":[],"label_agreement":null},{"id":"W2917147437","doi":"10.4018/ijcini.2019010104","title":"Performance Analyses of Differential Evolution Algorithm Based on Dynamic Fitness Landscape","year":2019,"lang":"en","type":"article","venue":"International Journal of Cognitive Informatics and Natural Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Differential evolution; Evolvability; Computer science; Fitness landscape; Benchmark (surveying); Evolutionary algorithm; Fitness approximation; Evolutionary computation; Rendering (computer graphics); Algorithm; Differential (mechanical device); Fitness function; Mathematical optimization; Artificial intelligence; Genetic algorithm; Machine learning; Mathematics","score_opus":0.018489961153369715,"score_gpt":0.33052501484002056,"score_spread":0.31203505368665085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917147437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3357054,0.002362929,0.63837016,0.0004953547,0.00011523516,0.00007578266,0.0001315781,0.0008095221,0.021934044],"genre_scores_gemma":[0.95875657,0.0004689035,0.03875352,0.000037244416,0.000012069324,0.000040154417,0.0001587172,0.00006278905,0.0017100346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993861,0.00016415854,0.000044598433,0.00008309675,0.00026100304,0.000061118386],"domain_scores_gemma":[0.998872,0.00067985815,0.000073680494,0.000086986496,0.00025893722,0.000028454164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010390353,0.00058972626,0.0005458385,0.001198835,0.00033175998,0.0008907477,0.0004463815,0.00050557026,0.0014347689],"category_scores_gemma":[0.003570387,0.0001396498,0.0004848315,0.00093415537,0.0003392717,0.0010071694,0.0004200906,0.0003801211,0.0001597123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018996299,0.000065387154,0.006581728,0.00013660877,0.00009495636,0.00011290325,0.000120628705,0.8432405,0.009769901,0.015923688,0.0010309845,0.122732736],"study_design_scores_gemma":[0.000005215809,0.00005906046,0.001130947,0.000005496822,0.0000113405695,0.000044752753,0.000015731614,0.9939427,0.0025366824,0.0017888773,0.00045089412,0.00000823541],"about_ca_topic_score_codex":0.002774693,"about_ca_topic_score_gemma":0.00097348396,"teacher_disagreement_score":0.002774693,"about_ca_system_score_codex":0.0007481028,"about_ca_system_score_gemma":0.0003727205,"threshold_uncertainty_score":0.005517125},"labels":[],"label_agreement":null},{"id":"W2920794693","doi":"10.4018/ijsir.2019040101","title":"Modified Firefly Algorithm With Chaos Theory for Feature Selection","year":2019,"lang":"en","type":"article","venue":"International Journal of Swarm Intelligence Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Firefly algorithm; Computer science; Particle swarm optimization; Feature selection; Maximization; Maxima and minima; Mathematical optimization; Algorithm; Hyperparameter optimization; Mutual information; Metaheuristic; Artificial intelligence; Support vector machine; Mathematics","score_opus":0.058083235880678985,"score_gpt":0.3974881111283455,"score_spread":0.3394048752476665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920794693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041908403,0.0003352197,0.99378383,0.00009741012,0.00005336494,0.00005640139,0.000031200907,0.00027397304,0.0011777272],"genre_scores_gemma":[0.17721856,0.00057692145,0.81599665,0.00015435148,0.000110005145,0.0005702966,0.00023205951,0.00011982218,0.0050213197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.00014461315,0.00003312443,0.00008566427,0.00022325422,0.000040080256],"domain_scores_gemma":[0.9996666,0.00014828343,0.00003576839,0.00003987053,0.0000962042,0.000013384918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056691,0.00085274014,0.0011039806,0.0011993136,0.0005551994,0.0006569981,0.0012610172,0.00094312493,0.0015171784],"category_scores_gemma":[0.0016324882,0.00035315737,0.0011619068,0.0013702889,0.00044068316,0.00091050105,0.00065249926,0.0009171811,0.0005863824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001679689,0.00010623644,0.0013219579,0.00019979775,0.00021242941,0.0001465656,0.00015087597,0.5057744,0.020045627,0.044132892,0.006261005,0.42148024],"study_design_scores_gemma":[0.00003095578,0.00005630522,0.00026577272,0.000008180039,0.000020117835,0.000077047574,0.0000068617937,0.9864194,0.0032229344,0.0056738365,0.00420211,0.00001653154],"about_ca_topic_score_codex":0.0021582618,"about_ca_topic_score_gemma":0.001369214,"teacher_disagreement_score":0.0021582618,"about_ca_system_score_codex":0.0006090379,"about_ca_system_score_gemma":0.00080627756,"threshold_uncertainty_score":0.0050754547},"labels":[],"label_agreement":null},{"id":"W2928383288","doi":"10.1007/s11590-019-01452-7","title":"Dynamic improvements of static surrogates in direct search optimization","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplicative function; Mathematical optimization; Context (archaeology); Computer science; Variable (mathematics); Quadratic equation; Surrogate model; Algorithm; Mathematics","score_opus":0.008472196214212488,"score_gpt":0.25822590222485003,"score_spread":0.24975370601063754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928383288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07237657,0.0022871515,0.87926614,0.00059493346,0.00070555764,0.000092784896,0.00011007796,0.0006109698,0.043955725],"genre_scores_gemma":[0.8234527,0.0008335768,0.16373351,0.00018353229,0.00016363976,0.00013187906,0.00015139343,0.00026827745,0.011081564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994337,0.00024348397,0.000019777113,0.00004647181,0.00021314112,0.000043414344],"domain_scores_gemma":[0.9989636,0.000519681,0.000070095346,0.00015555929,0.00024396877,0.00004702327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013954266,0.00075299543,0.0009236566,0.0006548461,0.0003765334,0.0010474854,0.0007871268,0.0010220561,0.004513708],"category_scores_gemma":[0.0052173976,0.0004435606,0.0004140346,0.000790558,0.00062082894,0.0011176389,0.0011323134,0.0010904757,0.00077166373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015982211,0.00008022691,0.00024897442,0.00007848043,0.000026637703,0.000049880673,0.000033444958,0.9074272,0.0022994915,0.023354826,0.0017002497,0.06454073],"study_design_scores_gemma":[0.0000094089855,0.000049330694,0.000048377802,0.00000872534,0.0000051149523,0.000013825737,0.0000040312775,0.9953413,0.0004610351,0.0031916853,0.00086372846,0.0000034661555],"about_ca_topic_score_codex":0.001044173,"about_ca_topic_score_gemma":0.001147536,"teacher_disagreement_score":0.004513708,"about_ca_system_score_codex":0.0005040351,"about_ca_system_score_gemma":0.000586473,"threshold_uncertainty_score":0.015099883},"labels":[],"label_agreement":null},{"id":"W2932517410","doi":"10.1007/978-981-13-6569-0_10","title":"Expectation Algorithm (ExA): A Socio-inspired Optimization Methodology","year":2019,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"CMA-ES; Backtracking; Algorithm; Mathematical optimization; Computer science; Wilcoxon signed-rank test; Particle swarm optimization; Optimization problem; Mathematics; Artificial intelligence; Evolution strategy; Evolutionary algorithm; Statistics","score_opus":0.2318761286488891,"score_gpt":0.41986661053555224,"score_spread":0.18799048188666315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932517410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018148781,0.0008826547,0.9875358,0.00036284392,0.000118012205,0.00003110906,0.000045947974,0.00012653052,0.009082308],"genre_scores_gemma":[0.14795715,0.0027473117,0.8361814,0.000381967,0.0002620147,0.00037336524,0.00017035157,0.00019680934,0.011729624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994036,0.00033238364,0.0000238,0.000057689864,0.00015434765,0.000028117403],"domain_scores_gemma":[0.99926156,0.0005415666,0.000059691614,0.00004149697,0.00006924493,0.000026536438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014071113,0.0008009719,0.00083833997,0.00069717516,0.00044833546,0.0015276492,0.0014079255,0.0013707993,0.0048854123],"category_scores_gemma":[0.0029381798,0.00026169434,0.000915732,0.0014528206,0.00092004886,0.0014522113,0.0014669033,0.0013493039,0.00096894987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002989444,0.000068557216,0.00064953713,0.0002303379,0.0001270513,0.00007128754,0.00009663728,0.3396074,0.00089527114,0.50474334,0.006491582,0.14698918],"study_design_scores_gemma":[0.000018441156,0.000052684787,0.00020469024,0.00005355856,0.000027819544,0.0000821086,0.00003461934,0.7731788,0.0005677084,0.20988095,0.015878651,0.000020013373],"about_ca_topic_score_codex":0.0012501773,"about_ca_topic_score_gemma":0.001441395,"teacher_disagreement_score":0.0048854123,"about_ca_system_score_codex":0.0006215536,"about_ca_system_score_gemma":0.0011107911,"threshold_uncertainty_score":0.016343296},"labels":[],"label_agreement":null},{"id":"W2941876110","doi":"","title":"A Novel Orthogonal Direction Mesh Adaptive Direct Search Approach for SVM Hyperparameter Tuning","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Hyperparameter; Computer science; Support vector machine; Maxima and minima; Benchmark (surveying); Mathematical optimization; Hyperparameter optimization; Algorithm; Gaussian; Artificial intelligence; Mathematics; Machine learning","score_opus":0.15542877817283618,"score_gpt":0.23399246412884456,"score_spread":0.07856368595600838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941876110","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004593721,0.00022156056,0.9937364,0.00006750001,0.000032591324,0.000034884884,0.000015411077,0.00022959428,0.001068282],"genre_scores_gemma":[0.1992886,0.00020723816,0.7973311,0.0002508352,0.00008293658,0.00038083267,0.0001355235,0.00015480725,0.002168012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993691,0.00024763244,0.000032787844,0.000106328196,0.00019996118,0.000044264205],"domain_scores_gemma":[0.9993311,0.00034380925,0.00007234991,0.00006069607,0.00015867612,0.00003343581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011226471,0.0008217139,0.0010074184,0.0011006733,0.00033190395,0.0007946251,0.0013973761,0.0013958758,0.0021175244],"category_scores_gemma":[0.0026386569,0.00057065394,0.0008941776,0.0006739078,0.00053474127,0.0007590779,0.00096894894,0.00093780464,0.00056584115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095845644,0.00008644048,0.000965849,0.00013151657,0.00010889765,0.00006653372,0.000076561286,0.7692453,0.005573776,0.011491178,0.002135072,0.21002308],"study_design_scores_gemma":[0.000014634681,0.000020130421,0.000054609747,0.000004720888,0.0000046511245,0.000012784014,0.000004015225,0.9974721,0.00034149815,0.0013791642,0.0006878868,0.000003792327],"about_ca_topic_score_codex":0.0018117126,"about_ca_topic_score_gemma":0.0023159822,"teacher_disagreement_score":0.0021175244,"about_ca_system_score_codex":0.00048571688,"about_ca_system_score_gemma":0.00087299285,"threshold_uncertainty_score":0.0070837736},"labels":[],"label_agreement":null},{"id":"W2943484134","doi":"10.13164/mendel.2018.1.001","title":"Increasing Population (μ + λ)-CMA-ES with Centre and Elitism (IPOP!+)","year":2018,"lang":"en","type":"article","venue":"MENDEL","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Elitism; Population; Operator (biology); Selection (genetic algorithm); Mathematics; Computer science; Artificial intelligence; Sociology; Biology; Political science; Genetics; Demography","score_opus":0.014122309049467126,"score_gpt":0.25796643456351354,"score_spread":0.2438441255140464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943484134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04666036,0.00073297636,0.9351967,0.00037681017,0.00018189143,0.00023021776,0.00013158836,0.0020624802,0.014426968],"genre_scores_gemma":[0.4150204,0.00045322286,0.57446516,0.00063320406,0.00009257034,0.0006356004,0.00029602175,0.00047325305,0.007930461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984633,0.00057520525,0.00008314378,0.00024700418,0.0004544675,0.00017686683],"domain_scores_gemma":[0.9972638,0.0013534242,0.00025199784,0.00042244015,0.0005779554,0.00013029712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031210438,0.0011885795,0.001265267,0.0011897343,0.0008794235,0.0013288257,0.0026249916,0.0016139562,0.0042077326],"category_scores_gemma":[0.0080247335,0.0003797587,0.0013067655,0.001080571,0.0009736736,0.0012706853,0.0022074485,0.0021708494,0.0014868892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046569173,0.00048553568,0.005013593,0.00074038847,0.0003284331,0.0004028059,0.0006593663,0.4009124,0.025399718,0.057910897,0.010437619,0.4972436],"study_design_scores_gemma":[0.00011308732,0.0005465774,0.0010878795,0.00010006912,0.00013975704,0.00043170736,0.00009795483,0.9390572,0.019057725,0.022847509,0.016447457,0.0000730798],"about_ca_topic_score_codex":0.0013023497,"about_ca_topic_score_gemma":0.001263977,"teacher_disagreement_score":0.0042077326,"about_ca_system_score_codex":0.0011196049,"about_ca_system_score_gemma":0.0013412839,"threshold_uncertainty_score":0.016505897},"labels":[],"label_agreement":null},{"id":"W2946653631","doi":"10.3233/jifs-179042","title":"Cellular Estimation Gaussian Algorithm for Continuous Domain","year":2019,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Estimation of distribution algorithm; EDAS; Benchmark (surveying); Computer science; Gaussian; Algorithm; Domain (mathematical analysis); Fitness function; Independence (probability theory); Genetic algorithm; Artificial intelligence; Mathematical optimization; Pattern recognition (psychology); Face (sociological concept); Mathematics; Machine learning; Statistics","score_opus":0.016922968185648004,"score_gpt":0.2768238549748743,"score_spread":0.2599008867892263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946653631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038521949,0.00036849137,0.9929548,0.0001000315,0.000046837027,0.000019466886,0.00001919656,0.00021212382,0.002426911],"genre_scores_gemma":[0.39807978,0.00091909803,0.5888472,0.00022631207,0.00009245904,0.0003299281,0.0002526558,0.00012763814,0.011124905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967945,0.000091049784,0.000014879424,0.00007681916,0.000096774864,0.000041016854],"domain_scores_gemma":[0.99952984,0.00021179221,0.0000392962,0.000064476044,0.00013423896,0.000020337104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053481286,0.0005624997,0.0006646693,0.000581829,0.00039566986,0.0011575376,0.000911039,0.0009233315,0.0031298257],"category_scores_gemma":[0.0019921768,0.00016762542,0.00048723974,0.00086897693,0.00078141893,0.0007681963,0.0010095119,0.00096383016,0.00091049453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101872894,0.000042447304,0.00089735957,0.0001003044,0.000054356464,0.000101394275,0.00013168367,0.62665075,0.004968216,0.13539883,0.004269972,0.22728278],"study_design_scores_gemma":[0.000010847088,0.000023819086,0.0001024646,0.000007781789,0.0000070170645,0.000036360732,0.0000131757315,0.9841501,0.0009335195,0.010743914,0.0039628204,0.0000081339],"about_ca_topic_score_codex":0.0045491033,"about_ca_topic_score_gemma":0.0031074954,"teacher_disagreement_score":0.0045491033,"about_ca_system_score_codex":0.0007409638,"about_ca_system_score_gemma":0.001112849,"threshold_uncertainty_score":0.010470331},"labels":[],"label_agreement":null},{"id":"W2947748448","doi":"10.3390/info10060184","title":"FPGA Implementation of Crossover Module of Genetic Algorithm","year":2019,"lang":"en","type":"article","venue":"Information","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Field-programmable gate array; Computer science; Travelling salesman problem; Genetic algorithm; Parallel computing; Software; Realization (probability); Computer architecture; Field (mathematics); Algorithm; Embedded system; Operating system; Mathematics; Artificial intelligence","score_opus":0.009378328181832317,"score_gpt":0.28732289737290556,"score_spread":0.27794456919107324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947748448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14538847,0.0013970466,0.81496835,0.00032599378,0.00044756467,0.00018204344,0.00020977044,0.008085169,0.02899566],"genre_scores_gemma":[0.7948558,0.00048814717,0.19707212,0.00011118731,0.00007177512,0.00007184415,0.00020312493,0.00008063401,0.007045534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999879,0.000021681735,0.0000057819416,0.000021347852,0.00004736426,0.00002477476],"domain_scores_gemma":[0.9999217,0.000019729883,0.000010568928,0.000014184093,0.000028007502,0.000005775586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010794729,0.00024216702,0.00018671436,0.0003959319,0.00017520864,0.00032622393,0.0005171625,0.00023813768,0.003121318],"category_scores_gemma":[0.00025745772,0.000107695305,0.00015347164,0.00027548627,0.00010033861,0.00020492208,0.000106297826,0.00026610264,0.0005334032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000719196,0.000139525,0.0028606688,0.00046233574,0.00010873256,0.0009403619,0.00019460969,0.06463028,0.2849055,0.020369545,0.0077904635,0.61687887],"study_design_scores_gemma":[0.0003669438,0.0016837902,0.008860919,0.000117770636,0.00014290694,0.0034153853,0.00007484886,0.43639636,0.4633735,0.0041064676,0.08137475,0.000086378066],"about_ca_topic_score_codex":0.0011290299,"about_ca_topic_score_gemma":0.00082339393,"teacher_disagreement_score":0.003121318,"about_ca_system_score_codex":0.00022412598,"about_ca_system_score_gemma":0.00027792205,"threshold_uncertainty_score":0.01044184},"labels":[],"label_agreement":null},{"id":"W2950684230","doi":"10.1007/s12065-019-00255-0","title":"A hybridization of cuckoo search and particle swarm optimization for solving nonlinear systems","year":2019,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cuckoo search; Computer science; Benchmark (surveying); Particle swarm optimization; Mathematical optimization; Nonlinear system; Algorithm; Jacobian matrix and determinant; Maxima and minima; Mathematics; Applied mathematics","score_opus":0.027030708892089632,"score_gpt":0.28929755897404397,"score_spread":0.26226685008195433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950684230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046397734,0.0014516822,0.91880363,0.0005629352,0.00062067603,0.00030683848,0.000066838635,0.0011621118,0.030627536],"genre_scores_gemma":[0.5291031,0.00067886553,0.4580059,0.00035306835,0.000254116,0.0003825608,0.000119853226,0.00030119804,0.010801391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995003,0.00015472175,0.000021401762,0.000048531874,0.00024301441,0.000031913172],"domain_scores_gemma":[0.99952006,0.00022807694,0.000022020748,0.000051676485,0.00014832195,0.000029789522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095947855,0.0008051904,0.0010367107,0.0008729409,0.00062020624,0.0007757121,0.0012034711,0.0013890867,0.002731328],"category_scores_gemma":[0.0020805993,0.00042202423,0.0005524918,0.0011305189,0.0005610789,0.0009057351,0.0008774369,0.00091564516,0.0005945913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002819848,0.00027455777,0.0010775344,0.00037042753,0.00026996073,0.0001714787,0.00018383264,0.7200536,0.014301173,0.02582371,0.004144671,0.23304702],"study_design_scores_gemma":[0.000025597188,0.000076826545,0.00018074679,0.000010585671,0.000017915292,0.000024172308,0.0000097433685,0.994882,0.000882074,0.001581762,0.0022997244,0.000008879833],"about_ca_topic_score_codex":0.0061615207,"about_ca_topic_score_gemma":0.0067601614,"teacher_disagreement_score":0.0061615207,"about_ca_system_score_codex":0.00047112297,"about_ca_system_score_gemma":0.00070054625,"threshold_uncertainty_score":0.0122513175},"labels":[],"label_agreement":null},{"id":"W2952134149","doi":"","title":"Micro-Differential Evolution: Diversity Enhancement and Comparative Study","year":2015,"lang":"en","type":"preprint","venue":"e-scholar@UOIT (University of Ontario Institute of Technology)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Benchmark (surveying); Differential evolution; Mutation; Premature convergence; Convergence (economics); Population; Population size; Computer science; Mathematical optimization; Algorithm; Local optimum; Evolutionary algorithm; Mathematics; Artificial intelligence; Geography; Particle swarm optimization; Biology","score_opus":0.0564197442637231,"score_gpt":0.26809129027884737,"score_spread":0.21167154601512428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952134149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54170394,0.034166068,0.3370658,0.0011164218,0.00032128714,0.00023187383,0.0003379467,0.00064573524,0.08441089],"genre_scores_gemma":[0.9422381,0.0044893203,0.049263384,0.0000711442,0.000056233657,0.00005694701,0.00018064167,0.000031289495,0.0036129178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995635,0.0001229892,0.000018943692,0.00005058492,0.0002070375,0.0000369101],"domain_scores_gemma":[0.9987992,0.0007677586,0.00006163554,0.00011132062,0.0002239995,0.000036121633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326765,0.00032330456,0.0004902988,0.0011032525,0.0002483977,0.0006467353,0.0005247246,0.00039430693,0.0014602281],"category_scores_gemma":[0.0024085965,0.00011304235,0.0004236791,0.0011999146,0.00026020157,0.00070398353,0.00055381306,0.00038381445,0.00012634043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017985691,0.00016025877,0.006022496,0.0005752222,0.0001169345,0.00019547316,0.00011635504,0.6325904,0.006398738,0.025911542,0.002589868,0.3251428],"study_design_scores_gemma":[0.000012294795,0.00021985681,0.0025535247,0.00003266422,0.000027969043,0.00019037804,0.00004340722,0.98581463,0.0033941013,0.0025028624,0.0051942333,0.000014119408],"about_ca_topic_score_codex":0.0014703108,"about_ca_topic_score_gemma":0.0012688973,"teacher_disagreement_score":0.0014703108,"about_ca_system_score_codex":0.000564275,"about_ca_system_score_gemma":0.00026904582,"threshold_uncertainty_score":0.0048849583},"labels":[],"label_agreement":null},{"id":"W2954659334","doi":"10.1016/j.ins.2019.07.016","title":"A parameter-free particle swarm optimization algorithm using performance classifiers","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Multi-swarm optimization; Computer science; Term (time); Mathematical optimization; Basis (linear algebra); Set (abstract data type); Algorithm; Swarm behaviour; Metaheuristic; Mathematics; Artificial intelligence","score_opus":0.04348540951782416,"score_gpt":0.29345685362402735,"score_spread":0.2499714441062032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954659334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072621848,0.00017539534,0.98858637,0.00013172344,0.00012205105,0.000078713,0.000031054307,0.0005186761,0.003093771],"genre_scores_gemma":[0.21200942,0.00019471916,0.7819882,0.00017693217,0.00013090853,0.00032765185,0.00019477896,0.00017015189,0.004807243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.00013505036,0.000038489496,0.00009751118,0.00024002358,0.000044975182],"domain_scores_gemma":[0.9991135,0.00033150063,0.00007472779,0.000112196714,0.0003283614,0.000039746225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017037538,0.000987631,0.0016205619,0.0010159343,0.000823323,0.0012955207,0.001539608,0.0020012856,0.0023466551],"category_scores_gemma":[0.0037165564,0.00059704797,0.0007961292,0.0010329225,0.0005801915,0.0014361133,0.0012393413,0.0013746493,0.0010508923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019696409,0.00013477681,0.0006496193,0.00009458664,0.00009596418,0.000044555276,0.000053202955,0.67311704,0.003397391,0.012936244,0.0039109644,0.30536866],"study_design_scores_gemma":[0.000012508674,0.000024020332,0.00005730836,0.0000036842482,0.000007137199,0.000007280682,0.0000020869136,0.998245,0.000393296,0.0008104327,0.0004341387,0.0000031828095],"about_ca_topic_score_codex":0.0043906374,"about_ca_topic_score_gemma":0.0026262389,"teacher_disagreement_score":0.0043906374,"about_ca_system_score_codex":0.0007814312,"about_ca_system_score_gemma":0.0011877262,"threshold_uncertainty_score":0.009010434},"labels":[],"label_agreement":null},{"id":"W2954693883","doi":"10.1007/s12530-019-09291-8","title":"A hybridization of grey wolf optimizer and differential evolution for solving nonlinear systems","year":2019,"lang":"en","type":"article","venue":"Evolving Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Benchmark (surveying); Nonlinear system; Differential evolution; Computer science; Parametric statistics; Mathematical optimization; Wilcoxon signed-rank test; Dimension (graph theory); Optimization problem; Algorithm; Mathematics; Artificial intelligence; Statistics","score_opus":0.013778275741461258,"score_gpt":0.25152922724335797,"score_spread":0.2377509515018967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954693883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024923299,0.0007444612,0.96207094,0.00030793957,0.00019809848,0.000091769216,0.00002352611,0.00053115975,0.011108775],"genre_scores_gemma":[0.42258146,0.000590563,0.5683386,0.0003150934,0.00013717565,0.00020210199,0.00006551256,0.00018791361,0.0075815655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996294,0.000113204136,0.000020329588,0.000044800247,0.00016050458,0.000031724085],"domain_scores_gemma":[0.9997172,0.00014607309,0.00001557936,0.000032712982,0.000067874535,0.000020492202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010008548,0.00057827303,0.0011248431,0.0007050964,0.00034430853,0.00073879806,0.0011269507,0.0013605464,0.0024940476],"category_scores_gemma":[0.0013887198,0.00037171697,0.00072819577,0.00086812535,0.0005290504,0.0007903286,0.0011372307,0.0009667353,0.0005668095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013875883,0.00018903604,0.0007766555,0.0002827065,0.00022330997,0.00021843948,0.00021543614,0.70905775,0.020717002,0.040203255,0.0020115203,0.22596602],"study_design_scores_gemma":[0.000014494734,0.00006541608,0.00010384077,0.000008774421,0.000017291995,0.00002686041,0.00000702907,0.994584,0.0009367634,0.0026075277,0.0016217426,0.0000063198822],"about_ca_topic_score_codex":0.0018908827,"about_ca_topic_score_gemma":0.0018130428,"teacher_disagreement_score":0.0024940476,"about_ca_system_score_codex":0.00044627476,"about_ca_system_score_gemma":0.0005129539,"threshold_uncertainty_score":0.008343399},"labels":[],"label_agreement":null},{"id":"W2955270668","doi":"10.1145/3321707.3321724","title":"Large-scale noise-resilient evolution-strategies","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fondation Pour La Conservation Du Saumon Atlantique","keywords":"Computer science; Noise (video); Ranking (information retrieval); Weighting; Mathematical optimization; Stochastic gradient descent; Algorithm; Bounded function; Curse of dimensionality; Reinforcement learning; Mathematics; Artificial intelligence; Artificial neural network","score_opus":0.012223312574504394,"score_gpt":0.24314924502124322,"score_spread":0.2309259324467388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955270668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020768657,0.000115777715,0.9766167,0.000108180386,0.000023519358,0.000055044333,0.000016043918,0.00036010417,0.001935928],"genre_scores_gemma":[0.81251657,0.00013545253,0.18300967,0.00015355795,0.00002852949,0.00022683037,0.00007735073,0.00013090951,0.003721089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994048,0.00021969558,0.000032766417,0.000104848936,0.00018224835,0.000055616118],"domain_scores_gemma":[0.9982697,0.0010988587,0.00015068748,0.00017529904,0.00023527344,0.00007023087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014396426,0.0008912303,0.001054268,0.00046207733,0.0004499367,0.0009291609,0.00134319,0.0010870369,0.0012463239],"category_scores_gemma":[0.0051697516,0.00045237795,0.0004939297,0.000405214,0.0008985645,0.0008751083,0.0012865087,0.0010479924,0.00038977584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026912423,0.000025309793,0.000290006,0.000025333531,0.000024838797,0.00004491913,0.000040683735,0.9648784,0.0016100325,0.01126177,0.00038658394,0.021385318],"study_design_scores_gemma":[0.000003896152,0.000011759102,0.00003247978,0.0000020353366,0.0000024149483,0.0000076061538,0.0000022378115,0.9972511,0.00024344602,0.0022766395,0.00016389802,0.0000025065217],"about_ca_topic_score_codex":0.0022270223,"about_ca_topic_score_gemma":0.001826168,"teacher_disagreement_score":0.0022270223,"about_ca_system_score_codex":0.0008518919,"about_ca_system_score_gemma":0.00072081434,"threshold_uncertainty_score":0.007613659},"labels":[],"label_agreement":null},{"id":"W2957818796","doi":"10.1007/s12065-019-00246-1","title":"Chemical reaction optimization: survey on variants","year":2019,"lang":"en","type":"article","venue":"Evolutionary Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Metaheuristic; Tabu search; Ant colony optimization algorithms; Computer science; Simulated annealing; Meta-optimization; Parallel metaheuristic; Mathematical optimization; Robustness (evolution); Particle swarm optimization; Genetic algorithm; Optimization problem; Multi-swarm optimization; Algorithm; Machine learning; Mathematics","score_opus":0.03461061903126983,"score_gpt":0.293270391387825,"score_spread":0.2586597723565552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957818796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015131403,0.41384506,0.5112324,0.0012748487,0.000981128,0.00017141922,0.00041123136,0.0004427447,0.056509707],"genre_scores_gemma":[0.24026944,0.3632785,0.37554374,0.0010098594,0.002014787,0.00047713344,0.0014592598,0.00072277535,0.015224369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914944,0.00020670913,0.00008951381,0.00017292322,0.00032541287,0.000055933993],"domain_scores_gemma":[0.9992343,0.00046823316,0.000049511782,0.00010207123,0.0001199273,0.000025826905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013645393,0.0017203924,0.0021597615,0.0016178817,0.00040488792,0.0018634294,0.002231203,0.001201045,0.0028057524],"category_scores_gemma":[0.0023081496,0.0006635288,0.0016123803,0.004881851,0.00073788373,0.0015382965,0.0013962628,0.001557387,0.0009776452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012783919,0.00021068762,0.0013279965,0.0025546344,0.00032374347,0.000068466295,0.000060367733,0.20473537,0.0017374835,0.085192315,0.008107312,0.6955538],"study_design_scores_gemma":[0.00011009705,0.0005595427,0.0015581669,0.0010081512,0.00039537926,0.0005654604,0.00010877775,0.684914,0.0027363158,0.11311962,0.19484462,0.00007988218],"about_ca_topic_score_codex":0.0019218698,"about_ca_topic_score_gemma":0.0014619833,"teacher_disagreement_score":0.0028057524,"about_ca_system_score_codex":0.00059498666,"about_ca_system_score_gemma":0.0008747831,"threshold_uncertainty_score":0.009386122},"labels":[],"label_agreement":null},{"id":"W2961079568","doi":"10.5267/j.ijiec.2019.6.002","title":"Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":327,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Algorithm; Simple (philosophy); Dimension (graph theory); Mathematical optimization; Computer science; Optimization problem; Optimization algorithm; Continuous optimization; Process (computing); Mathematics; Multi-swarm optimization","score_opus":0.06204859873689692,"score_gpt":0.3061649612971565,"score_spread":0.24411636256025956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961079568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044396925,0.000490572,0.99105513,0.00010415536,0.000077945406,0.00015378301,0.00004341432,0.0009448189,0.0026905313],"genre_scores_gemma":[0.05139292,0.00044496736,0.94331175,0.00019763279,0.00008354903,0.0006522962,0.00016059728,0.00030394996,0.003452429],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986093,0.0005211755,0.00008420133,0.00016434616,0.0005223052,0.00009862166],"domain_scores_gemma":[0.99851424,0.0007134895,0.00020940723,0.00024287842,0.00022957643,0.00009039045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016577117,0.002149701,0.0019713775,0.0016793294,0.00057842466,0.0015498225,0.002876843,0.0023612396,0.0050907345],"category_scores_gemma":[0.0052272445,0.0006800185,0.0016215915,0.0015857145,0.0011475404,0.001684176,0.002120752,0.0018933078,0.0019469407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025989316,0.00022542417,0.0008968927,0.0006801115,0.00023118198,0.00010522738,0.00017872709,0.4161955,0.007486544,0.062320802,0.0072009643,0.5042187],"study_design_scores_gemma":[0.000121762605,0.00023697608,0.0003201217,0.000044478864,0.00004510818,0.00014902937,0.000037396923,0.97041893,0.0027534992,0.015183357,0.010625823,0.0000636268],"about_ca_topic_score_codex":0.0014031951,"about_ca_topic_score_gemma":0.002578373,"teacher_disagreement_score":0.0050907345,"about_ca_system_score_codex":0.00068388553,"about_ca_system_score_gemma":0.001470119,"threshold_uncertainty_score":0.01703024},"labels":[],"label_agreement":null},{"id":"W2963239290","doi":"10.1007/s10479-019-03343-7","title":"Biologically Inspired Parent Selection in Genetic Algorithms","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Quality control and genetic algorithms; Genetic algorithm; Selection (genetic algorithm); Computer science; Genetic representation; Theory of computation; Algorithm; Mathematical optimization; Simple (philosophy); Artificial intelligence; Meta-optimization; Mathematics; Machine learning","score_opus":0.23378032836205606,"score_gpt":0.45118896427990646,"score_spread":0.2174086359178504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963239290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018847164,0.010509723,0.95464253,0.0011002127,0.00060962595,0.000044832283,0.000033459844,0.0001284052,0.014084032],"genre_scores_gemma":[0.532904,0.010238583,0.44518152,0.00040960385,0.0006395418,0.00017261872,0.0000923057,0.00015076733,0.010211121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991497,0.00050988584,0.000022808019,0.00006481049,0.0002215461,0.00003134327],"domain_scores_gemma":[0.99873716,0.0009092168,0.00008163371,0.00009330992,0.00015590822,0.000022678681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015178337,0.00040430087,0.000592567,0.00060385413,0.00045095308,0.0013602005,0.0010712398,0.0016327688,0.0018536142],"category_scores_gemma":[0.0057929177,0.00036947918,0.00031950715,0.0013206896,0.001473228,0.0014010833,0.00061059115,0.0015580263,0.0004247182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005579044,0.00006022412,0.000940874,0.0002651555,0.00007062284,0.0001300077,0.0002343987,0.5013291,0.0039043175,0.33188248,0.0032245796,0.1579024],"study_design_scores_gemma":[0.000029959112,0.00006553765,0.00043009527,0.000089381705,0.00003479065,0.00011305815,0.00004604145,0.8065207,0.0014493328,0.18076979,0.010433007,0.000018312783],"about_ca_topic_score_codex":0.0014160494,"about_ca_topic_score_gemma":0.0012980192,"teacher_disagreement_score":0.0018536142,"about_ca_system_score_codex":0.00071746,"about_ca_system_score_gemma":0.00068986067,"threshold_uncertainty_score":0.008027136},"labels":[],"label_agreement":null},{"id":"W2964295186","doi":"","title":"An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Computer science; Ant colony; Metaheuristic; Ant colony optimization algorithms; Node (physics); Set (abstract data type); Mathematics; Engineering","score_opus":0.07879904856835628,"score_gpt":0.21999015396789937,"score_spread":0.1411911053995431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964295186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029773317,0.00033608094,0.9596365,0.00016951298,0.000092073176,0.00015339594,0.000045584133,0.0004228114,0.009370654],"genre_scores_gemma":[0.47871095,0.0003383165,0.51447904,0.00012879852,0.00006188632,0.00036273536,0.00015124622,0.000089443165,0.0056775673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996897,0.00009607678,0.000014545833,0.00005517983,0.00011563735,0.000028883598],"domain_scores_gemma":[0.9997842,0.00008083814,0.000026130592,0.000027778835,0.00006262057,0.000018539069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038661514,0.0005336557,0.0005948889,0.00035886024,0.0004161185,0.00069360185,0.0011997324,0.00070632953,0.0018687858],"category_scores_gemma":[0.0009901489,0.0002046651,0.0003820198,0.00058965484,0.00036594865,0.0005803646,0.0007125985,0.000627024,0.00038648854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067684,0.000078422614,0.0004008888,0.00011752952,0.000047034613,0.0001557649,0.00008018549,0.8644443,0.0076368493,0.029421164,0.0025088643,0.095041335],"study_design_scores_gemma":[0.000014654742,0.000029778867,0.00004286309,0.0000026976068,0.0000062803774,0.00002671874,0.0000067656715,0.9954066,0.00042337325,0.0023964804,0.0016396217,0.0000041879844],"about_ca_topic_score_codex":0.0025463195,"about_ca_topic_score_gemma":0.0030790458,"teacher_disagreement_score":0.0025463195,"about_ca_system_score_codex":0.00036994406,"about_ca_system_score_gemma":0.00087898504,"threshold_uncertainty_score":0.006251693},"labels":[],"label_agreement":null},{"id":"W2965549869","doi":"10.24963/ijcai.2019/867","title":"Optimally Efficient Bidirectional Search","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Hebrew University of Jerusalem; National Science Foundation","keywords":"Computer science; Heuristic; Bidirectional search; Efficient algorithm; Algorithm; Mathematical optimization; Node (physics); Search algorithm; Best-first search; Mathematics; Beam search","score_opus":0.017984793049340395,"score_gpt":0.27779904959208485,"score_spread":0.2598142565427444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965549869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11910669,0.0005322437,0.84835654,0.0003645544,0.00006545064,0.00010198321,0.00022037997,0.0005102313,0.030741919],"genre_scores_gemma":[0.7163377,0.00027101877,0.27693826,0.00017085686,0.00003605408,0.00023557345,0.00031736156,0.00017441309,0.005518803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987902,0.0004977363,0.00006229916,0.00021496788,0.00021336882,0.00022144464],"domain_scores_gemma":[0.99807835,0.0010624989,0.00021224863,0.00035167043,0.00021489189,0.00008035576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013041296,0.00055055204,0.0009365086,0.0008113717,0.00064867764,0.0014453317,0.0010303515,0.0015135499,0.003979988],"category_scores_gemma":[0.007139847,0.0003301011,0.0005362145,0.0010254497,0.0006096741,0.0017874797,0.0013328006,0.00075838674,0.00075634953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005197809,0.00025982564,0.0016914991,0.00022492297,0.0000702077,0.00008321437,0.000151926,0.55053145,0.0074161366,0.18377239,0.005049489,0.25022918],"study_design_scores_gemma":[0.00004859245,0.00013046782,0.000297321,0.00004755253,0.000023735656,0.00009619792,0.00009023644,0.91008395,0.0034544696,0.081597574,0.004114332,0.000015528385],"about_ca_topic_score_codex":0.0012349919,"about_ca_topic_score_gemma":0.0016106847,"teacher_disagreement_score":0.003979988,"about_ca_system_score_codex":0.0006582403,"about_ca_system_score_gemma":0.0014785039,"threshold_uncertainty_score":0.013314366},"labels":[],"label_agreement":null},{"id":"W2965568940","doi":"10.4018/ijamc.2019070102","title":"Cooperative Asynchronous Parallel Particle Swarm Optimization for Large Dimensional Problems","year":2019,"lang":"en","type":"article","venue":"International Journal of Applied Metaheuristic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Metaheuristic; Asynchronous communication; Parallel metaheuristic; Particle swarm optimization; Computer science; Multi-swarm optimization; Mathematical optimization; Swarm behaviour; Optimization problem; Distributed computing; Algorithm; Artificial intelligence; Mathematics","score_opus":0.01689514643104261,"score_gpt":0.2886573688923704,"score_spread":0.2717622224613278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965568940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034766052,0.0003273983,0.9591571,0.00023539487,0.000104928076,0.00006164675,0.00002036748,0.0002838697,0.0050432603],"genre_scores_gemma":[0.8184095,0.00040429595,0.17637312,0.00009358818,0.00011555166,0.00022866862,0.000063306696,0.0000636008,0.0042484524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967754,0.00011338311,0.000015277641,0.000047800015,0.000115210714,0.000030844913],"domain_scores_gemma":[0.99946684,0.00028667672,0.000059212372,0.00005800423,0.00009209968,0.000037146783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095782394,0.0006157972,0.00062823505,0.000403953,0.00049957435,0.0006709296,0.00092962757,0.0007273434,0.00092602306],"category_scores_gemma":[0.0016228025,0.00027411812,0.0005328935,0.00046719197,0.0005154924,0.0005676256,0.0008127216,0.00069651636,0.00019946003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008902646,0.00005886175,0.000583888,0.000076274104,0.000038590115,0.00009725073,0.00005942545,0.9508432,0.003366503,0.01237691,0.0009560673,0.031453975],"study_design_scores_gemma":[0.000010592187,0.000013299066,0.000043074393,8.8476764e-7,0.000002948531,0.0000049349837,0.0000028587162,0.9978508,0.00023045958,0.0015348647,0.00030408835,0.0000012710885],"about_ca_topic_score_codex":0.0031111268,"about_ca_topic_score_gemma":0.0026044052,"teacher_disagreement_score":0.0031111268,"about_ca_system_score_codex":0.00041010213,"about_ca_system_score_gemma":0.000799621,"threshold_uncertainty_score":0.0061860085},"labels":[],"label_agreement":null},{"id":"W2965831557","doi":"10.4018/ijamc.2019100102","title":"Solving Heterogeneous Big Data Mining Problems Using Multi-Objective Optimization","year":2019,"lang":"en","type":"article","venue":"International Journal of Applied Metaheuristic Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Big data; Data processing; Data mining; Artificial intelligence; Database","score_opus":0.08629247167844621,"score_gpt":0.3261662510747974,"score_spread":0.23987377939635118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965831557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022441361,0.0007487746,0.9743672,0.00039067154,0.00006362539,0.00013722025,0.00008840413,0.00020112982,0.0015615443],"genre_scores_gemma":[0.40335345,0.00078829174,0.5925505,0.0003240168,0.00018680355,0.0006484067,0.000372657,0.00013145403,0.0016443504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988575,0.0005068017,0.00007635386,0.00022579063,0.00021452337,0.000119011784],"domain_scores_gemma":[0.9975727,0.001824534,0.0002185279,0.000087910455,0.0001742647,0.00012203762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030295325,0.0025717767,0.0029527112,0.0021642393,0.00081796397,0.002111788,0.002276805,0.0026451591,0.001628586],"category_scores_gemma":[0.0038511867,0.001139548,0.0025309825,0.002272243,0.0009966771,0.0017086115,0.0023848622,0.0019736325,0.00021033062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003018486,0.000081070204,0.00045075704,0.000100664096,0.00014882127,0.000059797036,0.000023967119,0.9816554,0.0003666943,0.002160952,0.00030804417,0.014613626],"study_design_scores_gemma":[0.000005983671,0.000016463175,0.000050687468,0.000004991717,0.000009413664,0.0000055706173,0.000012599517,0.9977469,0.000101508194,0.0019451582,0.00009791467,0.0000028322013],"about_ca_topic_score_codex":0.0050077797,"about_ca_topic_score_gemma":0.0031232547,"teacher_disagreement_score":0.0050077797,"about_ca_system_score_codex":0.0010327278,"about_ca_system_score_gemma":0.0013890147,"threshold_uncertainty_score":0.016021848},"labels":[],"label_agreement":null},{"id":"W2966254368","doi":"10.1109/iraniancee.2019.8786601","title":"DTO: Donkey Theorem Optimization","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Donkey; Metaheuristic; Computer science; Optimization problem; Mathematical optimization; Optimization algorithm; Benchmark (surveying); Algorithm; Artificial intelligence; Mathematics; Geography","score_opus":0.01106807928409314,"score_gpt":0.2543633859597186,"score_spread":0.24329530667562543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966254368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013432748,0.0010214517,0.96736455,0.00034367913,0.0003123033,0.00013239123,0.00021699417,0.00062483386,0.01655105],"genre_scores_gemma":[0.4863468,0.0015261874,0.4927064,0.0007666581,0.00017477619,0.0009266687,0.0010155321,0.00089504314,0.015642053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932015,0.00027736474,0.00003436132,0.00011220237,0.00018543113,0.0000705177],"domain_scores_gemma":[0.99915385,0.0004917193,0.00009201106,0.000065965876,0.00015533941,0.000041205658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001278671,0.001454655,0.0013277315,0.0008995197,0.0006723525,0.0011925078,0.0016558353,0.001295053,0.005004834],"category_scores_gemma":[0.002610145,0.0004049512,0.0010894025,0.0011052339,0.00096354546,0.0011362177,0.0012638097,0.001238972,0.0008044948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010013407,0.00007074014,0.00088216324,0.00023598222,0.00010598652,0.00007491583,0.000030677034,0.8890514,0.0018493749,0.038549915,0.005933444,0.06311541],"study_design_scores_gemma":[0.000027935295,0.00005735926,0.000112667316,0.000016369368,0.000018361205,0.000033962235,0.000009722034,0.98546684,0.0008108938,0.008424828,0.0050113727,0.000009724314],"about_ca_topic_score_codex":0.0044115013,"about_ca_topic_score_gemma":0.0025404308,"teacher_disagreement_score":0.005004834,"about_ca_system_score_codex":0.00115397,"about_ca_system_score_gemma":0.0017606239,"threshold_uncertainty_score":0.016742826},"labels":[],"label_agreement":null},{"id":"W2966288920","doi":"10.1016/j.ins.2019.08.016","title":"Variable neighborhood algebraic Differential Evolution: An application to the Linear Ordering Problem with Cumulative Costs","year":2019,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università per Stranieri di Perugia; Ryerson University","keywords":"Permutation (music); Benchmark (surveying); Differential evolution; Differential (mechanical device); Suite; Variable (mathematics); Computer science; Algebraic number; Mathematics; Algorithm; Mathematical optimization; Theoretical computer science","score_opus":0.013136658311947564,"score_gpt":0.2766363749169204,"score_spread":0.26349971660497284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966288920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0506906,0.00044848552,0.9368371,0.0006088468,0.00012213693,0.00006479212,0.000052073352,0.000052136707,0.0111238025],"genre_scores_gemma":[0.6517032,0.00077328825,0.33421558,0.0001300175,0.00011646139,0.00015753499,0.0000825025,0.00009661408,0.012724752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997148,0.00011250077,0.00000974799,0.00003950003,0.00009474852,0.000028667144],"domain_scores_gemma":[0.99804485,0.0014865804,0.00012604054,0.00006321094,0.00017926587,0.000100103774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001154544,0.0004918923,0.0009996288,0.00081430725,0.0006388355,0.0013990578,0.0013987867,0.0014084653,0.0025626912],"category_scores_gemma":[0.005104541,0.00033719238,0.0005975133,0.0014486064,0.0012397092,0.0012996849,0.0014034717,0.0013999616,0.00013414664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036103014,0.000055332537,0.0004210106,0.00006827901,0.000019321511,0.000095664516,0.00006685986,0.7001858,0.0007167515,0.27508155,0.00090089376,0.022352511],"study_design_scores_gemma":[0.0000060124494,0.00001164345,0.000049999857,0.0000037194193,0.000004245969,0.000015337435,0.000008039565,0.9744761,0.00013348539,0.024676487,0.0006104134,0.0000044280628],"about_ca_topic_score_codex":0.004163432,"about_ca_topic_score_gemma":0.004401939,"teacher_disagreement_score":0.004163432,"about_ca_system_score_codex":0.0015077629,"about_ca_system_score_gemma":0.0012432489,"threshold_uncertainty_score":0.010939598},"labels":[],"label_agreement":null},{"id":"W2966481281","doi":"10.24963/ijcai.2019/170","title":"Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bounded function; Node (physics); Mathematical optimization; Constant (computer programming); Quality (philosophy); Regular polygon; Computer science; Upper and lower bounds; Mathematics; Engineering","score_opus":0.04593565137038163,"score_gpt":0.3442280730466101,"score_spread":0.29829242167622844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966481281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030649362,0.00039153025,0.95780504,0.0004561259,0.000078407,0.00030078556,0.000092906965,0.00037766452,0.0098480545],"genre_scores_gemma":[0.53684735,0.00069978996,0.4573977,0.00043475695,0.0001064392,0.00084172754,0.0003136829,0.0003222168,0.003036359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960891,0.0014568928,0.00033598772,0.00050158583,0.0010959564,0.00052043167],"domain_scores_gemma":[0.97202873,0.02019825,0.0025708415,0.0015892426,0.0026711319,0.0009417734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007620763,0.0012449778,0.0015507909,0.0012923263,0.0010237264,0.0016521298,0.0018811201,0.0016569683,0.004498068],"category_scores_gemma":[0.04722708,0.0007501699,0.000736966,0.0010598672,0.0023238722,0.0041247755,0.0024918872,0.002846129,0.0010335846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005556171,0.00020091592,0.001365064,0.0005318371,0.00006747874,0.00041654057,0.00047551698,0.68087167,0.013393592,0.22341448,0.004940797,0.073766515],"study_design_scores_gemma":[0.0000991117,0.0004789103,0.00045290976,0.0001643796,0.000026637217,0.00018509406,0.00016416388,0.9122575,0.007875745,0.07428967,0.003961539,0.000044293127],"about_ca_topic_score_codex":0.0019370108,"about_ca_topic_score_gemma":0.0016427727,"teacher_disagreement_score":0.007620763,"about_ca_system_score_codex":0.0009829552,"about_ca_system_score_gemma":0.0034153797,"threshold_uncertainty_score":0.040302932},"labels":[],"label_agreement":null},{"id":"W2967371416","doi":"10.1049/el.2019.1965","title":"Optimal search algorithm in a big database using interpolation–extrapolation method","year":2019,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Universiti Malaysia Pahang","keywords":"Extrapolation; Interpolation (computer graphics); Binary search algorithm; Computer science; Search algorithm; Algorithm; Convergence (economics); Data mining; Mathematics; Artificial intelligence; Statistics","score_opus":0.028123793298025394,"score_gpt":0.3221547195347365,"score_spread":0.2940309262367111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967371416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023414293,0.0006412244,0.9730294,0.0001571851,0.000048088572,0.000053513926,0.000043725555,0.00015029192,0.0024622793],"genre_scores_gemma":[0.49767113,0.00072742725,0.49752623,0.00014226166,0.000065195156,0.00031339788,0.00019239304,0.00007100115,0.003290955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996251,0.00012369551,0.00003301642,0.000060519396,0.000114437506,0.000043236545],"domain_scores_gemma":[0.99913675,0.00058815046,0.000060374106,0.00004498044,0.00013073844,0.000038974806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011870725,0.00043505456,0.0011310945,0.0008290396,0.00042616884,0.0007564999,0.0010722071,0.0008295778,0.0020395876],"category_scores_gemma":[0.002515209,0.00035324338,0.0006507722,0.0012565085,0.0004322193,0.0011893864,0.0008998296,0.0007146472,0.00024091355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001523531,0.00006066033,0.0009833818,0.00017731731,0.000047826274,0.00012585318,0.000085065774,0.91065264,0.0021456094,0.018162677,0.0010983027,0.066308334],"study_design_scores_gemma":[0.000010909451,0.00001894178,0.00006748765,0.000005586709,0.0000034688567,0.000015281454,0.000007262515,0.99679923,0.00017389408,0.0026498225,0.00024489642,0.0000032034902],"about_ca_topic_score_codex":0.0038715694,"about_ca_topic_score_gemma":0.0020528485,"teacher_disagreement_score":0.0038715694,"about_ca_system_score_codex":0.00044908785,"about_ca_system_score_gemma":0.0012092452,"threshold_uncertainty_score":0.007698059},"labels":[],"label_agreement":null},{"id":"W2968560091","doi":"10.22098/joape.2019.5522.1414","title":"FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems","year":2020,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Optimization algorithm; Mathematical optimization; Computer science; Engineering optimization; Power optimization; Power (physics); Optimization problem; Algorithm; Mathematics; Power consumption; Physics","score_opus":0.1893431910617587,"score_gpt":0.4907672931665305,"score_spread":0.3014241021047718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968560091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011412067,0.0004333075,0.979809,0.0003490973,0.00013494464,0.00016077899,0.00013491452,0.00092455366,0.00664127],"genre_scores_gemma":[0.18477918,0.00031588966,0.8065261,0.00057930365,0.00009377536,0.0009753838,0.00057876087,0.00040797412,0.005743602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948525,0.00022537216,0.000027874648,0.000074907104,0.00012784584,0.000058763977],"domain_scores_gemma":[0.9990339,0.0006404007,0.00008075359,0.000059454087,0.00015376337,0.00003168545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014819052,0.0012010317,0.00097576453,0.0008975599,0.00074862555,0.0006211453,0.001542844,0.0020191579,0.0074024852],"category_scores_gemma":[0.0033868751,0.00036757745,0.0008626534,0.001023765,0.0005327914,0.0009576935,0.00080475473,0.0013267435,0.0013053375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013533785,0.00014346244,0.0014339426,0.00017329084,0.00012720656,0.000103692335,0.00011048355,0.78118825,0.0015863732,0.015615574,0.009082765,0.1902996],"study_design_scores_gemma":[0.00004627754,0.00006587654,0.00017119224,0.000018086306,0.000016614964,0.000047573783,0.000012980311,0.99017555,0.00044951882,0.004624688,0.004363279,0.000008410769],"about_ca_topic_score_codex":0.0056132027,"about_ca_topic_score_gemma":0.0051366207,"teacher_disagreement_score":0.0074024852,"about_ca_system_score_codex":0.00051988976,"about_ca_system_score_gemma":0.0012299083,"threshold_uncertainty_score":0.024763763},"labels":[],"label_agreement":null},{"id":"W2969626082","doi":"10.35378/gujs.484643","title":"DGO: Dice Game Optimizer","year":2019,"lang":"en","type":"article","venue":"GAZI UNIVERSITY JOURNAL OF SCIENCE","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Dice; Computer science; Metaheuristic; Benchmark (surveying); Set (abstract data type); Mathematical optimization; Particle swarm optimization; Artificial intelligence; Ant colony optimization algorithms; Algorithm; Mathematics","score_opus":0.007401533093730508,"score_gpt":0.21909546990426787,"score_spread":0.21169393681053736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969626082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031594113,0.001794749,0.912886,0.00050444814,0.0003803789,0.00057929376,0.000829971,0.005004098,0.04642686],"genre_scores_gemma":[0.42040125,0.0014628915,0.55274755,0.00057660753,0.00010618668,0.0013296452,0.0020292597,0.0011449747,0.020201674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961424,0.00011496811,0.000022958848,0.00006093566,0.0001374793,0.00004931526],"domain_scores_gemma":[0.99971896,0.000111768386,0.000024719442,0.000028908058,0.00008968817,0.000025969823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067498646,0.0015973578,0.0009866285,0.0007093256,0.00048143626,0.00087235967,0.0010714267,0.0010145042,0.0064133457],"category_scores_gemma":[0.0012622584,0.00038887656,0.0007356577,0.0005850025,0.0005269264,0.00057124055,0.0009524867,0.0012216449,0.0012100021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023749236,0.00011886896,0.0016581926,0.00035613804,0.00009256543,0.00015659787,0.00008442039,0.8237458,0.0028244988,0.01809442,0.0142565565,0.13837436],"study_design_scores_gemma":[0.000057038993,0.00008610028,0.00028354232,0.000022091745,0.000017442508,0.00006942893,0.00001727483,0.9791405,0.001583964,0.0034333514,0.015272902,0.000016455217],"about_ca_topic_score_codex":0.006907517,"about_ca_topic_score_gemma":0.0050635454,"teacher_disagreement_score":0.006907517,"about_ca_system_score_codex":0.000635013,"about_ca_system_score_gemma":0.0008519345,"threshold_uncertainty_score":0.021454751},"labels":[],"label_agreement":null},{"id":"W2969862035","doi":"10.1007/s13042-019-00996-5","title":"Feature selection based on rough set approach, wrapper approach, and binary whale optimization algorithm","year":2019,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Feature selection; Computer science; Feature (linguistics); Heuristic; Algorithm; Artificial intelligence; Computational intelligence; Selection (genetic algorithm); Rough set; Optimization problem; Set (abstract data type); Wilcoxon signed-rank test; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.009192440010017096,"score_gpt":0.25996537604980174,"score_spread":0.2507729360397846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969862035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026356408,0.000499083,0.9715499,0.00013682545,0.000078922436,0.000078045516,0.000047435788,0.00024084414,0.001012494],"genre_scores_gemma":[0.6455013,0.0005014965,0.35099453,0.000119571116,0.00013193715,0.00030916746,0.0002347774,0.0000662965,0.0021408582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839395,0.00045284952,0.00016080291,0.00024619378,0.00063120737,0.000115046],"domain_scores_gemma":[0.99899226,0.00050325884,0.00009033416,0.00009834703,0.00028790414,0.00002779095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020302392,0.00092724984,0.002875395,0.002356986,0.00070375076,0.0014734237,0.0012150892,0.00096925,0.0010492046],"category_scores_gemma":[0.0037068075,0.00041829373,0.0018455241,0.0020076367,0.00049946335,0.0015508448,0.00074049045,0.00061573973,0.00023016566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003967458,0.00025219648,0.0025861617,0.00040366908,0.00071207405,0.00026534472,0.00015563343,0.5728887,0.007127888,0.021625053,0.0039139283,0.38967255],"study_design_scores_gemma":[0.000029171604,0.000113027665,0.00071014045,0.000016018354,0.00011496493,0.000078268466,0.00002142902,0.9907206,0.001786905,0.0058099655,0.00057366805,0.000025843574],"about_ca_topic_score_codex":0.0019939097,"about_ca_topic_score_gemma":0.0011430837,"teacher_disagreement_score":0.002875395,"about_ca_system_score_codex":0.0005411911,"about_ca_system_score_gemma":0.0007818561,"threshold_uncertainty_score":0.0107370615},"labels":[],"label_agreement":null},{"id":"W2973195070","doi":"10.1007/s11063-019-10112-x","title":"Random Regrouping and Factorization in Cooperative Particle Swarm Optimization Based Large-Scale Neural Network Training","year":2019,"lang":"en","type":"article","venue":"Neural Processing Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Curse of dimensionality; Artificial neural network; Computer science; Particle swarm optimization; Decomposition; Computational intelligence; Factorization; Swarm intelligence; Mathematical optimization; Swarm behaviour; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.02485344995936932,"score_gpt":0.26620710131832226,"score_spread":0.24135365135895293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973195070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034961093,0.00019982808,0.9629846,0.00014529389,0.00006986611,0.000050612896,0.000015989546,0.00020816697,0.0013644972],"genre_scores_gemma":[0.69487405,0.000120385164,0.3015147,0.00015104047,0.00008475794,0.00022704304,0.000098841774,0.000098020406,0.0028311785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935764,0.00029782768,0.000032908483,0.00011165534,0.00012739334,0.00007265289],"domain_scores_gemma":[0.99746025,0.0015507424,0.00025457898,0.00028429032,0.00035531784,0.000094769995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024241358,0.0007506283,0.0012878182,0.00043283735,0.0007206842,0.0006801527,0.0015216889,0.0016838385,0.0017927983],"category_scores_gemma":[0.0061378395,0.0006563106,0.00062927854,0.0005761011,0.0011690129,0.0016350866,0.0013297132,0.000978427,0.00037251585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012026601,0.00006514512,0.00026440577,0.000040432555,0.000026598274,0.000035942598,0.00006811152,0.965403,0.0014229348,0.0038763594,0.00060508883,0.028071687],"study_design_scores_gemma":[0.0000053134427,0.000017376527,0.00001979734,0.0000011764954,0.0000019731922,0.0000025151064,0.000003654607,0.99924195,0.00015757381,0.00049624126,0.00005083575,0.0000015812885],"about_ca_topic_score_codex":0.004666759,"about_ca_topic_score_gemma":0.0055989735,"teacher_disagreement_score":0.004666759,"about_ca_system_score_codex":0.0005143603,"about_ca_system_score_gemma":0.0009224838,"threshold_uncertainty_score":0.012820184},"labels":[],"label_agreement":null},{"id":"W2975160087","doi":"10.1109/iccse.2019.8845360","title":"Tackling Deceptive Optimization Problems Using Opposition-based DE with Center-based Latin Hypercube Initialization","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Initialization; Population; Computer science; Latin hypercube sampling; Benchmark (surveying); Mathematical optimization; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Monte Carlo method; Statistics","score_opus":0.028997078482653354,"score_gpt":0.2737080330282571,"score_spread":0.24471095454560374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975160087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01631834,0.0005267664,0.9759444,0.00017365646,0.000066785935,0.00008296827,0.00003056179,0.00017944336,0.0066770464],"genre_scores_gemma":[0.6121377,0.0006522611,0.38043106,0.0003462318,0.000070807546,0.0006334201,0.00019147541,0.00011555768,0.0054214965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995352,0.00020129388,0.000026635349,0.00007248749,0.00011420666,0.000050176826],"domain_scores_gemma":[0.9990246,0.00061300205,0.000111214795,0.00005213984,0.0001633019,0.00003571063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000952606,0.00091004913,0.0012771885,0.0006555189,0.00045137407,0.0012318052,0.0010051246,0.001052568,0.0018606475],"category_scores_gemma":[0.0023045156,0.00037397328,0.0008747086,0.0006296473,0.0006285123,0.0008163288,0.0010073311,0.0011607297,0.00029664132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044829198,0.00003997464,0.00041470418,0.000081271864,0.00004758646,0.00009624343,0.000063883555,0.9535178,0.0023190617,0.009547819,0.00073389587,0.03309287],"study_design_scores_gemma":[0.000009301161,0.00002365151,0.000039341496,0.000007232894,0.000005426484,0.000018414283,0.000009941636,0.9969309,0.00041582598,0.001901696,0.00063391106,0.0000042557717],"about_ca_topic_score_codex":0.0019293269,"about_ca_topic_score_gemma":0.001833723,"teacher_disagreement_score":0.0019293269,"about_ca_system_score_codex":0.00059389154,"about_ca_system_score_gemma":0.000722321,"threshold_uncertainty_score":0.006224513},"labels":[],"label_agreement":null},{"id":"W2976813994","doi":"10.1109/iccse.2019.8845065","title":"Differential Evolution Algorithm Based on a Competition Scheme","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Crossover; Differential evolution; Competition (biology); Mathematical optimization; Mutation; Algorithm; Computer science; Population; Scheme (mathematics); Mathematics; Artificial intelligence","score_opus":0.010302146531306967,"score_gpt":0.2475222060849511,"score_spread":0.23722005955364414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976813994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019441178,0.00046186103,0.9684598,0.00022007327,0.00010857151,0.000121322584,0.00003196633,0.00018809867,0.010967071],"genre_scores_gemma":[0.68962747,0.00060720555,0.29638827,0.00023425836,0.000066066656,0.0004906445,0.00012254663,0.000047031772,0.012416513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995983,0.00010405522,0.000023973978,0.00005954517,0.00017723157,0.000036893714],"domain_scores_gemma":[0.99972194,0.000110851026,0.00003102764,0.000025752222,0.000085429216,0.000024968553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071606314,0.00049359864,0.0008052073,0.000491281,0.00041541242,0.0005738942,0.0012938399,0.0007935668,0.0020484126],"category_scores_gemma":[0.0011859942,0.00018930649,0.0004874436,0.00062658195,0.0006089081,0.0006580847,0.000895117,0.0006490435,0.00031348132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107276705,0.00009792874,0.0010743042,0.0001802158,0.000092867704,0.00026943278,0.00018889965,0.64981663,0.022921823,0.15532562,0.003419391,0.1665057],"study_design_scores_gemma":[0.000043877804,0.0000896716,0.00015842031,0.0000063518773,0.000013274328,0.00010212292,0.0000063121556,0.98771137,0.0014729913,0.005863447,0.004519599,0.000012630892],"about_ca_topic_score_codex":0.0012653075,"about_ca_topic_score_gemma":0.00073910726,"teacher_disagreement_score":0.0020484126,"about_ca_system_score_codex":0.0006240889,"about_ca_system_score_gemma":0.0006409932,"threshold_uncertainty_score":0.006852567},"labels":[],"label_agreement":null},{"id":"W2977652100","doi":"10.5220/0008169001960204","title":"ME2: A Scalable Modular Meta-heuristic for Multi-modal Multi-dimension Optimization","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Local optimum; CMA-ES; Computer science; Simulated annealing; Multi-swarm optimization; Global optimization; Scalability; Optimization problem; Algorithm; Evolution strategy; Mathematics; Evolutionary computation","score_opus":0.08821480649629737,"score_gpt":0.3281255347339308,"score_spread":0.23991072823763343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977652100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02394632,0.00057258765,0.967304,0.00019436999,0.00009783664,0.00018246313,0.00021463336,0.0026880945,0.0047997464],"genre_scores_gemma":[0.37022722,0.00023888903,0.6240292,0.00024229947,0.0000540285,0.0007547315,0.00050629413,0.0005031332,0.0034442595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961615,0.000113160226,0.000019506171,0.00005768706,0.00012839877,0.00006501319],"domain_scores_gemma":[0.9993543,0.00035895268,0.000057856552,0.00007612988,0.00010766301,0.000044980283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000894259,0.0011498744,0.0010829344,0.0007660474,0.0004064915,0.0009327706,0.0021682254,0.0015630644,0.0040080007],"category_scores_gemma":[0.0021320668,0.0005894624,0.001409324,0.00073858234,0.00051508524,0.0011157454,0.0015552479,0.001219608,0.0006939456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010472235,0.00006226045,0.00039457856,0.000103592254,0.00008734831,0.00005541537,0.000032937613,0.9493388,0.0026830635,0.0029012994,0.0018991507,0.042337026],"study_design_scores_gemma":[0.000041946398,0.000032324388,0.000058857404,0.000006006204,0.00000954367,0.000011407971,0.000006774042,0.9971705,0.00058736233,0.0011599917,0.0009093394,0.0000059421877],"about_ca_topic_score_codex":0.0035356747,"about_ca_topic_score_gemma":0.004794357,"teacher_disagreement_score":0.0040080007,"about_ca_system_score_codex":0.0006815867,"about_ca_system_score_gemma":0.0013235675,"threshold_uncertainty_score":0.013408065},"labels":[],"label_agreement":null},{"id":"W2980792681","doi":"10.1007/s00521-019-04530-0","title":"Sine–cosine crow search algorithm: theory and applications","year":2019,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Sine; Algorithm; Trigonometric functions; Benchmark (surveying); Discrete cosine transform; Computer science; Search algorithm; Mathematics; Artificial intelligence","score_opus":0.015251669369342387,"score_gpt":0.3009023027928943,"score_spread":0.2856506334235519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980792681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006336079,0.0035688893,0.9771935,0.0003471681,0.00040336972,0.000048278343,0.000035801608,0.00026341903,0.011803473],"genre_scores_gemma":[0.21856062,0.0035690113,0.75773585,0.00037094014,0.0003987003,0.00022865996,0.00019188815,0.00021872428,0.018725535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997031,0.00008506746,0.000018125904,0.000045554003,0.00013006244,0.000018161896],"domain_scores_gemma":[0.9994702,0.00022860385,0.000038622806,0.0000462914,0.0001901859,0.00002616976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066008535,0.0004489605,0.00088156585,0.0011004846,0.0006587216,0.0009819252,0.0010961724,0.0012542964,0.0034298617],"category_scores_gemma":[0.002286885,0.0002617143,0.00044205855,0.0020300613,0.00065362395,0.0009203053,0.0007013658,0.00088154024,0.000947471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012408305,0.00012155166,0.001181503,0.00035311194,0.00011425072,0.00009308674,0.0001067261,0.28014195,0.005427509,0.21572848,0.012806815,0.48380083],"study_design_scores_gemma":[0.000028530227,0.00004731522,0.00027926007,0.000029432927,0.000020579773,0.00011791485,0.000028147355,0.9477447,0.001352034,0.036866948,0.013463,0.000022174296],"about_ca_topic_score_codex":0.0031250536,"about_ca_topic_score_gemma":0.0029430212,"teacher_disagreement_score":0.0034298617,"about_ca_system_score_codex":0.0006166324,"about_ca_system_score_gemma":0.0012063582,"threshold_uncertainty_score":0.011474013},"labels":[],"label_agreement":null},{"id":"W2987410708","doi":"10.1007/s11590-019-01497-8","title":"Monotonic grey box direct search optimization","year":2019,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rio Tinto (Canada); Giro (Canada); Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Mathematical optimization; Computer science; Optimization problem; Computational intelligence; Function (biology); Algorithm; Mathematics; Artificial intelligence","score_opus":0.012358154721532576,"score_gpt":0.24862522730838083,"score_spread":0.23626707258684826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987410708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012248617,0.0013974338,0.90778667,0.0005912645,0.0003134354,0.00011180637,0.0001305746,0.00031927795,0.07710084],"genre_scores_gemma":[0.44923148,0.0013525106,0.465322,0.0006176044,0.00022425414,0.0006017605,0.000260973,0.0004771733,0.08191229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.00013358584,0.0000095658925,0.000037010428,0.00008969008,0.000017500037],"domain_scores_gemma":[0.99939656,0.000383964,0.000040396746,0.00006451431,0.00008925154,0.00002534448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009811695,0.0006818846,0.0010884637,0.00044547484,0.0003250532,0.0013853565,0.0010199148,0.0015656002,0.014094776],"category_scores_gemma":[0.0031559784,0.00046348458,0.0003902492,0.00065619237,0.0009778892,0.0010184234,0.0013396536,0.00110882,0.0023597325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016120436,0.00006704819,0.00020949416,0.00041428805,0.0000685595,0.00012230493,0.000060327406,0.6741316,0.0032802525,0.23432589,0.0076405313,0.0795186],"study_design_scores_gemma":[0.000026450347,0.000030753068,0.000048510876,0.000022959077,0.000008451798,0.000022970773,0.0000054870216,0.9761478,0.0005606546,0.020368887,0.0027513823,0.000005757675],"about_ca_topic_score_codex":0.0006869478,"about_ca_topic_score_gemma":0.0007340508,"teacher_disagreement_score":0.014094776,"about_ca_system_score_codex":0.0004741304,"about_ca_system_score_gemma":0.0006942356,"threshold_uncertainty_score":0.047151685},"labels":[],"label_agreement":null},{"id":"W2988771853","doi":"10.48550/arxiv.1911.01012","title":"StoMADS: Stochastic blackbox optimization using probabilistic estimates","year":2019,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Probabilistic logic; Martingale (probability theory); Convergence (economics); Computer science; Mathematics; Probability distribution; Stochastic optimization; Set (abstract data type); Algorithm; Convergence of random variables; Random variable; Applied mathematics; Artificial intelligence","score_opus":0.02513923476694892,"score_gpt":0.28021499125755706,"score_spread":0.25507575649060815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988771853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029808308,0.00009671237,0.99583876,0.00006430463,0.000020970921,0.000018481904,0.000020645186,0.00012636052,0.0008330059],"genre_scores_gemma":[0.4100381,0.00041057932,0.5835006,0.00020542344,0.00008256408,0.0003896436,0.0002447559,0.0003367092,0.004791542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993112,0.00031615552,0.000024670415,0.00009952404,0.00021113732,0.000037372018],"domain_scores_gemma":[0.9982943,0.0012992244,0.00011928888,0.00010428503,0.00012436061,0.00005864561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017126038,0.00077960524,0.0012655274,0.00063496333,0.0003626874,0.0011427614,0.0011682087,0.0010993085,0.0026025812],"category_scores_gemma":[0.0048637833,0.0006469215,0.00086050667,0.0005013797,0.0011366295,0.0011071396,0.0020331696,0.0014203206,0.00043454373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004733599,0.000015303074,0.00021788325,0.00006574678,0.00003036286,0.000030347166,0.000024062627,0.94428855,0.0009664068,0.039161656,0.00050664117,0.014645706],"study_design_scores_gemma":[0.0000059567974,0.000008530701,0.000015649563,0.00000493328,0.0000016267128,0.0000036975875,0.0000013932747,0.9919282,0.00021223156,0.007452232,0.00036324866,0.000002250763],"about_ca_topic_score_codex":0.0016676808,"about_ca_topic_score_gemma":0.0013372482,"teacher_disagreement_score":0.0026025812,"about_ca_system_score_codex":0.0007134693,"about_ca_system_score_gemma":0.001060256,"threshold_uncertainty_score":0.009057224},"labels":[],"label_agreement":null},{"id":"W2991539177","doi":"10.1109/smc42975.2020.9283242","title":"Swarm Based Algorithms for Neural Network Training","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Overfitting; Firefly algorithm; Computer science; Artificial neural network; Ant colony optimization algorithms; Algorithm; Particle swarm optimization; Swarm behaviour; Artificial intelligence; Machine learning; Optimization algorithm; Swarm intelligence; Mathematical optimization; Mathematics","score_opus":0.15166154031169068,"score_gpt":0.3290099753626263,"score_spread":0.1773484350509356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991539177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015887724,0.0014088984,0.99237895,0.0001700509,0.00011317638,0.000078543315,0.000055973072,0.00038397175,0.003821618],"genre_scores_gemma":[0.07207396,0.0030672606,0.916444,0.00015246871,0.000168114,0.0007731179,0.00035112325,0.00017238322,0.0067975717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910164,0.00033069053,0.000083820996,0.00009130819,0.00036287503,0.000029598827],"domain_scores_gemma":[0.9986552,0.00082566106,0.00009864914,0.00012057342,0.00027755738,0.000022308308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017222211,0.001349185,0.0011077251,0.00109099,0.0006291164,0.0010600974,0.0011800054,0.0011324567,0.004176917],"category_scores_gemma":[0.0054105427,0.00053919095,0.0006328962,0.0019440933,0.00067486934,0.001121327,0.00083086407,0.001658745,0.0013944063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048257752,0.00005793753,0.000724207,0.00037380017,0.000121613266,0.000064820706,0.00013050262,0.6704375,0.0014174229,0.046784304,0.0063744048,0.27346522],"study_design_scores_gemma":[0.000018474046,0.00003468766,0.00015338448,0.000056500874,0.000012076917,0.000030657564,0.000018488567,0.9730661,0.0007258081,0.015953448,0.009918068,0.000012263077],"about_ca_topic_score_codex":0.004410963,"about_ca_topic_score_gemma":0.0037514144,"teacher_disagreement_score":0.004410963,"about_ca_system_score_codex":0.0007958819,"about_ca_system_score_gemma":0.00077531824,"threshold_uncertainty_score":0.0139731765},"labels":[],"label_agreement":null},{"id":"W2994068620","doi":"10.1016/j.micpro.2019.102949","title":"An analytical framework for high-speed hardware particle swarm optimization","year":2019,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Implementation; Particle swarm optimization; Benchmark (surveying); Speedup; Key (lock); Computer engineering; Software; Embedded system; Parallel computing; Computer architecture; Distributed computing; Algorithm; Operating system","score_opus":0.020090199278023475,"score_gpt":0.2989993548084793,"score_spread":0.2789091555304558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994068620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020334849,0.00055854715,0.98684746,0.0002770663,0.00013846348,0.000029873006,0.0000240496,0.000091605834,0.009999461],"genre_scores_gemma":[0.49577376,0.0031000988,0.4777476,0.00033504242,0.00054808834,0.0005020649,0.00014712688,0.00028392058,0.021562288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996637,0.00010311425,0.000011841689,0.000030518793,0.00015721277,0.000033737146],"domain_scores_gemma":[0.99958426,0.00021663596,0.000043084576,0.00003185009,0.00010580441,0.00001832134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079645973,0.00094739243,0.0006995241,0.0007872911,0.00060150074,0.0014034063,0.0016611582,0.0013840286,0.0042752847],"category_scores_gemma":[0.0026641404,0.00048436172,0.0007119275,0.0011454418,0.0010976258,0.0015320947,0.0012173969,0.0014079611,0.0008140862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085852,0.000011547527,0.00007109014,0.000050826857,0.000013110882,0.000037215526,0.000026855285,0.8645315,0.00045191348,0.124551184,0.0010159266,0.009230211],"study_design_scores_gemma":[0.000002450957,0.000004055817,0.000017721519,0.0000044703847,0.0000019557476,0.0000060067437,0.0000040040563,0.9870302,0.00005418814,0.011955178,0.0009176131,0.0000021006115],"about_ca_topic_score_codex":0.003886038,"about_ca_topic_score_gemma":0.0030434104,"teacher_disagreement_score":0.0042752847,"about_ca_system_score_codex":0.0009865974,"about_ca_system_score_gemma":0.0012621165,"threshold_uncertainty_score":0.014302254},"labels":[],"label_agreement":null},{"id":"W2999073106","doi":"10.5539/cis.v13n1p41","title":"Artificial God Optimization - A Creation","year":2020,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Computer science; Field (mathematics); Multi-swarm optimization; Benchmark (surveying); Swarm intelligence; Metaheuristic; Optimization problem; Genetic algorithm; Mathematical optimization; Simple (philosophy); Artificial intelligence; Derivative-free optimization; Focus (optics); Algorithm; Machine learning; Mathematics; Physics; Epistemology","score_opus":0.028139097350418158,"score_gpt":0.277713342972343,"score_spread":0.24957424562192485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999073106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013596057,0.017644476,0.84756964,0.0050812336,0.0018883537,0.00017616329,0.00028403386,0.0013114269,0.11244867],"genre_scores_gemma":[0.28773054,0.019813204,0.6407497,0.0020035708,0.0010173812,0.00042006254,0.0006519037,0.00065648736,0.0469572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991679,0.00024979634,0.000039381786,0.00013568944,0.00036004648,0.000047177764],"domain_scores_gemma":[0.9993943,0.0002268496,0.00006241506,0.000110571156,0.00013825626,0.00006761755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011340923,0.0006097717,0.00078465696,0.00085183984,0.0007924599,0.002343606,0.0009599179,0.0010541014,0.003772762],"category_scores_gemma":[0.002164257,0.00030571013,0.0009434848,0.0011048738,0.0017445135,0.0019910538,0.0021740247,0.0019963298,0.0011327335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009723547,0.000068162444,0.001565934,0.00069552317,0.00013186166,0.0002772412,0.0004256847,0.071587384,0.005289082,0.6241549,0.029017394,0.26668957],"study_design_scores_gemma":[0.000060195995,0.00018398934,0.00091533124,0.00029713096,0.000062340034,0.0006926063,0.00018110791,0.2287093,0.006006858,0.2560509,0.50674415,0.0000960962],"about_ca_topic_score_codex":0.00073698076,"about_ca_topic_score_gemma":0.0007348547,"teacher_disagreement_score":0.003772762,"about_ca_system_score_codex":0.00063777174,"about_ca_system_score_gemma":0.0013844913,"threshold_uncertainty_score":0.012621164},"labels":[],"label_agreement":null},{"id":"W3005942432","doi":"10.23977/cpcs.2020.41001","title":"A hybrid algorithm based on cuckoo search and differential evolution for numerical optimization","year":2020,"lang":"en","type":"article","venue":"Computing Performance and Communication systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cuckoo search; Differential evolution; Benchmark (surveying); Mathematical optimization; Evolutionary algorithm; Local search (optimization); Algorithm; Metaheuristic; Meta-optimization; Computer science; Optimization problem; Global optimization; Evolutionary computation; Population; Cuckoo; Mathematics; Particle swarm optimization","score_opus":0.033952841115957054,"score_gpt":0.27565463037756505,"score_spread":0.24170178926160799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005942432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011670403,0.0010900833,0.9805653,0.00012523177,0.00013268739,0.00012433674,0.0000294628,0.00045482317,0.0058076954],"genre_scores_gemma":[0.39981169,0.0010113925,0.5911163,0.0002160359,0.000098575045,0.000642901,0.00016461883,0.00014161355,0.006796919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994555,0.00013301495,0.000030090592,0.00006894942,0.00027916636,0.00003317373],"domain_scores_gemma":[0.9995727,0.00020988105,0.000030854706,0.000030084939,0.00013516762,0.000021301134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073007116,0.0009105838,0.0009377688,0.0012344433,0.000526381,0.0006564726,0.0012180146,0.0009955217,0.0013405642],"category_scores_gemma":[0.0014798491,0.00031226195,0.0005655535,0.0014147338,0.00061207084,0.00068561285,0.00070501544,0.0006149318,0.00029056004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099550685,0.000081334474,0.000981865,0.0003362301,0.0001602253,0.00013012195,0.00012375349,0.71645176,0.016047718,0.037574753,0.0036546665,0.22435793],"study_design_scores_gemma":[0.000029119892,0.000051184117,0.0001657589,0.00001089857,0.00001308623,0.000053080774,0.0000067242117,0.992428,0.0016360605,0.0020444838,0.0035450587,0.000016411432],"about_ca_topic_score_codex":0.0061546043,"about_ca_topic_score_gemma":0.0045576,"teacher_disagreement_score":0.0061546043,"about_ca_system_score_codex":0.0007980015,"about_ca_system_score_gemma":0.000845001,"threshold_uncertainty_score":0.012237549},"labels":[],"label_agreement":null},{"id":"W3008204235","doi":"10.5539/mas.v14n3p30","title":"Parallel Whale Optimization Algorithm for Maximum Flow Problem","year":2020,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maximum flow problem; Computer science; Algorithm; Speedup; Optimization algorithm; Whale; Flow (mathematics); Graph; Parallel computing; Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.03306968845705108,"score_gpt":0.26837070637336846,"score_spread":0.23530101791631738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008204235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013131851,0.00039630465,0.9770438,0.00029754257,0.00013738452,0.00013856533,0.00011524536,0.0006615268,0.008077759],"genre_scores_gemma":[0.26927248,0.00051887723,0.71576697,0.00026259516,0.00013275891,0.0006543256,0.0006130379,0.0003337008,0.0124452235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994955,0.00011139462,0.000026242351,0.00012591213,0.00015794004,0.000082940285],"domain_scores_gemma":[0.99968195,0.00014794106,0.000034249973,0.00003451949,0.00008053041,0.000020822035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006754697,0.0008977494,0.0010895925,0.00092887506,0.0008716468,0.0008536808,0.0012579226,0.00093704945,0.006336369],"category_scores_gemma":[0.0014881111,0.00038566397,0.00093535456,0.0012740066,0.00045636445,0.0011240355,0.0009647134,0.0009508477,0.000827555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014838016,0.00012834008,0.000745917,0.00021608568,0.000093541326,0.0001526264,0.00008940446,0.7806829,0.0027914657,0.027650243,0.00838037,0.17892073],"study_design_scores_gemma":[0.000044404103,0.000043853688,0.00013050818,0.000008718906,0.000013186567,0.000044909102,0.000022203905,0.98367345,0.0009009892,0.01076919,0.0043402426,0.000008295482],"about_ca_topic_score_codex":0.0058079483,"about_ca_topic_score_gemma":0.0061871647,"teacher_disagreement_score":0.006336369,"about_ca_system_score_codex":0.0006051669,"about_ca_system_score_gemma":0.0016035892,"threshold_uncertainty_score":0.02119726},"labels":[],"label_agreement":null},{"id":"W3009600022","doi":"10.1007/s12652-020-01829-y","title":"Machine learning based metaheuristic hybrids for S-box optimization","year":2020,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"A Thinking Ape (Canada); University of Prince Edward Island","funders":"","keywords":"Computer science; Metaheuristic; Hill climbing; Heuristic; Artificial intelligence; Machine learning; Task (project management); Domain (mathematical analysis); GRASP; Hyper-heuristic; Mathematical optimization; Mathematics; Engineering","score_opus":0.06293116070639058,"score_gpt":0.30634718657521226,"score_spread":0.24341602586882166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009600022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07742043,0.0011642938,0.90178454,0.0003791028,0.0003165102,0.00013542656,0.00007140937,0.0005044458,0.018223904],"genre_scores_gemma":[0.60136217,0.00032602684,0.38900018,0.0002830564,0.00012813247,0.0004819077,0.00012189335,0.00018906129,0.008107567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996915,0.0001526975,0.000012537018,0.000028255085,0.000086217326,0.00002892861],"domain_scores_gemma":[0.99922407,0.0005547085,0.000052657604,0.00004838829,0.00009183877,0.000028397113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010045847,0.0006320007,0.001138815,0.0008213358,0.0005852897,0.00089230866,0.0012174521,0.001972773,0.0036290952],"category_scores_gemma":[0.0018564863,0.00043534764,0.0009311004,0.00088554836,0.00068183907,0.00072836026,0.00086477585,0.0012849628,0.00046824192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011176042,0.00009415884,0.00024054438,0.000057661433,0.000074015734,0.000038816343,0.000025591911,0.9496743,0.0017565539,0.014827463,0.0006963045,0.032402765],"study_design_scores_gemma":[0.000008930126,0.000026124859,0.000029330502,0.0000037940256,0.000004257325,0.000004249727,0.0000023536531,0.9982168,0.00018174706,0.0013184071,0.00020191894,0.0000020759826],"about_ca_topic_score_codex":0.001483856,"about_ca_topic_score_gemma":0.0018283327,"teacher_disagreement_score":0.0036290952,"about_ca_system_score_codex":0.0007048858,"about_ca_system_score_gemma":0.0006330747,"threshold_uncertainty_score":0.0121405125},"labels":[],"label_agreement":null},{"id":"W3011183614","doi":"10.1016/j.aci.2020.03.002","title":"Swarm intelligence versus direct cover algorithms in synthesis of Multi-Valued Logic functions","year":2020,"lang":"en","type":"article","venue":"Applied Computing and Informatics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Ant colony optimization algorithms; Swarm intelligence; Computer science; Particle swarm optimization; Cover (algebra); Algorithm; Swarm behaviour; Product (mathematics); Variable (mathematics); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.060022377711279815,"score_gpt":0.2991870005784786,"score_spread":0.23916462286719875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011183614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16422018,0.0009855435,0.8195982,0.00022466078,0.00004876367,0.00010420641,0.000050351824,0.00045012642,0.014317995],"genre_scores_gemma":[0.76542544,0.00030834228,0.23155499,0.00005531574,0.000015093089,0.00008908002,0.0000977393,0.00004656995,0.0024075313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975973,0.000071363174,0.000014433647,0.00003053873,0.00009848738,0.000025530448],"domain_scores_gemma":[0.99960464,0.00024864203,0.0000452041,0.000042551834,0.000045534143,0.000013465131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000529511,0.00058287143,0.0004410271,0.0005694944,0.00022782423,0.00047919535,0.00043751084,0.00045838655,0.001475624],"category_scores_gemma":[0.0011594142,0.00023277804,0.00046318027,0.0004253977,0.0003915079,0.0005606624,0.00041178666,0.00035822552,0.00015793635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013275098,0.00006513542,0.0006179134,0.00010276375,0.00003814546,0.00005588505,0.00005105945,0.85742545,0.008984382,0.008042193,0.0004822514,0.12400216],"study_design_scores_gemma":[0.000012634878,0.000070705886,0.00014985006,0.0000064790097,0.0000074574505,0.000022414411,0.000008585946,0.9950536,0.002776948,0.0014129828,0.00047610348,0.0000022908598],"about_ca_topic_score_codex":0.0011272341,"about_ca_topic_score_gemma":0.0015788225,"teacher_disagreement_score":0.001475624,"about_ca_system_score_codex":0.0004480283,"about_ca_system_score_gemma":0.00036870598,"threshold_uncertainty_score":0.0049364567},"labels":[],"label_agreement":null},{"id":"W3013330614","doi":"10.4018/ijssci.2020040105","title":"Population Based Equilibrium in Hybrid SA/PSO for Combinatorial Optimization","year":2020,"lang":"en","type":"article","venue":"International Journal of Software Science and Computational Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Benchmark (surveying); Simulated annealing; Mathematical optimization; Computer science; Particle swarm optimization; Convergence (economics); Combinatorial optimization; Population; Swarm behaviour; Algorithm; Mathematics","score_opus":0.035049917283533495,"score_gpt":0.324975396373623,"score_spread":0.2899254790900895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013330614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010917403,0.000571667,0.9823866,0.00007369103,0.0000669937,0.000052329367,0.000011723603,0.00034364636,0.00557595],"genre_scores_gemma":[0.44039,0.0007386448,0.5534063,0.00015464766,0.000071653856,0.00030908937,0.00007434887,0.00016028938,0.004695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994129,0.00024156985,0.00002895637,0.00006924248,0.00020697295,0.000040427316],"domain_scores_gemma":[0.9996809,0.00017567897,0.000025685971,0.000033348013,0.000071971204,0.000012424277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009960671,0.0005678161,0.00061579637,0.0007013682,0.00039019837,0.0010805653,0.0009475238,0.0008644797,0.0014669389],"category_scores_gemma":[0.0015403492,0.00041928026,0.0006069891,0.00055094424,0.0006033944,0.000816493,0.00078575657,0.0009886515,0.0005339429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080805126,0.00009041412,0.0008423232,0.00015227648,0.00014974976,0.0001309643,0.00014813404,0.8033413,0.009968001,0.06848533,0.0010204103,0.115590215],"study_design_scores_gemma":[0.000013510566,0.000064426786,0.00011846635,0.000011836488,0.000017378161,0.0000401505,0.000012708074,0.98779047,0.0017667847,0.00683386,0.0033202362,0.000010216854],"about_ca_topic_score_codex":0.0020935666,"about_ca_topic_score_gemma":0.002029789,"teacher_disagreement_score":0.0020935666,"about_ca_system_score_codex":0.00045755092,"about_ca_system_score_gemma":0.0005708484,"threshold_uncertainty_score":0.005267799},"labels":[],"label_agreement":null},{"id":"W3020948674","doi":"","title":"A progressive barrier derivative-free trust-region algorithm for constrained optimization","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Trust region; Mathematical optimization; Constrained optimization; Domain (mathematical analysis); Computer science; Quadratic equation; Constrained optimization problem; Quadratic programming; Derivative-free optimization; Software; Optimization problem; Derivative (finance); Algorithm; Linear programming; Mathematics; Multi-swarm optimization","score_opus":0.015797965763422062,"score_gpt":0.2590720878640632,"score_spread":0.24327412210064114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020948674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017508429,0.00009858283,0.9971648,0.00004223928,0.00001418757,0.000019884152,0.000011745006,0.00021436131,0.00068336853],"genre_scores_gemma":[0.19478016,0.00023620162,0.800334,0.00012547494,0.00004082115,0.00028803555,0.00015139829,0.00042633188,0.0036176105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992379,0.00025853573,0.000034434204,0.00009727181,0.00030606284,0.000065839246],"domain_scores_gemma":[0.9980421,0.0011605916,0.00015028148,0.00018436874,0.00036288644,0.000099788864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016340058,0.0011569379,0.0012757702,0.0005990909,0.00044494265,0.0009660813,0.0025414133,0.0015927774,0.0027308124],"category_scores_gemma":[0.0050896714,0.00073840393,0.0010493536,0.00063138513,0.00097237574,0.0012797742,0.0021515368,0.0021548448,0.0011069124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009800398,0.00004885219,0.0002430195,0.00013423832,0.000058262245,0.00009212752,0.00010763262,0.9215479,0.004241528,0.016783634,0.0018295991,0.05481523],"study_design_scores_gemma":[0.000009030804,0.000016928447,0.00001326707,0.0000048448387,0.0000035333314,0.000010695961,0.000002161578,0.99733526,0.0005353048,0.0014917606,0.00057328254,0.0000038009305],"about_ca_topic_score_codex":0.0050526364,"about_ca_topic_score_gemma":0.0032261084,"teacher_disagreement_score":0.0050526364,"about_ca_system_score_codex":0.00085854135,"about_ca_system_score_gemma":0.0016382821,"threshold_uncertainty_score":0.0100464225},"labels":[],"label_agreement":null},{"id":"W3021164925","doi":"","title":"Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Algorithm; Noise (video); Computer science; Mathematical optimization; Resampling; Optimization problem; Function (biology); Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.03554069277027166,"score_gpt":0.2584986466939801,"score_spread":0.22295795392370843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021164925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005637608,0.00017388328,0.99258065,0.00010059419,0.000024466613,0.000021131546,0.000015371106,0.00018352219,0.001262804],"genre_scores_gemma":[0.30361325,0.00028342157,0.69264024,0.00014386658,0.00005907004,0.00029728183,0.000099789264,0.00024242561,0.0026206197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993563,0.00030631403,0.000027041853,0.00008408058,0.00018913766,0.000037017282],"domain_scores_gemma":[0.9979069,0.0015807046,0.0001618825,0.00010976649,0.00018794465,0.000052775194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021803053,0.0010493521,0.0015525358,0.0007484536,0.0004088875,0.001073538,0.0011614127,0.001707097,0.001615862],"category_scores_gemma":[0.006425925,0.0006531112,0.00086250546,0.0005898758,0.0011305851,0.0009249529,0.0015813817,0.0012124781,0.0003887187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063659754,0.000020932961,0.00017504787,0.00006798949,0.00004738046,0.000054266722,0.000041564035,0.9702734,0.0018385643,0.010058967,0.0005238084,0.01683451],"study_design_scores_gemma":[0.000008182875,0.0000070072315,0.000015932019,0.000004019389,0.0000022556233,0.0000041728317,0.0000015607374,0.9975527,0.00028854707,0.0019410517,0.00017232972,0.00000232312],"about_ca_topic_score_codex":0.0025254642,"about_ca_topic_score_gemma":0.0018141891,"teacher_disagreement_score":0.0025254642,"about_ca_system_score_codex":0.000756462,"about_ca_system_score_gemma":0.001094312,"threshold_uncertainty_score":0.011530697},"labels":[],"label_agreement":null},{"id":"W3021543573","doi":"","title":"Optimization of Algorithms with OPAL","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Exploit; Solver; sort; Python (programming language); Measure (data warehouse); Algorithm; Optimization problem; Variety (cybernetics); Artificial intelligence; Data mining; Programming language","score_opus":0.015520695504705147,"score_gpt":0.2533568589037115,"score_spread":0.23783616339900637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021543573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022983525,0.00016707298,0.9848898,0.00010505012,0.000043680713,0.00008041441,0.00014745544,0.0026666403,0.009601567],"genre_scores_gemma":[0.11639486,0.00045289603,0.8718806,0.00024141558,0.000069592694,0.0008927309,0.00063115393,0.002052833,0.0073839077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983398,0.0004957715,0.00011177738,0.00020915251,0.0006665869,0.00017697416],"domain_scores_gemma":[0.99733573,0.0016783525,0.00019376991,0.00035762446,0.00036121756,0.00007333288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018517413,0.001626652,0.0010854764,0.00097149657,0.00063673046,0.0023891146,0.001892933,0.0011593401,0.01429462],"category_scores_gemma":[0.00803123,0.0007724105,0.0014766481,0.00092803955,0.00119957,0.0018204552,0.0027460924,0.002071554,0.0032097874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012899943,0.00006620094,0.0004427542,0.0004569499,0.00006897043,0.00006831561,0.00006897102,0.8133194,0.0015965356,0.084974475,0.006702677,0.09210579],"study_design_scores_gemma":[0.000038605453,0.00003158018,0.000047062233,0.000028834182,0.000014172169,0.000023171391,0.000011867406,0.96010166,0.0016804474,0.025942188,0.012071243,0.000009212759],"about_ca_topic_score_codex":0.0027396258,"about_ca_topic_score_gemma":0.003098081,"teacher_disagreement_score":0.01429462,"about_ca_system_score_codex":0.001174189,"about_ca_system_score_gemma":0.0022042948,"threshold_uncertainty_score":0.04782027},"labels":[],"label_agreement":null},{"id":"W3026871182","doi":"10.1109/iccicc46617.2019.9146092","title":"Unique Dragonfly Optimization Algorithm for Harvesting and Clustering the Key Features","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Key (lock); Cluster analysis; Dragonfly; Algorithm design; Algorithm; Artificial intelligence; Geology","score_opus":0.017103044214502358,"score_gpt":0.2685953774522413,"score_spread":0.25149233323773895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026871182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043310978,0.000354624,0.9509053,0.00020165459,0.00009080976,0.00015534302,0.00016403706,0.0008564074,0.003960769],"genre_scores_gemma":[0.27899024,0.00024932408,0.71147555,0.00019096352,0.00003717177,0.00044060638,0.0006898589,0.00016612746,0.00776004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997899,0.000036345395,0.0000136632825,0.000070087925,0.000056967816,0.000032978965],"domain_scores_gemma":[0.9998312,0.00005844178,0.000018161969,0.0000202544,0.0000617134,0.000010208716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041308487,0.00097057875,0.0006283266,0.00087534636,0.0005907909,0.0005967609,0.0009689983,0.0007642479,0.0019446153],"category_scores_gemma":[0.0008634243,0.00026722255,0.0006302906,0.00076034665,0.0003780163,0.0005240876,0.00052406837,0.0005487176,0.00032237594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014709108,0.00010846645,0.0027302196,0.00013096584,0.0001650446,0.0001594682,0.00015785296,0.66628635,0.010310209,0.008170687,0.006635339,0.30499828],"study_design_scores_gemma":[0.000019106224,0.00005300759,0.00054975884,0.000009274831,0.000022494947,0.00005405529,0.00003164712,0.9917537,0.0022066138,0.0021796846,0.003110129,0.000010492156],"about_ca_topic_score_codex":0.010561695,"about_ca_topic_score_gemma":0.014682325,"teacher_disagreement_score":0.010561695,"about_ca_system_score_codex":0.00060948235,"about_ca_system_score_gemma":0.0010715087,"threshold_uncertainty_score":0.021000445},"labels":[],"label_agreement":null},{"id":"W3027599221","doi":"10.1287/trsc.2021.1045","title":"Machine-Learning–Based Column Selection for Column Generation","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column (typography); Column generation; Selection (genetic algorithm); Computer science; Artificial intelligence; Mathematics","score_opus":0.04327470079641512,"score_gpt":0.3154515595752874,"score_spread":0.2721768587788723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027599221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009410804,0.00035121778,0.98636055,0.00012390528,0.00007852866,0.00016391084,0.00016417663,0.0019681505,0.0013787935],"genre_scores_gemma":[0.20930764,0.00034816412,0.78563595,0.00031538517,0.000114117625,0.00054385996,0.0011610816,0.00048267687,0.0020912143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936897,0.0002446275,0.00003133493,0.0001126785,0.00017021103,0.000072219744],"domain_scores_gemma":[0.99779224,0.0013831842,0.00014691903,0.00026175994,0.0003564276,0.000059436225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088478636,0.0014466248,0.0013408088,0.0011370361,0.0005401776,0.0007998846,0.0011464548,0.0007886242,0.0058309315],"category_scores_gemma":[0.0034470542,0.0005340055,0.0010493061,0.0014565963,0.00058306253,0.0009014257,0.0007651668,0.0017985805,0.0014772994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021890474,0.00026439034,0.001186736,0.0003054228,0.00011878903,0.00016053497,0.00007564009,0.6099419,0.012467605,0.010571439,0.012422318,0.3522663],"study_design_scores_gemma":[0.000030311172,0.00005758784,0.0000942902,0.000009148446,0.000013453105,0.000033023363,0.0000073587266,0.9916545,0.0034472332,0.0030494938,0.0015952435,0.000008289261],"about_ca_topic_score_codex":0.0027046145,"about_ca_topic_score_gemma":0.0044195973,"teacher_disagreement_score":0.0058309315,"about_ca_system_score_codex":0.00059242896,"about_ca_system_score_gemma":0.0015656919,"threshold_uncertainty_score":0.019506454},"labels":[],"label_agreement":null},{"id":"W3031120581","doi":"10.35378/gujs.567472","title":"GO: Group Optimization","year":2020,"lang":"en","type":"article","venue":"GAZI UNIVERSITY JOURNAL OF SCIENCE","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Group (periodic table); Benchmark (surveying); Population; Mathematical optimization; Test functions for optimization; Computer science; Optimization problem; Multi-swarm optimization; Mathematics; Medicine; Geography","score_opus":0.023375228490334295,"score_gpt":0.23235297684360762,"score_spread":0.20897774835327332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031120581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003931608,0.0012367801,0.9761869,0.00041322657,0.00028655626,0.00012861809,0.00011175322,0.001178648,0.01652599],"genre_scores_gemma":[0.17000133,0.0021352218,0.8076155,0.0007795668,0.00031326953,0.0008121123,0.0006309808,0.00076987094,0.016942117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926335,0.0002350425,0.000027375709,0.000117683485,0.00029326483,0.000063224405],"domain_scores_gemma":[0.9996656,0.00013226729,0.0000459695,0.000054366414,0.000078068,0.000023735394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007449225,0.0011769818,0.00096383056,0.00096075877,0.0006844756,0.001081571,0.0012391743,0.0010383229,0.0077024996],"category_scores_gemma":[0.0015719233,0.00025874644,0.0009915262,0.0012406223,0.00087725965,0.0013470376,0.0015523997,0.0015872378,0.0020035526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015997724,0.00014047566,0.001325331,0.00058918743,0.00019561566,0.00017042257,0.00017884506,0.3731151,0.006204195,0.17252046,0.026969679,0.41843072],"study_design_scores_gemma":[0.00007416396,0.000243652,0.00049753906,0.00009041877,0.000061025043,0.000265565,0.00007627426,0.81681895,0.0032947178,0.09679615,0.08173649,0.000045004817],"about_ca_topic_score_codex":0.0018494072,"about_ca_topic_score_gemma":0.0014748324,"teacher_disagreement_score":0.0077024996,"about_ca_system_score_codex":0.0005028881,"about_ca_system_score_gemma":0.0008679574,"threshold_uncertainty_score":0.025767446},"labels":[],"label_agreement":null},{"id":"W3035777076","doi":"10.1109/tfuzz.2020.3003506","title":"Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":273,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Job shop scheduling; Fuzzy logic; Selection (genetic algorithm); Particle swarm optimization; Differential evolution; Ant colony optimization algorithms; Algorithm; Metaheuristic; Scheduling (production processes); Cuckoo search; Artificial intelligence; Mathematics","score_opus":0.030944227083376012,"score_gpt":0.26883499607407885,"score_spread":0.23789076899070283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035777076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07920949,0.00047448647,0.9158454,0.00014388151,0.00006634098,0.00012632963,0.000031131312,0.00019582295,0.003907092],"genre_scores_gemma":[0.619339,0.0004128278,0.37740594,0.000069816066,0.000043277083,0.00023801805,0.00011156023,0.000022904243,0.0023567015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972266,0.00008301969,0.000023989836,0.000056580877,0.00007666922,0.0000370891],"domain_scores_gemma":[0.9996735,0.00018071353,0.000037484104,0.000022419224,0.00006576344,0.000020062073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065091794,0.0007644676,0.001121498,0.00056035543,0.0005529615,0.0004985005,0.0007326521,0.0008274805,0.00077891356],"category_scores_gemma":[0.0008845128,0.0002971474,0.0007155014,0.0006585945,0.000306159,0.0005400633,0.0004613182,0.0005719016,0.00011293966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000995319,0.00015251961,0.00094792614,0.00013749397,0.000079614736,0.00020190695,0.000074718475,0.88587844,0.010038499,0.0069804066,0.0007388193,0.09467014],"study_design_scores_gemma":[0.00003082358,0.00007809087,0.00016760833,0.0000044578446,0.000013668806,0.00005354091,0.000010851923,0.99653983,0.0015764624,0.00095605914,0.0005620168,0.0000065503264],"about_ca_topic_score_codex":0.0025078538,"about_ca_topic_score_gemma":0.0025749737,"teacher_disagreement_score":0.0025078538,"about_ca_system_score_codex":0.00043334367,"about_ca_system_score_gemma":0.0008502606,"threshold_uncertainty_score":0.0049865246},"labels":[],"label_agreement":null},{"id":"W3037515722","doi":"10.1007/978-981-15-5097-3_1","title":"A New Hybrid Binary Algorithm of Bat Algorithm and Differential Evolution for Feature Selection and Classification","year":2020,"lang":"en","type":"book-chapter","venue":"Springer tracts in nature-inspired computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Feature selection; Algorithm; Feature (linguistics); Binary number; Differential evolution; Computer science; Hybrid algorithm (constraint satisfaction); Pattern recognition (psychology); Binary search algorithm; Feature vector; Selection (genetic algorithm); Artificial intelligence; Search algorithm; Mathematics","score_opus":0.017753577867762244,"score_gpt":0.26655588747376263,"score_spread":0.2488023096060004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037515722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059987092,0.0009345496,0.98776823,0.00012559145,0.00030036565,0.00006662057,0.00005063168,0.0007481639,0.004007057],"genre_scores_gemma":[0.10306002,0.000542047,0.88370687,0.0002870088,0.0001949947,0.00028390565,0.0002904723,0.00017538473,0.011459224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948287,0.00008590964,0.000028182132,0.000110084315,0.00025348543,0.000039499984],"domain_scores_gemma":[0.9996587,0.00010320857,0.000021983638,0.00003454701,0.00015579602,0.000025826443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006018689,0.0005978779,0.0012769707,0.000953266,0.00046454635,0.00085473235,0.0016294685,0.0011028028,0.0040145065],"category_scores_gemma":[0.0009155139,0.0003297592,0.00058976194,0.0017370576,0.0003711428,0.001039582,0.00093906844,0.0008363584,0.0013195436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018373723,0.00013156478,0.0005653269,0.00017828472,0.00011922579,0.000092974355,0.00006192659,0.088373,0.02506834,0.017967708,0.009547628,0.85771024],"study_design_scores_gemma":[0.0000375692,0.00007932592,0.00041211574,0.000012230398,0.00002510312,0.00017745545,0.000009604209,0.9826087,0.0037358727,0.004127563,0.008755252,0.000019265924],"about_ca_topic_score_codex":0.0017370228,"about_ca_topic_score_gemma":0.0022437975,"teacher_disagreement_score":0.0040145065,"about_ca_system_score_codex":0.0004054729,"about_ca_system_score_gemma":0.000522606,"threshold_uncertainty_score":0.013429821},"labels":[],"label_agreement":null},{"id":"W3037776504","doi":"10.1609/aaai.v34i10.7240","title":"Improving First-Order Optimization Algorithms (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Convergence (economics); Computer science; Simple (philosophy); Variation (astronomy); Optimization algorithm; Algorithm; Order (exchange); First order; Mathematical optimization; Optimization problem; Mathematics; Applied mathematics","score_opus":0.09028591067846972,"score_gpt":0.3156316506765263,"score_spread":0.2253457399980566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037776504","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016849916,0.00065215194,0.97590655,0.00021546624,0.00026635066,0.00004231597,0.000026067275,0.001187504,0.0048536276],"genre_scores_gemma":[0.24187489,0.00075091043,0.74417394,0.00022469251,0.00022280855,0.00010159793,0.0001093946,0.000427274,0.012114533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994198,0.00015452395,0.000026094203,0.00009003277,0.0002568954,0.00005268621],"domain_scores_gemma":[0.9985489,0.00076674536,0.00009458903,0.00020407239,0.00033755894,0.000048044312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371125,0.0007344644,0.00065088377,0.00066347286,0.00032136822,0.00088561204,0.0007481466,0.0007686459,0.0054970738],"category_scores_gemma":[0.0056774914,0.00026009913,0.00056963525,0.00049083325,0.00045042954,0.0008947218,0.0008340894,0.0013580195,0.0019860712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017246322,0.00022048749,0.00090675865,0.00037013076,0.0000739497,0.00007218893,0.0001525882,0.44186884,0.015797699,0.03176852,0.0064661256,0.5021303],"study_design_scores_gemma":[0.000024225616,0.00012462569,0.00028303917,0.000020686082,0.000012784874,0.00005883084,0.000007662658,0.9792606,0.007847296,0.0071475045,0.005199995,0.000012678464],"about_ca_topic_score_codex":0.0017201508,"about_ca_topic_score_gemma":0.0019168404,"teacher_disagreement_score":0.0054970738,"about_ca_system_score_codex":0.0004195185,"about_ca_system_score_gemma":0.0006988768,"threshold_uncertainty_score":0.018389523},"labels":[],"label_agreement":null},{"id":"W3038180300","doi":"10.1007/s10489-020-01736-x","title":"A novel multi-classifier based on a density-dependent quantized binary tree LSSVM and the logistic global whale optimization algorithm","year":2020,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Zhejiang Province Public Welfare Technology Application Research Project; National Natural Science Foundation of China","keywords":"Computer science; Support vector machine; Classifier (UML); Binary tree; Artificial intelligence; Pattern recognition (psychology); Binary number; Binary classification; Algorithm; Data mining; Mathematics","score_opus":0.0812980354975812,"score_gpt":0.3059682613424227,"score_spread":0.22467022584484153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038180300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013758946,0.0008189995,0.9824636,0.00026275966,0.0001815837,0.0000751497,0.00006464541,0.0008059169,0.0015684733],"genre_scores_gemma":[0.41192386,0.00072727114,0.57751364,0.0005826723,0.00033312794,0.0003253158,0.00048503192,0.00017323217,0.007935815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991055,0.00018723545,0.000060497405,0.00021205633,0.00034776688,0.000086829525],"domain_scores_gemma":[0.99929035,0.00018861344,0.000055363056,0.00005925354,0.00035868507,0.00004773167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010744137,0.0006275761,0.0019454216,0.0011131909,0.0007005546,0.0013761728,0.0019958578,0.0015530194,0.0023475986],"category_scores_gemma":[0.002099527,0.0003909848,0.0006514995,0.0012868433,0.00039355588,0.0022606773,0.00130686,0.0013433313,0.001166913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029064337,0.000222462,0.0019075777,0.00018751856,0.00017788222,0.000111304165,0.000076461474,0.10361463,0.014851452,0.011695539,0.0088795,0.857985],"study_design_scores_gemma":[0.000009392673,0.000032768396,0.00022491587,0.000006707381,0.000012544441,0.000050739087,0.000007290986,0.99565506,0.0015540811,0.0013490751,0.0010884767,0.000009008834],"about_ca_topic_score_codex":0.0026279094,"about_ca_topic_score_gemma":0.0025266055,"teacher_disagreement_score":0.0026279094,"about_ca_system_score_codex":0.00063941354,"about_ca_system_score_gemma":0.0010164042,"threshold_uncertainty_score":0.007853448},"labels":[],"label_agreement":null},{"id":"W3038266931","doi":"10.1007/s00521-020-05124-x","title":"Volcano eruption algorithm for solving optimization problems","year":2020,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Heuristic; Algorithm; Mathematical optimization; Optimization problem; Mathematics; Artificial intelligence","score_opus":0.03808148974480686,"score_gpt":0.29749284758205263,"score_spread":0.2594113578372458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038266931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012819483,0.0009714721,0.9762139,0.00035194503,0.0002459801,0.000103613405,0.00010036217,0.00042713698,0.008766167],"genre_scores_gemma":[0.19926699,0.0005819247,0.7908635,0.00032141226,0.00017657262,0.0007365986,0.00031089218,0.00023814615,0.0075038783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997433,0.00010483904,0.000013172737,0.00003476245,0.00007773706,0.000026154528],"domain_scores_gemma":[0.9993882,0.00043155573,0.00003388767,0.000035115623,0.00009312655,0.000018136652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702314,0.00089057203,0.00094561675,0.00066644506,0.00047982318,0.0007515409,0.0012671395,0.0016907268,0.004137397],"category_scores_gemma":[0.0024204059,0.00045606692,0.0008223676,0.0009377098,0.00051872927,0.0007192485,0.0007554261,0.0018111141,0.00056402816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009191078,0.00007674601,0.00058741437,0.00016007632,0.000120140794,0.00006902515,0.00006279258,0.83406866,0.0011250082,0.022154428,0.005290664,0.13619317],"study_design_scores_gemma":[0.000022766371,0.000017475804,0.00009241702,0.000009298197,0.000010535373,0.000012581551,0.0000062552017,0.9945433,0.00019950866,0.0034632895,0.0016195874,0.0000029704117],"about_ca_topic_score_codex":0.0040539065,"about_ca_topic_score_gemma":0.00466194,"teacher_disagreement_score":0.004137397,"about_ca_system_score_codex":0.0005534856,"about_ca_system_score_gemma":0.000969122,"threshold_uncertainty_score":0.013840973},"labels":[],"label_agreement":null},{"id":"W3041876715","doi":"","title":"A Dynamic Algorithm Framework to Automatically Design a Multi-Objective Local Search","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Computer science; Algorithm design; Algorithm","score_opus":0.02373381528130716,"score_gpt":0.28847793271245953,"score_spread":0.2647441174311524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041876715","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009070822,0.000029187351,0.99689424,0.000027755206,0.000014723692,0.000033646123,0.00001729295,0.00070732116,0.0013686982],"genre_scores_gemma":[0.0865076,0.00007932562,0.90946424,0.00008384402,0.000028160073,0.00038465235,0.00013440123,0.0006504238,0.0026673556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994168,0.00014427163,0.000034351735,0.00014696133,0.00019857545,0.000059051625],"domain_scores_gemma":[0.999215,0.00039608416,0.000071286755,0.000084526924,0.00018911938,0.00004399961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088775,0.0013009828,0.0011363383,0.0012825815,0.00073587324,0.0013450858,0.0019533685,0.0018607829,0.009096278],"category_scores_gemma":[0.0033323618,0.0008776225,0.0011808899,0.0007845751,0.00082856376,0.001077748,0.001759435,0.0018130885,0.0020044213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007407288,0.00009652553,0.00030901458,0.00020007155,0.000055477543,0.00010381704,0.000102654114,0.7758783,0.009374147,0.036445975,0.0036263675,0.17373359],"study_design_scores_gemma":[0.000013788171,0.000016658296,0.000021216845,0.000008682757,0.0000064577835,0.000015155508,0.0000055649502,0.993672,0.0010985206,0.0032777635,0.0018594275,0.0000047064473],"about_ca_topic_score_codex":0.0029157056,"about_ca_topic_score_gemma":0.004006661,"teacher_disagreement_score":0.009096278,"about_ca_system_score_codex":0.0009796727,"about_ca_system_score_gemma":0.0012638158,"threshold_uncertainty_score":0.030430019},"labels":[],"label_agreement":null},{"id":"W3043371792","doi":"10.1007/s00366-020-01101-z","title":"Adaptive multi-tracker optimization algorithm for global optimization problems: emphasis on applications in chemical engineering","year":2020,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Particle swarm optimization; Computer science; Mathematical optimization; Engineering optimization; Meta-optimization; Algorithm; Multi-swarm optimization; Global optimization; Optimization problem; Derivative-free optimization; Metaheuristic; Genetic algorithm; Mathematics","score_opus":0.02017940809623833,"score_gpt":0.24406265440797975,"score_spread":0.22388324631174142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043371792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019438529,0.0006994071,0.9948021,0.00010332384,0.00012920641,0.000016965996,0.000012628685,0.00015694673,0.0021357094],"genre_scores_gemma":[0.13723193,0.0014313012,0.8525575,0.00028318152,0.00026014165,0.0002939162,0.00015240177,0.0002529069,0.0075366464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996239,0.00013923208,0.00001575659,0.00006452295,0.0001377711,0.000018822648],"domain_scores_gemma":[0.99931395,0.00036206868,0.000075182805,0.000052396936,0.00016598613,0.000030479614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013281811,0.0008392188,0.0010038782,0.0008332422,0.0005417167,0.00093547185,0.0011891938,0.001748216,0.002537162],"category_scores_gemma":[0.0025717106,0.00043326974,0.00069433654,0.0015064053,0.00066284236,0.0010789025,0.0011938534,0.0015268712,0.0008503481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010970931,0.00007271605,0.0005623742,0.00019756547,0.00010027716,0.00006051361,0.000054939235,0.7261718,0.0038524265,0.024165323,0.0045297043,0.24012262],"study_design_scores_gemma":[0.000013021145,0.000027648222,0.000098709264,0.000009416977,0.000007804737,0.000016959193,0.0000027265885,0.9950311,0.00037800122,0.0027237886,0.001685902,0.000004969478],"about_ca_topic_score_codex":0.0015009936,"about_ca_topic_score_gemma":0.0018218777,"teacher_disagreement_score":0.002537162,"about_ca_system_score_codex":0.00043468978,"about_ca_system_score_gemma":0.00086096174,"threshold_uncertainty_score":0.008487642},"labels":[],"label_agreement":null},{"id":"W3045156188","doi":"10.1007/s11063-020-10290-z","title":"An Analysis of Activation Function Saturation in Particle Swarm Optimization Trained Neural Networks","year":2020,"lang":"en","type":"article","venue":"Neural Processing Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Activation function; Artificial neural network; Particle swarm optimization; Saturation (graph theory); Computer science; Control theory (sociology); Mathematics; Artificial intelligence; Algorithm","score_opus":0.030625162446549385,"score_gpt":0.2784958512715978,"score_spread":0.24787068882504842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045156188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27449423,0.002285612,0.6740863,0.001181888,0.00013407567,0.00013670222,0.000056362842,0.00033265926,0.047292233],"genre_scores_gemma":[0.9876253,0.00028046014,0.008569416,0.00006851977,0.000021925582,0.000032316573,0.000019368015,0.0000498703,0.0033328487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971956,0.00010957551,0.000010586016,0.000027230953,0.00008258684,0.000050367275],"domain_scores_gemma":[0.996497,0.0027963866,0.00012857509,0.000092014576,0.0004330872,0.00005300214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018173453,0.0004564514,0.0005206835,0.00039426464,0.00038135043,0.00083918596,0.0006971499,0.0008070462,0.002423927],"category_scores_gemma":[0.0086957505,0.00031082792,0.00034497536,0.00032459304,0.0008142111,0.0011924686,0.00065518945,0.00066843734,0.00017470052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024701087,0.00007033273,0.0017824057,0.00023107577,0.000049997667,0.00028118072,0.00023438185,0.9058678,0.006538639,0.05529002,0.00094158686,0.028465511],"study_design_scores_gemma":[0.0000021612022,0.000017118373,0.00018824637,0.000008947382,0.0000037510843,0.000017832555,0.000011708626,0.99611264,0.0007829545,0.0027001912,0.00015230487,0.0000021095361],"about_ca_topic_score_codex":0.0024150466,"about_ca_topic_score_gemma":0.0011982243,"teacher_disagreement_score":0.002423927,"about_ca_system_score_codex":0.0009463947,"about_ca_system_score_gemma":0.0006643036,"threshold_uncertainty_score":0.00961113},"labels":[],"label_agreement":null},{"id":"W3045216940","doi":"10.1109/iccicc46617.2019.9146062","title":"Cognitive Hybrid PSO/SA Combinatorial Optimization","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Particle swarm optimization; Simulated annealing; Computer science; Mathematical optimization; Population; Swarm behaviour; Artificial intelligence; Algorithm; Mathematics","score_opus":0.01563574098735643,"score_gpt":0.27639860263778804,"score_spread":0.2607628616504316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045216940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02093387,0.0006515243,0.94595844,0.00016671531,0.00015424601,0.000073541014,0.000047254063,0.0008235493,0.031190908],"genre_scores_gemma":[0.61296636,0.0006986922,0.3690637,0.00032784708,0.00015539055,0.00027951552,0.00013047886,0.00019068847,0.016187327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997149,0.00007151033,0.000011171235,0.00003904823,0.00013352653,0.000029826262],"domain_scores_gemma":[0.9997545,0.000100057456,0.000022809769,0.000036572263,0.00006819826,0.00001798493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038389076,0.0005149237,0.0005670159,0.0005061342,0.00035281462,0.0010469237,0.0011812936,0.0007654743,0.0029288186],"category_scores_gemma":[0.00090252917,0.00022352183,0.00065702095,0.00046216545,0.0004317665,0.00053568097,0.00076284003,0.0006002589,0.000646515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001022699,0.00009592317,0.00056884356,0.00015479849,0.000120866855,0.00013830955,0.00008627707,0.81151295,0.008822681,0.051432017,0.0026955237,0.12426952],"study_design_scores_gemma":[0.000016504346,0.000031635063,0.00013955064,0.00000627102,0.000012579768,0.000042378564,0.0000058921514,0.99038005,0.0009792603,0.00455884,0.0038179012,0.000009114705],"about_ca_topic_score_codex":0.0027673377,"about_ca_topic_score_gemma":0.0028332947,"teacher_disagreement_score":0.0029288186,"about_ca_system_score_codex":0.0003925674,"about_ca_system_score_gemma":0.00060251635,"threshold_uncertainty_score":0.009797871},"labels":[],"label_agreement":null},{"id":"W3046155783","doi":"10.1002/eng2.12212","title":"A critical analysis of the bat algorithm","year":2020,"lang":"en","type":"article","venue":"Engineering Reports","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Metaheuristic; Particle swarm optimization; Simulated annealing; Computer science; Algorithm; Parallel metaheuristic; Transparency (behavior); Set (abstract data type); Mathematical optimization; MATLAB; Metric (unit); Multi-swarm optimization; Swarm behaviour; Mathematics; Artificial intelligence; Engineering; Programming language","score_opus":0.013528581523987311,"score_gpt":0.254937177008857,"score_spread":0.24140859548486968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046155783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052784484,0.005032525,0.88741255,0.0019134713,0.0009131364,0.0002661464,0.00020896886,0.000948953,0.050519805],"genre_scores_gemma":[0.7586409,0.0019848694,0.22328858,0.00064884505,0.0006446933,0.00025884356,0.0003459596,0.0008417051,0.013345623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995854,0.0014601108,0.00015217779,0.00040777898,0.0019028257,0.00022308376],"domain_scores_gemma":[0.980547,0.01255635,0.00078344194,0.0009003467,0.0049755853,0.00023733999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047841845,0.0008441588,0.000801354,0.0020210412,0.0010565539,0.0026909758,0.0009465448,0.0007731756,0.010012233],"category_scores_gemma":[0.033722367,0.00035768823,0.0007511421,0.0013998523,0.0017249895,0.0026210346,0.0011175483,0.001890215,0.001629865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004860548,0.000104498125,0.003279877,0.0006637556,0.00013813064,0.00038861326,0.00048271773,0.24602081,0.012320912,0.53490394,0.013355562,0.18785511],"study_design_scores_gemma":[0.000034258792,0.00028319654,0.0018997383,0.00017382494,0.000059285067,0.0004986853,0.00022068708,0.8641441,0.0117063215,0.09576641,0.02516135,0.000052128737],"about_ca_topic_score_codex":0.0030745978,"about_ca_topic_score_gemma":0.0012310774,"teacher_disagreement_score":0.010012233,"about_ca_system_score_codex":0.0022191976,"about_ca_system_score_gemma":0.0021967397,"threshold_uncertainty_score":0.033494294},"labels":[],"label_agreement":null},{"id":"W3080812861","doi":"10.3390/app10175791","title":"A New “Doctor and Patient” Optimization Algorithm: An Application to Energy Commitment Problem","year":2020,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Optimization problem; Optimization algorithm; Computer science; Energy (signal processing); Algorithm; Medicine; Mathematics; Statistics","score_opus":0.024152006813521264,"score_gpt":0.2714993904695966,"score_spread":0.24734738365607534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080812861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0343893,0.00029836025,0.9597974,0.00068941887,0.00007855564,0.00011181278,0.00007064679,0.00016848982,0.0043960493],"genre_scores_gemma":[0.42374104,0.00027818812,0.5709725,0.00028813965,0.000084507876,0.0002447871,0.0001571646,0.000064374,0.0041693673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953365,0.00023736167,0.000026461572,0.00008156663,0.000084053005,0.000036974026],"domain_scores_gemma":[0.999385,0.00042003344,0.000051057552,0.000027597911,0.00008061235,0.000035620473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475639,0.00054883276,0.000753509,0.00041422513,0.00037824825,0.0006951758,0.0008081594,0.0015054002,0.0022248905],"category_scores_gemma":[0.00170491,0.00030135497,0.00043639203,0.000582607,0.00037070064,0.0007458687,0.00072961976,0.0009044726,0.00019909217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009663765,0.00008671121,0.0007991351,0.000065333006,0.000041001567,0.00005615185,0.000033296168,0.93551683,0.00072762737,0.006143773,0.0014257765,0.05500768],"study_design_scores_gemma":[0.00001903463,0.00003233339,0.00007706755,0.000002794066,0.0000048033453,0.00002081988,0.0000066701205,0.99829334,0.00017216336,0.0008400689,0.0005276123,0.000003302642],"about_ca_topic_score_codex":0.0024389555,"about_ca_topic_score_gemma":0.0020072584,"teacher_disagreement_score":0.0024389555,"about_ca_system_score_codex":0.00046470095,"about_ca_system_score_gemma":0.0009176955,"threshold_uncertainty_score":0.007443011},"labels":[],"label_agreement":null},{"id":"W3083093249","doi":"10.1109/cec48606.2020.9185905","title":"A Collective Intelligence Strategy for Enhancing Population-based optimization Algorithms","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Swarm intelligence; Population; Benchmark (surveying); Computer science; Particle swarm optimization; Cluster analysis; Metaheuristic; Computational intelligence; Mathematical optimization; Algorithm; Variable (mathematics); Dimension (graph theory); Differential evolution; Artificial intelligence; Mathematics","score_opus":0.07282423385889047,"score_gpt":0.32890944278569056,"score_spread":0.2560852089268001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083093249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020803902,0.00075692876,0.9662833,0.00030417062,0.00011866491,0.000093248076,0.000016394892,0.00028087274,0.011342518],"genre_scores_gemma":[0.6557564,0.0011015284,0.33546415,0.00031761496,0.000154712,0.00043731887,0.000084082094,0.00007488372,0.0066093444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994999,0.00013924189,0.000029195568,0.00007290172,0.00021943147,0.000039227893],"domain_scores_gemma":[0.9995572,0.00016562564,0.000056099376,0.000049258815,0.00014268485,0.000029107247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009461764,0.0007576304,0.00063546374,0.00085263775,0.0005159759,0.00092081924,0.000993894,0.00081999105,0.0013132141],"category_scores_gemma":[0.0019683486,0.0002011167,0.0006123751,0.0007452534,0.0005596053,0.0010216414,0.001203561,0.0006969426,0.00029298823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006317502,0.00013177232,0.0018286952,0.00021471201,0.00016271694,0.00033129673,0.0004750796,0.5680661,0.0186825,0.07281604,0.0042014383,0.3330265],"study_design_scores_gemma":[0.00003217115,0.0001710497,0.0004177409,0.000028941238,0.00005184073,0.00015537564,0.00005653346,0.9728486,0.002900363,0.0120652225,0.0112526985,0.000019405785],"about_ca_topic_score_codex":0.0009315569,"about_ca_topic_score_gemma":0.00073970685,"teacher_disagreement_score":0.0013132141,"about_ca_system_score_codex":0.00041002122,"about_ca_system_score_gemma":0.00048406865,"threshold_uncertainty_score":0.005003929},"labels":[],"label_agreement":null},{"id":"W3083168801","doi":"10.1109/cec48606.2020.9185622","title":"A Novel Center-based Differential Evolution Algorithm","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Center (category theory); Differential evolution; Algorithm","score_opus":0.036347911771434475,"score_gpt":0.2680558174597069,"score_spread":0.23170790568827243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083168801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009913018,0.00041789492,0.98376024,0.00013335353,0.00008924163,0.000062726904,0.00004315941,0.00037125265,0.0052091056],"genre_scores_gemma":[0.4452108,0.0006149036,0.5423115,0.000375562,0.00010128541,0.00035448486,0.000299956,0.00015200218,0.010579522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996031,0.00007438456,0.000019832847,0.00007472228,0.00018242974,0.00004564355],"domain_scores_gemma":[0.9997229,0.000079234196,0.000029207346,0.000026153895,0.00012019507,0.000022198152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059858634,0.00060041534,0.0010777946,0.0005980683,0.0004676703,0.00077880296,0.001709954,0.0010324862,0.0023550517],"category_scores_gemma":[0.0010795678,0.00028290285,0.00058892526,0.0007375498,0.0004347863,0.0008114158,0.0011188443,0.00068491313,0.0006075227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017207158,0.00011877078,0.0013289024,0.00013328389,0.000094065974,0.0001931239,0.00013317908,0.64071256,0.014373368,0.03041517,0.0062594917,0.306066],"study_design_scores_gemma":[0.00002417267,0.000034399076,0.00007951207,0.0000051870393,0.00000895565,0.000060116476,0.0000055724536,0.99326915,0.0012226346,0.0018823103,0.0034003928,0.000007543104],"about_ca_topic_score_codex":0.0022995612,"about_ca_topic_score_gemma":0.001744281,"teacher_disagreement_score":0.0023550517,"about_ca_system_score_codex":0.00057988416,"about_ca_system_score_gemma":0.00087882834,"threshold_uncertainty_score":0.007878363},"labels":[],"label_agreement":null},{"id":"W3083305467","doi":"10.1109/cec48606.2020.9185801","title":"Particle Swarm optimization with pbest Perturbations","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Metaheuristic; Swarm behaviour; Computer science; Mathematical optimization; Premature convergence; Stall (fluid mechanics); Engineering; Mathematics; Algorithm; Aerospace engineering","score_opus":0.03605183170860734,"score_gpt":0.25568046351547946,"score_spread":0.21962863180687212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083305467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013815784,0.00095159275,0.9715517,0.00035403346,0.0003034265,0.00018646025,0.000093660594,0.0012475011,0.011495807],"genre_scores_gemma":[0.4790235,0.0011025501,0.5012919,0.00049130956,0.0002184128,0.0010009999,0.00029874762,0.00036382786,0.016208742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994104,0.00022458527,0.0000295371,0.00009214482,0.00019053834,0.00005284815],"domain_scores_gemma":[0.9994936,0.00022947244,0.000060875453,0.00007415042,0.00011472129,0.000027163593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007475199,0.0011660402,0.0012229502,0.00051737134,0.00058657525,0.0009550251,0.0010700047,0.0012721962,0.0022375453],"category_scores_gemma":[0.002884952,0.00042798545,0.0005652043,0.0007396244,0.000745546,0.00076670037,0.001214155,0.0015609472,0.0010957599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012909858,0.00007191958,0.00050024857,0.00012757299,0.00007879965,0.00011315638,0.000071935974,0.9203623,0.0027264447,0.020284347,0.0043955655,0.05113867],"study_design_scores_gemma":[0.000034848523,0.00006142099,0.00009015293,0.00001190371,0.0000125862125,0.00002322435,0.00000800603,0.9891916,0.001110723,0.0054587694,0.0039879335,0.000008716851],"about_ca_topic_score_codex":0.0035512382,"about_ca_topic_score_gemma":0.002324048,"teacher_disagreement_score":0.0035512382,"about_ca_system_score_codex":0.0004425814,"about_ca_system_score_gemma":0.001013782,"threshold_uncertainty_score":0.0074853897},"labels":[],"label_agreement":null},{"id":"W3083331092","doi":"10.1109/cec48606.2020.9185640","title":"A Dimension-Wise Particle Swarm Optimization Algorithm Optimized via Self-Tuning","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Dimension (graph theory); Convergence (economics); Mathematical optimization; Algorithm; Sinc function; Computer science; Maxima; Multi-swarm optimization; Mathematics","score_opus":0.025018188623965324,"score_gpt":0.26486012517601587,"score_spread":0.23984193655205055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083331092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011065071,0.0002161454,0.9848343,0.000101140526,0.00011099187,0.00006393775,0.000022402603,0.00037954113,0.00320644],"genre_scores_gemma":[0.2675195,0.00024880457,0.72676116,0.00020817219,0.00009899995,0.00033704282,0.00015655532,0.00013814682,0.004531682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968445,0.00009405281,0.00001797143,0.00006531824,0.000115263385,0.0000230118],"domain_scores_gemma":[0.9996253,0.00014372954,0.00004844236,0.000047727368,0.00011613517,0.000018553737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079384824,0.00062952604,0.00081536826,0.00053141976,0.00045752715,0.0006831787,0.0008152343,0.0009290663,0.001266132],"category_scores_gemma":[0.001817489,0.0002810495,0.00048592803,0.00061254203,0.000406847,0.00052536547,0.0006182436,0.00073628186,0.0004974197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008295985,0.000097089,0.0011237325,0.00011056741,0.00011276601,0.000080056474,0.00010802992,0.78115517,0.0068970136,0.011714292,0.00360355,0.19491474],"study_design_scores_gemma":[0.000017741848,0.0000484991,0.00016634633,0.000006352973,0.0000103645025,0.0000299823,0.0000052868786,0.9965322,0.0006513862,0.0010243435,0.001500997,0.0000065205713],"about_ca_topic_score_codex":0.0014557483,"about_ca_topic_score_gemma":0.0015839224,"teacher_disagreement_score":0.0014557483,"about_ca_system_score_codex":0.00032271727,"about_ca_system_score_gemma":0.0006482528,"threshold_uncertainty_score":0.0042356253},"labels":[],"label_agreement":null},{"id":"W3083389769","doi":"10.3390/app10186173","title":"A Spring Search Algorithm Applied to Engineering Optimization Problems","year":2020,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematical optimization; Spring (device); Algorithm; Mathematics; Engineering; Mechanical engineering","score_opus":0.0391604103543382,"score_gpt":0.25997314368535607,"score_spread":0.22081273333101786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083389769","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031551712,0.000569027,0.9871428,0.00029200048,0.00013386377,0.00008280134,0.00004569072,0.0003506411,0.008228127],"genre_scores_gemma":[0.16105953,0.0014170954,0.82245755,0.00034452812,0.00021288494,0.00070634455,0.00025085986,0.0002990252,0.0132521745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999438,0.00019744474,0.000043393215,0.00007770531,0.00021031038,0.000033210974],"domain_scores_gemma":[0.99939454,0.00034871264,0.00004490109,0.000049061644,0.00013971615,0.000022979208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010029471,0.0013883878,0.001047178,0.0009443482,0.0007994339,0.00091694127,0.0008932256,0.0015652038,0.0047028787],"category_scores_gemma":[0.0026166828,0.00047400183,0.0011059163,0.0012632963,0.000854607,0.0008684864,0.0011992056,0.0014107923,0.0013939767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058871527,0.00007409257,0.00091250695,0.00026019075,0.00013076176,0.00019834648,0.00011394622,0.7527279,0.003667969,0.06538389,0.0063913134,0.17008018],"study_design_scores_gemma":[0.000024142857,0.000045702764,0.00013922848,0.000033022578,0.000015576268,0.00006299064,0.000014147691,0.9715647,0.00085593533,0.01687604,0.010358479,0.000010050085],"about_ca_topic_score_codex":0.0031422398,"about_ca_topic_score_gemma":0.0027584396,"teacher_disagreement_score":0.0047028787,"about_ca_system_score_codex":0.00058507273,"about_ca_system_score_gemma":0.0015821079,"threshold_uncertainty_score":0.015732646},"labels":[],"label_agreement":null},{"id":"W3086117886","doi":"10.1007/978-3-030-53552-0","title":"Learning and Intelligent Optimization","year":2020,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Management science; Artificial intelligence; Optimization problem; Operations research; Mathematical optimization; Algorithm; Mathematics; Engineering","score_opus":0.019819963772325627,"score_gpt":0.2804922444318599,"score_spread":0.26067228065953424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086117886","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045371456,0.08011345,0.4264763,0.0053056595,0.0024585163,0.000062182786,0.00028381022,0.00084001577,0.47992292],"genre_scores_gemma":[0.13956207,0.055730898,0.14569622,0.0018170394,0.0032946859,0.00028411596,0.00069816376,0.0008301446,0.6520867],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977654,0.000055197466,0.000008493812,0.000038933318,0.00010516207,0.000015708774],"domain_scores_gemma":[0.9997613,0.00013297064,0.000014069374,0.000047953556,0.000031600684,0.000012181616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032974224,0.0009533968,0.0011376294,0.0006385043,0.00033669607,0.0014765004,0.0005985812,0.00072452775,0.019335238],"category_scores_gemma":[0.0010392051,0.00033782978,0.00048951915,0.0011115533,0.0011461541,0.0018029861,0.0010053804,0.0017153984,0.0064304536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027618826,0.00005685182,0.00018412095,0.0004010162,0.000057993304,0.000039252656,0.00010111713,0.037478883,0.0010652755,0.42306706,0.10913434,0.4283865],"study_design_scores_gemma":[0.000011961344,0.00004123585,0.00041026584,0.00018047652,0.00002245395,0.00010812859,0.000040514205,0.05949474,0.0010228559,0.66683227,0.27181804,0.000017049628],"about_ca_topic_score_codex":0.00063215854,"about_ca_topic_score_gemma":0.0008758987,"teacher_disagreement_score":0.019335238,"about_ca_system_score_codex":0.00066385174,"about_ca_system_score_gemma":0.00039621996,"threshold_uncertainty_score":0.06468284},"labels":[],"label_agreement":null},{"id":"W3095288545","doi":"10.1115/detc2020-22519","title":"Enhanced Particle Swarm Optimization via Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Particle swarm optimization; Reinforcement learning; Convergence (economics); Mathematical optimization; Multi-swarm optimization; Computer science; Swarm behaviour; Function (biology); Optimization problem; Rate of convergence; Mathematics; Artificial intelligence","score_opus":0.029799692061631605,"score_gpt":0.27488222554676184,"score_spread":0.24508253348513023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095288545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034850348,0.00038004175,0.9578093,0.00025435156,0.000102761056,0.00006433972,0.00001862972,0.0004014527,0.006118712],"genre_scores_gemma":[0.92412215,0.00016368952,0.07279263,0.00010693372,0.00004607165,0.00011562315,0.00003718184,0.000032163716,0.0025835873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999519,0.00017948425,0.000022267339,0.00006834299,0.00015868852,0.00005223778],"domain_scores_gemma":[0.99926096,0.00035107907,0.000090069465,0.000051790114,0.00020631524,0.000039735984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709246,0.0005898471,0.00097612286,0.00044180956,0.00032974881,0.00067995273,0.0007691826,0.00077964977,0.001186995],"category_scores_gemma":[0.0020835646,0.00026180412,0.0004285378,0.00031688221,0.00063323707,0.0005469598,0.00074021914,0.0007827567,0.00021338831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035609402,0.00004603657,0.00038589165,0.00003169997,0.000022648595,0.000045972032,0.00002266385,0.9730555,0.0010691938,0.0036630419,0.00053400476,0.021087814],"study_design_scores_gemma":[0.000007916589,0.000014210301,0.000037343623,0.0000017743058,0.000002119366,0.0000047653593,0.0000010810045,0.9991597,0.00011779826,0.00049708545,0.00015477646,0.0000013900626],"about_ca_topic_score_codex":0.0049597262,"about_ca_topic_score_gemma":0.0022858821,"teacher_disagreement_score":0.0049597262,"about_ca_system_score_codex":0.00059668807,"about_ca_system_score_gemma":0.000764638,"threshold_uncertainty_score":0.009861708},"labels":[],"label_agreement":null},{"id":"W3095372394","doi":"10.1093/bioinformatics/btaa945","title":"ALeS: adaptive-length spaced-seed design","year":2020,"lang":"en","type":"article","venue":"Bioinformatics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Heuristic; Software; Source code; Computation; Similarity (geometry); Algorithm; Code (set theory); Sensitivity (control systems); Sequence (biology); Data mining; Theoretical computer science; Programming language; Artificial intelligence; Biology","score_opus":0.08403751598559044,"score_gpt":0.27139443497950566,"score_spread":0.1873569189939152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095372394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023521563,0.0006738083,0.96039164,0.00027561412,0.00012905817,0.00029681355,0.0004698941,0.007922452,0.006319134],"genre_scores_gemma":[0.20692307,0.00030247972,0.7834681,0.00040658537,0.000049661387,0.0007813765,0.00091173867,0.0016717155,0.005485326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989779,0.00028360635,0.00006719501,0.0002530094,0.00031607875,0.00010234102],"domain_scores_gemma":[0.9977496,0.0011262072,0.00028249368,0.00030942974,0.00036995168,0.00016232586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016053581,0.0011958982,0.00087229186,0.00085780467,0.0006930369,0.000969878,0.002123242,0.0012669698,0.013255127],"category_scores_gemma":[0.005622638,0.0005731103,0.00090561394,0.00075209216,0.0010995996,0.0011262681,0.0014798329,0.0014198918,0.0046362597],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016657836,0.0005207332,0.0061207633,0.0014124466,0.00018134505,0.0007167296,0.0003632985,0.4344411,0.0865021,0.041333973,0.020410867,0.4063309],"study_design_scores_gemma":[0.00037701832,0.00074026186,0.00066566886,0.00009988343,0.00010182538,0.00045960335,0.00006761661,0.8862899,0.038229167,0.042227134,0.030666271,0.00007573829],"about_ca_topic_score_codex":0.0006572752,"about_ca_topic_score_gemma":0.0010730517,"teacher_disagreement_score":0.013255127,"about_ca_system_score_codex":0.0006284075,"about_ca_system_score_gemma":0.0013530523,"threshold_uncertainty_score":0.044342816},"labels":[],"label_agreement":null},{"id":"W3095424117","doi":"10.3390/app10217683","title":"DM: Dehghani Method for Modifying Optimization Algorithms","year":2020,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Meta-optimization; Mathematical optimization; Computer science; Derivative-free optimization; Multi-swarm optimization; Particle swarm optimization; Optimization algorithm; Population; Metaheuristic; Test functions for optimization; Optimization problem; Imperialist competitive algorithm; Engineering optimization; Continuous optimization; Algorithm; Mathematics","score_opus":0.10231333471973202,"score_gpt":0.3566389437694204,"score_spread":0.2543256090496884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095424117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015277187,0.0017208214,0.9900388,0.00035986092,0.00028224778,0.000085202235,0.00006146399,0.00041807088,0.005505786],"genre_scores_gemma":[0.060620863,0.0025039935,0.9252694,0.00047866363,0.00032226648,0.0007460764,0.0002392475,0.00046181056,0.009357651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859995,0.00047992662,0.000089959,0.00024705022,0.0004990971,0.00008396391],"domain_scores_gemma":[0.99910694,0.0005075189,0.0000736511,0.000091007016,0.0001869283,0.000034036395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016753745,0.0015822313,0.0011815019,0.0017432342,0.0008344277,0.0011967887,0.0020047962,0.0017458417,0.005989265],"category_scores_gemma":[0.0035819428,0.0005514428,0.0014700204,0.0014789897,0.0013502191,0.001417516,0.0019001412,0.0026895618,0.0018381883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020815266,0.00012278373,0.001982699,0.0011159736,0.00024970295,0.0003479939,0.00037981966,0.2527686,0.0093566505,0.2327255,0.018785156,0.481957],"study_design_scores_gemma":[0.00010632688,0.00013889505,0.0005188592,0.00016854824,0.00008436454,0.00046293423,0.00006003786,0.8121404,0.0061355243,0.062696435,0.11740587,0.00008184834],"about_ca_topic_score_codex":0.0030174458,"about_ca_topic_score_gemma":0.002469822,"teacher_disagreement_score":0.005989265,"about_ca_system_score_codex":0.0008057019,"about_ca_system_score_gemma":0.0014262294,"threshold_uncertainty_score":0.020036042},"labels":[],"label_agreement":null},{"id":"W3096178443","doi":"10.1002/nme.6573","title":"A<scp><i>Canis lupus</i></scp>inspired upgraded Harris hawks optimizer for nonlinear, constrained, continuous, and discrete engineering design problem","year":2020,"lang":"en","type":"article","venue":"International Journal for Numerical Methods in Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Convergence (economics); Mathematical optimization; Nonlinear system; Algorithm; Mathematics; Computer science","score_opus":0.04108880310469128,"score_gpt":0.35029132472247365,"score_spread":0.3092025216177824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096178443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07301234,0.0010627474,0.8878391,0.00078977586,0.00026693844,0.0001717982,0.00014524879,0.00071845506,0.0359936],"genre_scores_gemma":[0.7509614,0.0005556478,0.23423657,0.00043922404,0.00012217235,0.00023870666,0.0002647024,0.00015927565,0.013022245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983406,0.000034555607,0.00000900703,0.000032068347,0.0000699077,0.00002027649],"domain_scores_gemma":[0.9998362,0.000057134013,0.000022900413,0.000018310444,0.0000455526,0.00001995968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044339744,0.0005394529,0.0005371197,0.00055164093,0.0003176302,0.0006710715,0.00070546905,0.00066298957,0.002492423],"category_scores_gemma":[0.0005731368,0.00019285867,0.0006316208,0.0004511192,0.0005291218,0.00043393255,0.000653491,0.0005486628,0.00031134934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000821874,0.000058046182,0.0015594107,0.00017803647,0.00010155566,0.0001984319,0.00004400689,0.8461763,0.014750286,0.01987272,0.0059698904,0.111008994],"study_design_scores_gemma":[0.00001491241,0.000056756286,0.0003036707,0.0000071410777,0.0000108114655,0.000042151994,0.0000069583734,0.99284345,0.0019135338,0.0025330363,0.00225965,0.000007973547],"about_ca_topic_score_codex":0.0036197826,"about_ca_topic_score_gemma":0.0031498368,"teacher_disagreement_score":0.0036197826,"about_ca_system_score_codex":0.00045375156,"about_ca_system_score_gemma":0.00063431915,"threshold_uncertainty_score":0.008337975},"labels":[],"label_agreement":null},{"id":"W3096938982","doi":"10.5430/air.v9n1p54","title":"Investigation of differential evolution and particle swarm optimization in search performance","year":2020,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Differential evolution; Benchmark (surveying); Computer science; Task (project management); Key (lock); Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Engineering","score_opus":0.2163849946774048,"score_gpt":0.3695313440947222,"score_spread":0.15314634941731742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096938982","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5664595,0.010856246,0.37907213,0.0013660801,0.000274218,0.00012371832,0.00014419827,0.00050040876,0.04120347],"genre_scores_gemma":[0.97363204,0.0011112413,0.023807297,0.0000463269,0.000025243673,0.000031835734,0.00006825796,0.000028488636,0.0012493166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986809,0.0004351691,0.00008801433,0.00016685053,0.0005331778,0.00009582406],"domain_scores_gemma":[0.99675375,0.002280579,0.00025897744,0.0001722676,0.00047766755,0.000056661193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025407595,0.0006021842,0.00060009555,0.0012620998,0.00028641822,0.0011662646,0.00049321906,0.00082419894,0.00083074975],"category_scores_gemma":[0.009367145,0.00019410078,0.00037164064,0.0013584321,0.00058641087,0.0013285138,0.00056837,0.00050955924,0.00014977611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031597336,0.00018393162,0.019115629,0.0005708978,0.00020000653,0.00023557835,0.00030934575,0.7071215,0.011227357,0.025737124,0.0014031648,0.23357941],"study_design_scores_gemma":[0.000016527702,0.0002269805,0.0060499078,0.000029207797,0.000043211094,0.00015543071,0.00007205535,0.9834985,0.005267135,0.002920929,0.0016987786,0.00002137885],"about_ca_topic_score_codex":0.0023013582,"about_ca_topic_score_gemma":0.0009471695,"teacher_disagreement_score":0.0025407595,"about_ca_system_score_codex":0.0006912582,"about_ca_system_score_gemma":0.00046893558,"threshold_uncertainty_score":0.0134369135},"labels":[],"label_agreement":null},{"id":"W3097616020","doi":"10.18280/jesa.530415","title":"Design of Two-Dimensional Recursive Digital Filter Using Multi Particle Swarm Optimization Algorithm","year":2020,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Initialization; Mathematical optimization; Infinite impulse response; Algorithm; Convergence (economics); Local optimum; Computer science; Multi-swarm optimization; Filter (signal processing); Mathematics; Digital filter","score_opus":0.07068733666797483,"score_gpt":0.30333183551319576,"score_spread":0.23264449884522093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097616020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045301975,0.00012158983,0.9937816,0.000035658446,0.000023081013,0.000021480104,0.00000911045,0.00021614465,0.0012611202],"genre_scores_gemma":[0.31587005,0.00045896161,0.67704475,0.00009868759,0.000046502028,0.00028037775,0.000110409186,0.000073861236,0.0060164127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969757,0.00005144539,0.000022190838,0.00007826446,0.00011979722,0.000030758136],"domain_scores_gemma":[0.99982256,0.000054876782,0.000027181268,0.000017268669,0.00006854308,0.000009617485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039797783,0.00053465617,0.0008379507,0.00036285876,0.00033150107,0.00086294644,0.0007375583,0.0011439568,0.002339646],"category_scores_gemma":[0.00068747107,0.00031533017,0.0007136437,0.00040772994,0.00031203518,0.0005382056,0.00035056975,0.00051549927,0.0006670684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016888244,0.0001246366,0.0010141397,0.0003266437,0.00016497361,0.00021636837,0.00018808854,0.60970086,0.069561206,0.015966972,0.0019566051,0.3006106],"study_design_scores_gemma":[0.000024561185,0.000061431456,0.00022541823,0.000007636346,0.0000197591,0.0000652905,0.000008952193,0.99178797,0.004635445,0.0006658447,0.0024864655,0.000011185772],"about_ca_topic_score_codex":0.0026477997,"about_ca_topic_score_gemma":0.0022982846,"teacher_disagreement_score":0.0026477997,"about_ca_system_score_codex":0.00038932782,"about_ca_system_score_gemma":0.00064681546,"threshold_uncertainty_score":0.007826865},"labels":[],"label_agreement":null},{"id":"W3104800136","doi":"","title":"ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Logarithm; Heuristic; Computer science; Algorithm; Mathematical optimization; Work (physics); Mathematics; Engineering","score_opus":0.03633757259381575,"score_gpt":0.28543745454321406,"score_spread":0.2490998819493983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104800136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0461694,0.000919781,0.934565,0.00034656253,0.00015605631,0.00035478067,0.00022913211,0.007953246,0.009306014],"genre_scores_gemma":[0.39443928,0.00028954653,0.59483415,0.0004520012,0.000101814825,0.0010903154,0.00091447134,0.0020719636,0.0058065536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804723,0.00080688414,0.00009666819,0.00030717422,0.0004442214,0.0002977999],"domain_scores_gemma":[0.99498945,0.0027011863,0.00029457035,0.0014241246,0.00035347667,0.00023729309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033325264,0.0020208661,0.0020263174,0.001254616,0.0011190664,0.0020328145,0.004089404,0.0021686081,0.009325251],"category_scores_gemma":[0.013466281,0.0011167071,0.0012385483,0.0012284068,0.0015680165,0.002944719,0.0028190517,0.0023746893,0.0023944948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009176269,0.0003765757,0.0019151815,0.00033340396,0.00019052341,0.00029915653,0.0002641984,0.62090725,0.0061734766,0.033682927,0.013080307,0.32185933],"study_design_scores_gemma":[0.00009385929,0.00016011625,0.00013784086,0.000040430332,0.000034932153,0.00008630387,0.000032003318,0.9702269,0.003183163,0.02257478,0.0034022615,0.000027334469],"about_ca_topic_score_codex":0.0018923663,"about_ca_topic_score_gemma":0.0033582551,"teacher_disagreement_score":0.009325251,"about_ca_system_score_codex":0.0010691518,"about_ca_system_score_gemma":0.00270891,"threshold_uncertainty_score":0.031195998},"labels":[],"label_agreement":null},{"id":"W3106774124","doi":"10.1007/978-3-030-63833-7_3","title":"Discrete Mother Tree Optimization for the Traveling Salesman Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Travelling salesman problem; Swap (finance); Computer science; Swarm intelligence; Mathematical optimization; Metaheuristic; Swarm behaviour; Particle swarm optimization; Combinatorial optimization; Tree (set theory); Algorithm; Mathematics; Combinatorics","score_opus":0.02949725858594019,"score_gpt":0.27493606879401594,"score_spread":0.24543881020807576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106774124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01580258,0.0023453496,0.93802106,0.000942709,0.00034227842,0.000057888632,0.0002283247,0.00019987384,0.042059895],"genre_scores_gemma":[0.37855875,0.0049332296,0.54431087,0.00041836986,0.00048333415,0.00036593984,0.000817516,0.00050176814,0.06961021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975413,0.0000958698,0.000006280879,0.000037358433,0.00007876016,0.000027533983],"domain_scores_gemma":[0.9996582,0.00023061517,0.000024976629,0.000020386322,0.000035201338,0.000030611987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047147562,0.00059689145,0.0009679994,0.00048383226,0.00030275164,0.0010386755,0.0012725543,0.0011837662,0.0104674855],"category_scores_gemma":[0.0018180894,0.00037929107,0.0005775994,0.001094508,0.0004969034,0.0012594945,0.0008229845,0.0018855239,0.0013692309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011252487,0.00012213935,0.0001953595,0.00034633285,0.000040419465,0.00007512453,0.000081141116,0.5734168,0.0022238859,0.25297505,0.021917112,0.14849408],"study_design_scores_gemma":[0.000021050504,0.000044959164,0.00007279041,0.000027172257,0.000008428762,0.00003344285,0.000021031643,0.942912,0.0002989882,0.04848322,0.008071431,0.000005534965],"about_ca_topic_score_codex":0.0015253498,"about_ca_topic_score_gemma":0.0013227888,"teacher_disagreement_score":0.0104674855,"about_ca_system_score_codex":0.0010612195,"about_ca_system_score_gemma":0.0007927064,"threshold_uncertainty_score":0.035017252},"labels":[],"label_agreement":null},{"id":"W3111443264","doi":"10.1109/smc42975.2020.9283201","title":"Discrete Coordinate Descent (DCD)","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Mathematical optimization; Coordinate descent; Dimension (graph theory); Optimization problem; Metaheuristic; Algorithm; Computation; Computer science; Mathematics; Discrete optimization; Scale (ratio)","score_opus":0.0390599429223153,"score_gpt":0.2759273410338389,"score_spread":0.23686739811152363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111443264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049970946,0.0005763659,0.9900064,0.0002461822,0.00015436308,0.000077775345,0.00006596762,0.00052634167,0.0033494367],"genre_scores_gemma":[0.1959216,0.00083237287,0.7942173,0.0006046101,0.0001651916,0.00052136404,0.00047347075,0.00023842619,0.0070256386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932384,0.00020401915,0.0000380179,0.00013354051,0.00024186367,0.000058731857],"domain_scores_gemma":[0.99897254,0.00047548668,0.00009228962,0.0001323663,0.00025948463,0.00006790501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011381714,0.0013888003,0.0019406253,0.00062923005,0.00052855245,0.0011333185,0.0016371335,0.0013883811,0.0025662037],"category_scores_gemma":[0.0034918862,0.00064588094,0.0008473743,0.0009276687,0.000998784,0.00074387295,0.0012339195,0.0014382695,0.001049563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013120237,0.00011499084,0.0017524791,0.00043564657,0.000162287,0.00015947748,0.0001028864,0.7406554,0.004185221,0.04188979,0.016491162,0.19391944],"study_design_scores_gemma":[0.000033263208,0.000053657146,0.00016574682,0.0000140293905,0.000013000333,0.000048522277,0.0000093455,0.9907471,0.00080277905,0.003935785,0.0041676755,0.000009098383],"about_ca_topic_score_codex":0.0064484323,"about_ca_topic_score_gemma":0.0067710592,"teacher_disagreement_score":0.0064484323,"about_ca_system_score_codex":0.0008121317,"about_ca_system_score_gemma":0.0016131734,"threshold_uncertainty_score":0.012821794},"labels":[],"label_agreement":null},{"id":"W3111860947","doi":"10.1109/smc42975.2020.9283154","title":"One-array Differential Evolution Algorithm with a Novel Replacement Strategy for Numerical Optimization","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Differential evolution; Algorithm; Mathematical optimization; Mathematics","score_opus":0.05184049782155163,"score_gpt":0.28797012378769027,"score_spread":0.23612962596613862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111860947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074920957,0.0003386606,0.98801404,0.00011261681,0.00006661624,0.000036563873,0.000016731829,0.00023549025,0.003687146],"genre_scores_gemma":[0.3395479,0.00052305614,0.65237623,0.00022516864,0.000076961696,0.0004090242,0.00014432013,0.00010954905,0.0065877447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996018,0.00012145611,0.000030958152,0.000062969506,0.00015137008,0.000031521784],"domain_scores_gemma":[0.9995956,0.00018722835,0.00004727702,0.000047643458,0.000101534635,0.00002077355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057023554,0.00059826265,0.00095919205,0.00050291786,0.00034346303,0.00072790193,0.0012680902,0.0010351554,0.0018381726],"category_scores_gemma":[0.0015960209,0.00024981826,0.0006250309,0.00066778174,0.0004535922,0.0007563016,0.00086780527,0.00083250494,0.0005638398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008966717,0.00010444357,0.001020909,0.00017674886,0.00007520621,0.000151132,0.00014269589,0.75538605,0.014181764,0.03699339,0.0024754915,0.18920252],"study_design_scores_gemma":[0.000013697216,0.000041027488,0.0000651195,0.000005913812,0.0000074286118,0.00004236942,0.000005487993,0.994919,0.0010360477,0.0018250924,0.0020315174,0.000007348153],"about_ca_topic_score_codex":0.0011396257,"about_ca_topic_score_gemma":0.0010556625,"teacher_disagreement_score":0.0018381726,"about_ca_system_score_codex":0.00036722264,"about_ca_system_score_gemma":0.0005045403,"threshold_uncertainty_score":0.006149292},"labels":[],"label_agreement":null},{"id":"W3118961950","doi":"10.1109/ssci47803.2020.9308591","title":"Evolving Feedforward Neural Networks Using a Quasi-Opposition-Based Differential Evolution for Data Classification","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Differential evolution; Artificial intelligence; Artificial neural network; Feedforward neural network; Feed forward; Reinforcement learning; Machine learning; Evolutionary computation; Engineering","score_opus":0.15415972766611666,"score_gpt":0.34053056587657693,"score_spread":0.18637083821046027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118961950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02656377,0.0002455494,0.9705941,0.00015079029,0.00005109298,0.00005298025,0.000014336563,0.00013354083,0.0021938172],"genre_scores_gemma":[0.5997511,0.0003128888,0.39644715,0.00024089884,0.000046244328,0.0003603637,0.00007841946,0.00004365708,0.0027192873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957675,0.00013791092,0.000025690108,0.00006650289,0.00015861024,0.000034541117],"domain_scores_gemma":[0.99919695,0.0005024516,0.00009488821,0.00004414854,0.00013667745,0.000024947778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010959995,0.0005682373,0.0007630869,0.0006299924,0.00038001096,0.00068582955,0.0009721358,0.0010200614,0.0007553369],"category_scores_gemma":[0.002308457,0.00030109222,0.0007763252,0.00065573223,0.0006967809,0.00064525,0.00075075676,0.00074464217,0.0001179751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035524463,0.000052427302,0.0007423332,0.000063121304,0.000055992175,0.00008986039,0.00009332364,0.9365291,0.005304917,0.008232617,0.00033679963,0.048464093],"study_design_scores_gemma":[0.000003929594,0.00001715972,0.000047842223,0.0000028645331,0.0000036984045,0.000011068945,0.000002389031,0.99852234,0.00030833506,0.0008596757,0.00021831099,0.0000024913118],"about_ca_topic_score_codex":0.0022075884,"about_ca_topic_score_gemma":0.0018035262,"teacher_disagreement_score":0.0022075884,"about_ca_system_score_codex":0.0007450059,"about_ca_system_score_gemma":0.0005791583,"threshold_uncertainty_score":0.0057962537},"labels":[],"label_agreement":null},{"id":"W3119201936","doi":"10.1007/s00521-020-05637-5","title":"Application of ameliorated Harris Hawks optimizer for designing of low-power signed floating-point MAC architecture","year":2021,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Particle swarm optimization; Algorithm; Computer science; Floating point; Mathematical optimization; Mathematics","score_opus":0.013986101614174552,"score_gpt":0.2867019832602045,"score_spread":0.27271588164602995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119201936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06999044,0.00064726855,0.90936524,0.00020966631,0.00012712176,0.00007154501,0.000053615044,0.0014477645,0.018087324],"genre_scores_gemma":[0.7331604,0.00020516856,0.25724864,0.000103697195,0.000030833085,0.000066211,0.00007779237,0.00012157922,0.008985635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99990916,0.000013664326,0.0000052413416,0.000015766032,0.000042138206,0.000013939307],"domain_scores_gemma":[0.99990654,0.000013543544,0.000012421097,0.000011405766,0.000049856262,0.0000063323737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015040225,0.00039527062,0.00026047634,0.00024542518,0.00027793157,0.00047692368,0.00069038355,0.0002533174,0.0037649919],"category_scores_gemma":[0.0003785668,0.0001222057,0.00020549088,0.00020592728,0.00013996934,0.00030185215,0.0002091338,0.000332905,0.00050687796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002562892,0.000080705366,0.0018414884,0.00029717252,0.00010680911,0.00028456716,0.00018255685,0.45984104,0.1492863,0.032827377,0.006386059,0.34860957],"study_design_scores_gemma":[0.00001770798,0.00014511344,0.00033773624,0.00001141165,0.000022870112,0.00009175646,0.000018212337,0.95965934,0.030453555,0.0018501858,0.0073809936,0.000011174419],"about_ca_topic_score_codex":0.0016640725,"about_ca_topic_score_gemma":0.0029607462,"teacher_disagreement_score":0.0037649919,"about_ca_system_score_codex":0.0003946411,"about_ca_system_score_gemma":0.0005920491,"threshold_uncertainty_score":0.012595117},"labels":[],"label_agreement":null},{"id":"W3119250667","doi":"10.1109/iscmi51676.2020.9311551","title":"NichePSO and the Merging Subswarm Problem","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Local optimum; Computer science; Particle swarm optimization; Mathematical optimization; Multi-swarm optimization; Algorithm design; Metaheuristic; Optimization problem; Local search (optimization); Algorithm; Mathematics","score_opus":0.02376218483954947,"score_gpt":0.25307507488677844,"score_spread":0.22931289004722896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119250667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055174757,0.0013778306,0.9239805,0.00077322946,0.00013070261,0.0001678991,0.00007518873,0.00050796487,0.017811915],"genre_scores_gemma":[0.64681023,0.0012001445,0.33830887,0.00047580778,0.00018133406,0.00036281464,0.00025415115,0.00030731625,0.012099398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998976,0.00029594556,0.00004225551,0.00014730728,0.000365491,0.00017302303],"domain_scores_gemma":[0.9984176,0.00094162376,0.00019319328,0.00015434323,0.00016814834,0.00012509376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018631677,0.00080355135,0.0011099207,0.0009261038,0.0012776661,0.0012589032,0.0018617078,0.0015872258,0.003764752],"category_scores_gemma":[0.0050425595,0.00054005097,0.0009974949,0.0014595747,0.0017680968,0.0026152781,0.0026605343,0.001674515,0.00047648363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003111642,0.00011094626,0.0014378648,0.00023245467,0.00012220848,0.00049691997,0.0005577114,0.58794135,0.004339203,0.22526704,0.0051954407,0.17398761],"study_design_scores_gemma":[0.000045042605,0.00015946834,0.00048838975,0.000025240555,0.000035339785,0.0003177743,0.000123112,0.8706121,0.0023698614,0.11282542,0.012969704,0.000028534601],"about_ca_topic_score_codex":0.0022541645,"about_ca_topic_score_gemma":0.0015038169,"teacher_disagreement_score":0.003764752,"about_ca_system_score_codex":0.0009074398,"about_ca_system_score_gemma":0.0011698507,"threshold_uncertainty_score":0.012594342},"labels":[],"label_agreement":null},{"id":"W3119959628","doi":"10.1007/s00521-020-05475-5","title":"A novel statistical approach to numerical and multidisciplinary design optimization problems using pattern search inspired Harris hawks optimizer","year":2021,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Metaheuristic; Mathematical optimization; Computer science; Engineering optimization; Multidisciplinary design optimization; Benchmark (surveying); Engineering design process; Optimization problem; Continuous optimization; Heuristics; Algorithm; Mathematics; Multi-swarm optimization; Multidisciplinary approach; Engineering; Geography","score_opus":0.08416650638952775,"score_gpt":0.3329561978124539,"score_spread":0.24878969142292615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119959628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004422894,0.00015354392,0.9934128,0.000093042196,0.00005336028,0.00002107366,0.000011997256,0.00007714462,0.001754205],"genre_scores_gemma":[0.37986994,0.0006174523,0.6102412,0.0003306887,0.0002741018,0.00035528486,0.000108874825,0.0002525138,0.007949835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995091,0.0001246247,0.000028079156,0.000055073717,0.0002501981,0.000032915323],"domain_scores_gemma":[0.99936384,0.0003052135,0.00008188633,0.00006464794,0.00014522015,0.00003927031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010805669,0.0005584914,0.0011204899,0.0009581489,0.00038988361,0.0008759884,0.001427642,0.0010104442,0.0017530776],"category_scores_gemma":[0.0020638637,0.00055838254,0.0009704072,0.001195286,0.0009616737,0.0011848436,0.001296389,0.0010166396,0.00033812269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027799764,0.000067531044,0.0006507718,0.000093927876,0.00008141815,0.00008191442,0.000033128374,0.8453451,0.004275869,0.09719464,0.0011530817,0.05099484],"study_design_scores_gemma":[0.0000029735904,0.000010771815,0.000059540824,0.0000014536292,0.0000026081095,0.000009294088,0.0000020821165,0.99281913,0.00012378665,0.0066649974,0.0003004015,0.0000029578791],"about_ca_topic_score_codex":0.0013062373,"about_ca_topic_score_gemma":0.0017794914,"teacher_disagreement_score":0.0017530776,"about_ca_system_score_codex":0.000568054,"about_ca_system_score_gemma":0.0009816642,"threshold_uncertainty_score":0.00586468},"labels":[],"label_agreement":null},{"id":"W3120100312","doi":"10.1109/ssci47803.2020.9308550","title":"Enhancing SHADE and L-SHADE Algorithms Using Ordered Mutation","year":2020,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Differential evolution; Algorithm; Computer science; Population; Mathematical optimization; Reduction (mathematics); Algorithm design; Mathematics","score_opus":0.059521488459502,"score_gpt":0.30737175239499187,"score_spread":0.24785026393548987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120100312","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10262294,0.0005922118,0.8852281,0.00027778704,0.00015434159,0.00016975924,0.00006721004,0.0012143368,0.009673407],"genre_scores_gemma":[0.5889446,0.00036308862,0.4051394,0.00036394145,0.000074350086,0.00023743337,0.0001722993,0.00018848236,0.0045163697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994831,0.000106504755,0.000033112945,0.00007182163,0.00023921853,0.00006615926],"domain_scores_gemma":[0.9992908,0.00029548738,0.00008852093,0.000089599074,0.00017500954,0.00006053546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075512676,0.0008053558,0.0009568685,0.0009060653,0.0005321327,0.0007988434,0.0011472682,0.00079946476,0.0015648826],"category_scores_gemma":[0.0025435658,0.00026052527,0.0007944612,0.000690655,0.0005260404,0.0009345983,0.0011628125,0.00082878565,0.00024454645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020527816,0.0002500403,0.003816572,0.00020504105,0.00009770441,0.00015910483,0.00025438206,0.58927447,0.01702551,0.023142224,0.0031592462,0.3624105],"study_design_scores_gemma":[0.0000717021,0.00013907003,0.00048473547,0.000010437635,0.000024993804,0.00008128059,0.000034273824,0.98955625,0.0030184938,0.0038483317,0.0027155566,0.000014823712],"about_ca_topic_score_codex":0.0034611616,"about_ca_topic_score_gemma":0.004084798,"teacher_disagreement_score":0.0034611616,"about_ca_system_score_codex":0.00059263455,"about_ca_system_score_gemma":0.0012895487,"threshold_uncertainty_score":0.006882012},"labels":[],"label_agreement":null},{"id":"W3124562095","doi":"10.20944/preprints201611.0070.v1","title":"Grouped Bees Algorithm: A Grouped Version of the Bees Algorithm","year":2016,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Bees algorithm; Algorithm; Benchmark (surveying); Honey Bees; Computer science; Set (abstract data type); Implementation; Mathematics; Ecology; Biology","score_opus":0.07965608506299912,"score_gpt":0.33767349345051634,"score_spread":0.2580174083875172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124562095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010050528,0.0008944023,0.9782008,0.00029966756,0.00020926572,0.00027230242,0.00017438643,0.0010782318,0.0088205505],"genre_scores_gemma":[0.13004565,0.00089197466,0.8550126,0.00036764896,0.00015537372,0.0005838855,0.00065798033,0.00032706937,0.011957764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995223,0.00012834999,0.000029787745,0.000087061395,0.00018968267,0.000042774293],"domain_scores_gemma":[0.9996007,0.00009180735,0.00004788896,0.00010272233,0.00013047957,0.000026430052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053660054,0.00094421685,0.001210457,0.00095822604,0.00063623243,0.0010453137,0.0019711591,0.0015022433,0.0057312814],"category_scores_gemma":[0.0015389586,0.00036425953,0.001099563,0.0013131334,0.00041925366,0.0012595557,0.0010000765,0.0011650904,0.002053938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027623604,0.00018556365,0.0015118747,0.00044294918,0.0003425359,0.0002140493,0.00022805833,0.34644946,0.021708949,0.04515596,0.024612803,0.5588715],"study_design_scores_gemma":[0.00017258928,0.00021862485,0.0007486844,0.00006514572,0.00009439092,0.0002574299,0.00005912671,0.898898,0.0067501524,0.031953547,0.060724154,0.000058198602],"about_ca_topic_score_codex":0.0027209916,"about_ca_topic_score_gemma":0.0028187796,"teacher_disagreement_score":0.0057312814,"about_ca_system_score_codex":0.00037093202,"about_ca_system_score_gemma":0.0009645108,"threshold_uncertainty_score":0.019173086},"labels":[],"label_agreement":null},{"id":"W3127404465","doi":"10.3390/app11031286","title":"Binary Spring Search Algorithm for Solving Various Optimization Problems","year":2021,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Binary number; Meta-optimization; Algorithm; Computer science; Population; Multi-swarm optimization; Optimization problem; Genetic algorithm; Mathematical optimization; Metaheuristic; Mathematics","score_opus":0.04237186069110017,"score_gpt":0.2957470829865803,"score_spread":0.25337522229548015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127404465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047260746,0.0018319355,0.9793361,0.00035650155,0.0001659741,0.00010594095,0.00008550738,0.00039239036,0.012999564],"genre_scores_gemma":[0.16821168,0.0035061832,0.80720013,0.00037287493,0.00019152714,0.0008628204,0.0005469412,0.00022722925,0.018880585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.00012871822,0.000038647813,0.000079019024,0.00021963216,0.000041328236],"domain_scores_gemma":[0.99972564,0.00013418333,0.00003226613,0.000019969124,0.000073953415,0.000013945137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007947361,0.0012601069,0.0012656836,0.0008509982,0.0007028,0.0010503883,0.0011351693,0.0013617235,0.005487411],"category_scores_gemma":[0.0013482999,0.00040465654,0.0010094503,0.0014779831,0.000557309,0.00086170336,0.0009265808,0.0015060948,0.0013655312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010372689,0.0001363069,0.0010386066,0.0006893112,0.00015190509,0.0001443368,0.00014714766,0.671935,0.005047568,0.074442536,0.009399828,0.23676372],"study_design_scores_gemma":[0.000046116074,0.000061076986,0.00021569457,0.00004969759,0.000025845422,0.00007675015,0.000028142378,0.96707034,0.001414548,0.01564994,0.015344198,0.000017675207],"about_ca_topic_score_codex":0.00418142,"about_ca_topic_score_gemma":0.0036564209,"teacher_disagreement_score":0.005487411,"about_ca_system_score_codex":0.0005945995,"about_ca_system_score_gemma":0.0015580507,"threshold_uncertainty_score":0.018357217},"labels":[],"label_agreement":null},{"id":"W3134001436","doi":"","title":"On the difficulty of generalizing deep reinforcement learning framework for combinatorial optimization","year":2021,"lang":"en","type":"preprint","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Reinforcement learning; Computer science; Heuristics; Quadratic assignment problem; Combinatorial optimization; Graph; Artificial intelligence; Travelling salesman problem; Mathematical optimization; Optimization problem; Theoretical computer science; Machine learning; Mathematics; Algorithm","score_opus":0.03848310886771322,"score_gpt":0.28865100042795283,"score_spread":0.2501678915602396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134001436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012707803,0.00067811477,0.97860956,0.0020587083,0.00009571659,0.000060714236,0.00010310626,0.00032855844,0.0053575984],"genre_scores_gemma":[0.6787067,0.0021875128,0.30445424,0.0017796584,0.0004255549,0.0005410313,0.000510109,0.00059635995,0.010798828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878114,0.00052103103,0.000053762134,0.00029999987,0.0002192829,0.00012463564],"domain_scores_gemma":[0.9930441,0.0054835523,0.0003163462,0.0005111988,0.0004112074,0.0002335596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031147196,0.0016532321,0.0017750097,0.0006691339,0.00062239124,0.0017751076,0.0021673855,0.0020420563,0.0054484713],"category_scores_gemma":[0.013456458,0.00083806604,0.0013901447,0.0007881855,0.0023243895,0.0038114039,0.0023906685,0.00592034,0.00069254165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003361053,0.000054942535,0.00041312122,0.00010237586,0.000035757857,0.00006068433,0.00005444779,0.8893986,0.00031507562,0.08692143,0.002344642,0.020265393],"study_design_scores_gemma":[0.000007681976,0.000011320131,0.000041036572,0.000009310647,0.000002969381,0.0000065709437,0.0000060811526,0.9486416,0.000058738962,0.050748777,0.0004630413,0.0000028813402],"about_ca_topic_score_codex":0.007894972,"about_ca_topic_score_gemma":0.008926039,"teacher_disagreement_score":0.007894972,"about_ca_system_score_codex":0.0021916784,"about_ca_system_score_gemma":0.0025765735,"threshold_uncertainty_score":0.018226922},"labels":[],"label_agreement":null},{"id":"W3134041587","doi":"10.1007/s10589-020-00249-0","title":"Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Mathematical optimization; Probabilistic logic; Martingale (probability theory); Convergence (economics); Extension (predicate logic); Stochastic optimization; Convergence of random variables; Algorithm; Random variable; Computer science; Applied mathematics","score_opus":0.04944740018437694,"score_gpt":0.32636244376584844,"score_spread":0.2769150435814715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134041587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068476084,0.00021492672,0.98987305,0.00016515645,0.00005655708,0.000040108298,0.000032293672,0.00013207867,0.00263818],"genre_scores_gemma":[0.54877543,0.00044898814,0.44124222,0.00024344177,0.00014199696,0.00061786553,0.00021134134,0.00033947558,0.007979165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.0003946965,0.000025845618,0.00007966555,0.00018263578,0.000050796232],"domain_scores_gemma":[0.9945628,0.0044461233,0.00029917012,0.00019085543,0.0003744164,0.00012667189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027496414,0.00097356737,0.002150409,0.0012002261,0.00063633674,0.0014223855,0.0017174428,0.0023026743,0.003990265],"category_scores_gemma":[0.010768261,0.0012326444,0.00097205944,0.0009938926,0.0014435077,0.0015701596,0.002168152,0.0017310163,0.0005215115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041499217,0.000021356815,0.0001161734,0.000040297673,0.000029170264,0.000016270727,0.000012516492,0.9796723,0.00024728934,0.013806958,0.00033329296,0.0056628445],"study_design_scores_gemma":[0.0000038579456,0.0000030920303,0.000008462597,0.0000025786267,0.0000013479344,0.0000010881918,8.071144e-7,0.9979366,0.000031996562,0.0019517407,0.00005753211,0.0000010245385],"about_ca_topic_score_codex":0.0042482726,"about_ca_topic_score_gemma":0.004015544,"teacher_disagreement_score":0.0042482726,"about_ca_system_score_codex":0.0012307685,"about_ca_system_score_gemma":0.0016018159,"threshold_uncertainty_score":0.014541626},"labels":[],"label_agreement":null},{"id":"W3136625733","doi":"10.1007/978-3-662-63170-6_7","title":"Novel Hybrid GWO-WOA and BAT-PSO Algorithms for Solving Design Optimization Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mathematical optimization; Optimization algorithm; Algorithm; Mathematics","score_opus":0.05171167206694603,"score_gpt":0.2819092111108858,"score_spread":0.23019753904393975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136625733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104933735,0.00081110507,0.97876465,0.000086222164,0.0001642256,0.00005492078,0.000056443027,0.0005040451,0.009065072],"genre_scores_gemma":[0.21495749,0.0007052363,0.769893,0.00018809787,0.00011722649,0.00034961037,0.00028600296,0.00022147373,0.013281835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973994,0.000058766847,0.000014797441,0.000035627512,0.0001250633,0.000025863688],"domain_scores_gemma":[0.9997913,0.00008111889,0.000022158954,0.000024626848,0.00006481706,0.000015953678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046756535,0.0008950215,0.001122791,0.00058418815,0.0003433674,0.0009222224,0.0011523234,0.0010104722,0.0042566764],"category_scores_gemma":[0.0007459821,0.0004407388,0.00081502023,0.0013025773,0.0002962925,0.00076837715,0.0008154973,0.0008137973,0.0010308101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012690412,0.00016033955,0.00058596826,0.00026691283,0.00014454285,0.00008931648,0.00004330025,0.68756706,0.008176967,0.01642339,0.0044734525,0.2819419],"study_design_scores_gemma":[0.000009908655,0.000026169739,0.000085617634,0.000005819678,0.000008587894,0.000019318875,0.000003985379,0.99684685,0.00037024685,0.0013884,0.0012311508,0.0000039752404],"about_ca_topic_score_codex":0.0014799436,"about_ca_topic_score_gemma":0.0031269672,"teacher_disagreement_score":0.0042566764,"about_ca_system_score_codex":0.00023100089,"about_ca_system_score_gemma":0.00057616126,"threshold_uncertainty_score":0.014239967},"labels":[],"label_agreement":null},{"id":"W3139149903","doi":"10.1007/978-3-662-63170-6_5","title":"A New Bio-heuristic Hybrid Optimization for Constrained Continuous Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematical optimization; Evolutionary algorithm; Benchmark (surveying); Convergence (economics); Computer science; Evolutionary computation; Metaheuristic; Premature convergence; Process (computing); Global optimization; Mathematics; Genetic algorithm","score_opus":0.02199607920956767,"score_gpt":0.2639593538183612,"score_spread":0.24196327460879355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139149903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007525397,0.0010628487,0.97132945,0.00016788747,0.00036550203,0.00007317267,0.00005651477,0.0004870454,0.018932248],"genre_scores_gemma":[0.1961841,0.0012230973,0.7759837,0.00036434585,0.00029892288,0.00059021387,0.00022552785,0.00027191165,0.024858205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997154,0.000069106136,0.000014112764,0.000044920904,0.00013068122,0.000025807765],"domain_scores_gemma":[0.9998074,0.00009209619,0.000015651925,0.000022007718,0.00004541712,0.000017469945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005013052,0.00095191604,0.0008792016,0.00087780866,0.00046680446,0.0012120618,0.0015008721,0.0014553769,0.0068763527],"category_scores_gemma":[0.0007050248,0.0004950591,0.00086873554,0.0010814705,0.0006084163,0.0008389298,0.0013340286,0.001107262,0.0010918379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012868101,0.00014308168,0.0003036701,0.0003422819,0.00015966511,0.00017462937,0.000079070356,0.70261884,0.014194981,0.04976777,0.005283862,0.2268034],"study_design_scores_gemma":[0.000024209075,0.000093663104,0.00010135629,0.000022825954,0.000023562143,0.000067870664,0.000011045229,0.9855517,0.0010834229,0.0057598306,0.0072471523,0.000013373144],"about_ca_topic_score_codex":0.0012313806,"about_ca_topic_score_gemma":0.0016501657,"teacher_disagreement_score":0.0068763527,"about_ca_system_score_codex":0.0003843604,"about_ca_system_score_gemma":0.00049203227,"threshold_uncertainty_score":0.023003697},"labels":[],"label_agreement":null},{"id":"W3140713005","doi":"10.1007/978-3-030-68514-0_1","title":"Metaheuristic Optimization Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Metaheuristic; Parallel metaheuristic; Computer science; Mathematical optimization; Population; Algorithm; Optimization algorithm; State (computer science); Mathematics; Meta-optimization; Sociology","score_opus":0.027981821199219586,"score_gpt":0.2673447543037582,"score_spread":0.23936293310453863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140713005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018725429,0.030694481,0.723827,0.0014243525,0.0028833156,0.000109133056,0.00040207064,0.001759073,0.237028],"genre_scores_gemma":[0.056987595,0.03116935,0.52402645,0.0017130108,0.0020368919,0.0005981545,0.0016418296,0.0019458572,0.37988085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994867,0.00014193285,0.000021591306,0.00007363176,0.0002455736,0.00003057141],"domain_scores_gemma":[0.9996954,0.00013232876,0.000019369407,0.00008027883,0.000059765105,0.000012863171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157986,0.0017961499,0.0015418504,0.0011574384,0.0004950133,0.0020434172,0.0014747798,0.0020419455,0.033278067],"category_scores_gemma":[0.0015643262,0.0006662187,0.0009610302,0.002348671,0.00069558766,0.0016016489,0.0013550533,0.0026699593,0.019438993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042114763,0.000114296745,0.00016403853,0.00047204748,0.00012267724,0.00007864877,0.00006450915,0.091366775,0.0022044051,0.1566002,0.12555242,0.6232178],"study_design_scores_gemma":[0.000033354725,0.000077289216,0.00029542862,0.00038611604,0.000062936444,0.0002986483,0.00004375971,0.2632223,0.002813012,0.21442907,0.51829696,0.000041198593],"about_ca_topic_score_codex":0.0006756806,"about_ca_topic_score_gemma":0.0010684569,"teacher_disagreement_score":0.033278067,"about_ca_system_score_codex":0.00061576493,"about_ca_system_score_gemma":0.0005690823,"threshold_uncertainty_score":0.11132628},"labels":[],"label_agreement":null},{"id":"W3142950774","doi":"10.5430/air.v10n1p1","title":"Comparison of Centralized and Distributed Intelligent Particle Multi-Swarm Optimization on Search Performance","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Computer science; Metaheuristic; Task (project management); Swarm behaviour; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; Engineering","score_opus":0.33676114848408845,"score_gpt":0.47563296381230696,"score_spread":0.13887181532821852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142950774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49463418,0.007245186,0.4599037,0.0010149039,0.0003049511,0.00011308129,0.0001645714,0.001536427,0.035082966],"genre_scores_gemma":[0.97283566,0.0007619008,0.024705019,0.000053309832,0.000035483703,0.000046175428,0.00011298958,0.00005905927,0.0013904056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990957,0.00030174473,0.000046780686,0.0001462829,0.00030410176,0.00010538873],"domain_scores_gemma":[0.9982804,0.0009939034,0.00008962311,0.00019226837,0.0003787648,0.00006504314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014725197,0.0006157796,0.0010910404,0.00067169796,0.00040678843,0.0008456301,0.0006804029,0.00088638783,0.001293594],"category_scores_gemma":[0.00385152,0.00017693569,0.0004429927,0.00074879,0.00047426482,0.0011314567,0.00051831285,0.00041082368,0.00024447628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005323404,0.00015484588,0.002669107,0.00019325434,0.00008784133,0.000052067,0.000062057996,0.85451597,0.0035064828,0.0041564517,0.0016490108,0.13242058],"study_design_scores_gemma":[0.00003984237,0.00012635716,0.0012565166,0.000009679537,0.000024783747,0.000021883367,0.00003086723,0.9948088,0.0022478858,0.00095327594,0.00047007413,0.0000100150955],"about_ca_topic_score_codex":0.0040313825,"about_ca_topic_score_gemma":0.0023577935,"teacher_disagreement_score":0.0040313825,"about_ca_system_score_codex":0.0007332377,"about_ca_system_score_gemma":0.00091671234,"threshold_uncertainty_score":0.008015871},"labels":[],"label_agreement":null},{"id":"W3153604172","doi":"10.1017/s0263574721000199","title":"Simultaneous task placement and sequence optimization in an inspection robotic cell","year":2021,"lang":"en","type":"article","venue":"Robotica","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Workcell; Task (project management); Artificial intelligence; Process (computing); Computer science; Particle swarm optimization; Computer vision; Sequence (biology); Robot; Travelling salesman problem; Optimization problem; Simulation; Engineering; Algorithm","score_opus":0.02615639491630307,"score_gpt":0.28872806143471186,"score_spread":0.2625716665184088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153604172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17574996,0.00017087744,0.82003,0.00013127855,0.000035896195,0.000097324315,0.0000377469,0.0003491592,0.0033978403],"genre_scores_gemma":[0.77637696,0.0000946736,0.21955334,0.000049884206,0.000013090167,0.00014289154,0.0000791097,0.000051584993,0.0036384354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996879,0.00007077965,0.000011118069,0.00007699275,0.00008002018,0.00007324621],"domain_scores_gemma":[0.99957365,0.00018425674,0.00006153509,0.000055300643,0.00007176884,0.000053607608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052955974,0.0006278872,0.0008272869,0.00035571455,0.0003819757,0.0006108228,0.0009216127,0.0008080928,0.002142558],"category_scores_gemma":[0.0008855045,0.00040857794,0.00046009818,0.00035099362,0.0005634124,0.00054846826,0.00070349395,0.000603855,0.0003561411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119826174,0.00010707,0.0004930742,0.000047190908,0.00001570333,0.0001327914,0.000050572522,0.9573515,0.012152979,0.0021264707,0.00040592937,0.026996853],"study_design_scores_gemma":[0.000015605934,0.00015538461,0.00016338067,0.0000026553514,0.000004843178,0.00002442803,0.000014751438,0.9962101,0.002130093,0.0008151131,0.00045931665,0.000004395203],"about_ca_topic_score_codex":0.0038367093,"about_ca_topic_score_gemma":0.002855433,"teacher_disagreement_score":0.0038367093,"about_ca_system_score_codex":0.0006539097,"about_ca_system_score_gemma":0.0010939962,"threshold_uncertainty_score":0.0076287985},"labels":[],"label_agreement":null},{"id":"W3156628753","doi":"10.1049/ell2.12176","title":"A greedy non‐hierarchical grey wolf optimizer for real‐world optimization","year":2021,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Benchmark (surveying); Hierarchy; Computer science; Greedy algorithm; Perspective (graphical); Mathematical optimization; Optimization algorithm; Algorithm; Artificial intelligence; Mathematics; Geography","score_opus":0.01522472528538423,"score_gpt":0.27776692319398144,"score_spread":0.26254219790859723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156628753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014404119,0.00033463122,0.98081917,0.0002223199,0.000069323214,0.00006990764,0.000028526749,0.00031690678,0.0037350557],"genre_scores_gemma":[0.52628255,0.00025733854,0.46780175,0.0003085088,0.0000759571,0.000305028,0.00011587962,0.00012918407,0.0047238073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996264,0.00013668211,0.00001995694,0.000058790887,0.00011453887,0.00004366036],"domain_scores_gemma":[0.99955493,0.00024239556,0.00004563186,0.000038016326,0.00008800654,0.000030934923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009876738,0.0007894784,0.00096180465,0.0006709216,0.0003712725,0.00068113377,0.0011586667,0.0012178991,0.0021956866],"category_scores_gemma":[0.0019382456,0.00036214426,0.00056876394,0.00064335717,0.00069431105,0.00057809777,0.000926211,0.00081237976,0.00039362532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047675025,0.000032555537,0.00028574368,0.000063938394,0.000035006826,0.000055705972,0.000029669984,0.9443556,0.0014890989,0.011519585,0.0015057499,0.040579703],"study_design_scores_gemma":[0.000006901091,0.0000113279975,0.00003071743,0.0000026779994,0.0000020799473,0.000004305819,0.0000018235324,0.99832684,0.000092993156,0.0013175556,0.00020119669,0.0000015884199],"about_ca_topic_score_codex":0.0038386835,"about_ca_topic_score_gemma":0.0030711403,"teacher_disagreement_score":0.0038386835,"about_ca_system_score_codex":0.00070475246,"about_ca_system_score_gemma":0.0011150531,"threshold_uncertainty_score":0.007632673},"labels":[],"label_agreement":null},{"id":"W3157047073","doi":"10.22266/ijies2021.0630.46","title":"Ring Toss Game-Based Optimization Algorithm for Solving Various Optimization Problems","year":2021,"lang":"en","type":"article","venue":"International journal of intelligent engineering and systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematical optimization; Optimization problem; Particle swarm optimization; Meta-optimization; Multi-swarm optimization; Test functions for optimization; Continuous optimization; Population; Set (abstract data type); Algorithm; Mathematics","score_opus":0.022163953912274766,"score_gpt":0.2679632357895824,"score_spread":0.24579928187730765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157047073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009004683,0.00037700913,0.9823821,0.00014830822,0.00006958283,0.00014088757,0.00004757602,0.00028661356,0.007543229],"genre_scores_gemma":[0.43393472,0.0008895687,0.5514398,0.00035172608,0.00007897307,0.001325537,0.00030563795,0.00016580269,0.011508206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995035,0.00018307695,0.000031208278,0.00008480765,0.00013703854,0.000060317983],"domain_scores_gemma":[0.9994772,0.0003045988,0.000050173723,0.000025828576,0.00010930203,0.00003302183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010756304,0.0012763645,0.0013314792,0.0008286261,0.00070092385,0.000989288,0.0014295711,0.0011122148,0.005162076],"category_scores_gemma":[0.0017060937,0.00042393003,0.0010963645,0.0007630257,0.0007811785,0.00082453317,0.0014021818,0.0013418276,0.00059971045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038069753,0.000040861665,0.0005381698,0.000091687885,0.000058407615,0.00004967382,0.000046714107,0.95181626,0.00075882534,0.0161103,0.0011031135,0.029347869],"study_design_scores_gemma":[0.000014685619,0.000032322427,0.00005627571,0.000007434052,0.000009544538,0.000014087441,0.000007933735,0.99620616,0.00019191297,0.0025057227,0.0009486049,0.000005277035],"about_ca_topic_score_codex":0.009084754,"about_ca_topic_score_gemma":0.0072270515,"teacher_disagreement_score":0.009084754,"about_ca_system_score_codex":0.00091476884,"about_ca_system_score_gemma":0.0016186198,"threshold_uncertainty_score":0.018063784},"labels":[],"label_agreement":null},{"id":"W3160834095","doi":"10.1016/j.rico.2021.100015","title":"Improving the search pattern of Rooted Tree Optimisation algorithm to solve complex problems","year":2021,"lang":"en","type":"article","venue":"Results in Control and Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Tabu search; Particle swarm optimization; Benchmark (surveying); Mathematical optimization; Mathematics; Metaheuristic; Tree (set theory); Convergence (economics); Algorithm; Computer science","score_opus":0.027757472522184867,"score_gpt":0.27076265565816093,"score_spread":0.24300518313597608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160834095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029319514,0.00026283396,0.96614355,0.00008745375,0.000030032974,0.00004644417,0.00002065999,0.00043202072,0.0036575494],"genre_scores_gemma":[0.4338919,0.00037665098,0.5620019,0.00013433529,0.000024077503,0.00024964675,0.00014519997,0.00019984019,0.0029765253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962986,0.00008888228,0.000031039166,0.00007109531,0.00014690438,0.000032184336],"domain_scores_gemma":[0.9992834,0.00035668773,0.00008133595,0.00006160928,0.00018995443,0.000026944943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006633638,0.0005561917,0.00059898495,0.0005580907,0.00030657143,0.00057310815,0.00082372315,0.00079448393,0.0020686039],"category_scores_gemma":[0.0023562955,0.00030991776,0.0006142418,0.0006261891,0.0004135999,0.00071831694,0.0006923774,0.0007848633,0.00052368734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007017877,0.00008065411,0.0013476714,0.00016870837,0.0000440071,0.00007391982,0.00013559885,0.838843,0.010973191,0.0068499562,0.001037213,0.14037591],"study_design_scores_gemma":[0.000011716944,0.000038833452,0.00014698619,0.0000070029355,0.0000066453435,0.000019588777,0.0000094989655,0.99683553,0.0009965122,0.0012186397,0.00070465414,0.000004371968],"about_ca_topic_score_codex":0.003081213,"about_ca_topic_score_gemma":0.0027325556,"teacher_disagreement_score":0.003081213,"about_ca_system_score_codex":0.00031039558,"about_ca_system_score_gemma":0.0009482499,"threshold_uncertainty_score":0.006920159},"labels":[],"label_agreement":null},{"id":"W3168883534","doi":"","title":"A Scalable Deterministic Global Optimization Algorithm for Clustering Problems","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cluster analysis; Scalability; Algorithm design; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04968482956191144,"score_gpt":0.3361670436158939,"score_spread":0.28648221405398244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168883534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004854197,0.00028644872,0.99028987,0.00019025414,0.00011739967,0.00007226338,0.000079867146,0.0011517185,0.0029579422],"genre_scores_gemma":[0.117829174,0.00022144135,0.87684274,0.00020554234,0.00011362714,0.0004281544,0.0003982521,0.00043066475,0.0035304506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991334,0.0002254867,0.0000443729,0.00017078237,0.00033942112,0.00008643628],"domain_scores_gemma":[0.9987288,0.000654108,0.00007710874,0.00018166416,0.0002952519,0.00006301065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014777129,0.0014191092,0.0018684026,0.0010390566,0.0009952697,0.0012095141,0.0022557501,0.0019726867,0.005402384],"category_scores_gemma":[0.0037022387,0.0009018419,0.0011095507,0.0016809136,0.0007311887,0.0013499755,0.0022128841,0.0016540728,0.0014574246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001375295,0.00006608625,0.0002013796,0.00008537585,0.00006445368,0.000047333422,0.000034759374,0.85811186,0.0017249102,0.01011324,0.0060672183,0.12334589],"study_design_scores_gemma":[0.000024497398,0.000013290645,0.00003198307,0.0000030260849,0.000005213345,0.000007965862,0.0000033385777,0.99655724,0.00018428887,0.0025448669,0.0006203803,0.0000038200365],"about_ca_topic_score_codex":0.007041632,"about_ca_topic_score_gemma":0.009271416,"teacher_disagreement_score":0.007041632,"about_ca_system_score_codex":0.0012037473,"about_ca_system_score_gemma":0.0022830737,"threshold_uncertainty_score":0.018072784},"labels":[],"label_agreement":null},{"id":"W3169904086","doi":"","title":"Nonmyopic Multifidelity Acitve Search","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.08054011375428007,"score_gpt":0.36158431784632106,"score_spread":0.281044204092041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169904086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09592212,0.002209033,0.81253123,0.0012613811,0.00059847836,0.00023390708,0.00020856889,0.00038287786,0.086652525],"genre_scores_gemma":[0.74949706,0.00038898538,0.22567476,0.000612023,0.0001678775,0.00039400248,0.0001555432,0.0001931059,0.022916574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967873,0.00012233036,0.000014394623,0.0000354197,0.00010949447,0.00003957923],"domain_scores_gemma":[0.99911267,0.00057440775,0.00008444109,0.000067201254,0.000106206375,0.00005498838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087259867,0.00076770963,0.0010411151,0.0012460354,0.00090905075,0.0012397334,0.0013615465,0.002305633,0.011999263],"category_scores_gemma":[0.004004907,0.0005293152,0.00056813576,0.00080299744,0.0007100804,0.0010932882,0.0024841442,0.00092807267,0.0008286234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002702011,0.000117688716,0.0011379991,0.00024094393,0.00010106523,0.00014446046,0.00010859459,0.8310927,0.0021964293,0.07592417,0.0034129934,0.085252754],"study_design_scores_gemma":[0.000020532754,0.000054085514,0.00011737079,0.000022612843,0.000009267972,0.000040802883,0.000017209442,0.9919951,0.00028796698,0.0060500223,0.0013793075,0.0000057654415],"about_ca_topic_score_codex":0.0017992998,"about_ca_topic_score_gemma":0.0029136534,"teacher_disagreement_score":0.011999263,"about_ca_system_score_codex":0.0008360955,"about_ca_system_score_gemma":0.00074346445,"threshold_uncertainty_score":0.040141463},"labels":[],"label_agreement":null},{"id":"W3173855118","doi":"10.1609/icaps.v31i1.15978","title":"Iterative-deepening Bidirectional Heuristic Search with Restricted Memory","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Computer science; Heuristics; Iterative deepening depth-first search; Heuristic; Incremental heuristic search; Beam search; Bidirectional search; Search algorithm; Node (physics); Exploit; Algorithm; Artificial intelligence","score_opus":0.04752449624311907,"score_gpt":0.308609240293454,"score_spread":0.26108474405033494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173855118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039525144,0.0003331674,0.9542213,0.00010462054,0.00003658355,0.00010232935,0.0000730142,0.0011556635,0.004448116],"genre_scores_gemma":[0.45484173,0.00018081984,0.54018766,0.0001752399,0.00002362073,0.0003499197,0.00026916357,0.00024448504,0.0037272852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927276,0.0002375053,0.00004775888,0.00010750136,0.00018991293,0.00014458469],"domain_scores_gemma":[0.9981893,0.00093613437,0.00016462096,0.0003257062,0.00029703783,0.00008730422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013471358,0.00090863684,0.0011652524,0.00083171285,0.00045416504,0.0010268795,0.002052001,0.0011652979,0.0030947016],"category_scores_gemma":[0.004657945,0.00066377106,0.0008181409,0.0009407909,0.0006978236,0.0014903268,0.0022355183,0.0011807532,0.0006196139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030928617,0.0001939419,0.0014626653,0.0001980878,0.00007136998,0.00008572847,0.0002218,0.72118646,0.0058673546,0.022521015,0.0018949906,0.24598734],"study_design_scores_gemma":[0.000038285845,0.00006478089,0.0000748796,0.00001298339,0.000013083897,0.000020782687,0.0000239184,0.99066824,0.0014788958,0.006581652,0.0010149467,0.000007734953],"about_ca_topic_score_codex":0.005499488,"about_ca_topic_score_gemma":0.0058345315,"teacher_disagreement_score":0.005499488,"about_ca_system_score_codex":0.0007112656,"about_ca_system_score_gemma":0.002192613,"threshold_uncertainty_score":0.010934949},"labels":[],"label_agreement":null},{"id":"W3174204509","doi":"10.1609/aaai.v35i18.17873","title":"Logic Guided Genetic Algorithms (Student Abstract)","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; University of Toronto","funders":"","keywords":"Conjunction (astronomy); Computer science; A priori and a posteriori; Set (abstract data type); Algorithm; Genetic algorithm; Function (biology); Fraction (chemistry); Symbolic regression; Data set; State (computer science); Artificial intelligence; Machine learning; Genetic programming; Programming language","score_opus":0.14011594457512389,"score_gpt":0.3638528095070106,"score_spread":0.22373686493188671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174204509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015288117,0.00017759572,0.97781926,0.00030318458,0.000069508504,0.000061146486,0.00012270753,0.000915189,0.0052433056],"genre_scores_gemma":[0.2844932,0.00018285374,0.7085978,0.00055622205,0.00007365313,0.000321965,0.0005276082,0.00025156347,0.0049950876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992823,0.00030968527,0.000030072699,0.00016681032,0.00014579957,0.000065437845],"domain_scores_gemma":[0.9985191,0.0010103553,0.00009511157,0.00015261561,0.00018770034,0.000035042416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001106301,0.00075446354,0.00070926914,0.0008199579,0.00032254134,0.000991683,0.0013413394,0.0012739422,0.0051022144],"category_scores_gemma":[0.004242169,0.0003258335,0.00073169754,0.0007906883,0.0010653787,0.00076344726,0.001054896,0.0011726359,0.00097235496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010040186,0.00010524463,0.0011760526,0.00012378681,0.00007757189,0.00008910836,0.00011325124,0.7794283,0.002279293,0.049206447,0.004054069,0.1632464],"study_design_scores_gemma":[0.000029624724,0.00003242482,0.00008562598,0.000014166193,0.000008997524,0.000017315613,0.000008876787,0.98019046,0.00065229525,0.01733856,0.0016162493,0.0000053892268],"about_ca_topic_score_codex":0.0031695806,"about_ca_topic_score_gemma":0.0031834187,"teacher_disagreement_score":0.0051022144,"about_ca_system_score_codex":0.0008479519,"about_ca_system_score_gemma":0.0010861135,"threshold_uncertainty_score":0.017068624},"labels":[],"label_agreement":null},{"id":"W3174209100","doi":"10.1609/aaai.v35i5.16485","title":"Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Bounding overwatch; Constant (computer programming); Computer science; Heuristic; Differentiable function; Piecewise; Mathematical optimization; Piecewise linear function; Incremental heuristic search; Function (biology); Mathematics; Search algorithm; Beam search; Artificial intelligence","score_opus":0.09174042424760195,"score_gpt":0.3268076675045277,"score_spread":0.23506724325692577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174209100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043338086,0.0007588634,0.9468781,0.00043856006,0.00007864596,0.00022321526,0.00010191061,0.00068665436,0.0074959593],"genre_scores_gemma":[0.7281723,0.00064136897,0.26751024,0.00040208176,0.00008465089,0.00038704128,0.00028299994,0.00037800195,0.0021413798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943158,0.0021281699,0.0004027005,0.00071792275,0.0013156867,0.0011197632],"domain_scores_gemma":[0.9599716,0.029786207,0.003216871,0.002633944,0.00285398,0.0015374754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009819887,0.0014034136,0.0020021142,0.0017840442,0.0010706012,0.0027435082,0.0022784804,0.0019691563,0.0045859595],"category_scores_gemma":[0.06106146,0.0010813773,0.0011252005,0.001142314,0.002863502,0.005619586,0.00301075,0.0035533987,0.0006679657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048490535,0.00028487144,0.0034453757,0.00060396903,0.00009969572,0.00043937712,0.00046896734,0.6581234,0.0065540466,0.22450715,0.0052977623,0.09969048],"study_design_scores_gemma":[0.00006715258,0.00022511033,0.0005884598,0.00009117616,0.000028905439,0.00017815336,0.000112494374,0.93310237,0.0027615586,0.061021827,0.0017892614,0.000033551143],"about_ca_topic_score_codex":0.0029037404,"about_ca_topic_score_gemma":0.0019490515,"teacher_disagreement_score":0.009819887,"about_ca_system_score_codex":0.0017245552,"about_ca_system_score_gemma":0.004373537,"threshold_uncertainty_score":0.05193311},"labels":[],"label_agreement":null},{"id":"W3175206867","doi":"10.22266/ijies2021.0831.34","title":"Mixed Best Members Based Optimizer for Solving Various Optimization Problems","year":2021,"lang":"en","type":"article","venue":"International journal of intelligent engineering and systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematical optimization; Computer science; Particle swarm optimization; Meta-optimization; Optimization problem; Population; Multi-swarm optimization; Derivative-free optimization; Continuous optimization; Set (abstract data type); Test functions for optimization; Metaheuristic; Algorithm; Mathematics","score_opus":0.03768490655135273,"score_gpt":0.2725425201303167,"score_spread":0.23485761357896398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175206867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039281966,0.00045394836,0.99197376,0.000089612644,0.000038144182,0.000058790483,0.000018582581,0.0002757564,0.0031631733],"genre_scores_gemma":[0.20426702,0.0010091015,0.78820884,0.00019989577,0.00009547282,0.00082724926,0.0001673077,0.00022506608,0.005000052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990835,0.0003868528,0.000044523447,0.00011718089,0.0003164838,0.000051399424],"domain_scores_gemma":[0.9993981,0.0003324449,0.00007389838,0.000049673767,0.000119378084,0.000026564729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021643878,0.0017046089,0.0013107075,0.0009956359,0.0006967713,0.0011083215,0.0014192294,0.001344973,0.0026962045],"category_scores_gemma":[0.0027583058,0.000626153,0.0012619429,0.0010466464,0.0006995581,0.000985013,0.0011835345,0.0016630065,0.00085092883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006164279,0.000059843533,0.00058708526,0.00021396525,0.00014958036,0.000058909616,0.00008569574,0.87740445,0.0022815953,0.0142329605,0.0016845447,0.10317958],"study_design_scores_gemma":[0.000010109783,0.000040456496,0.00010356102,0.000017809729,0.000017418002,0.000023375154,0.00001229709,0.9936655,0.0007936918,0.0029946533,0.0023136274,0.0000073999117],"about_ca_topic_score_codex":0.0018320185,"about_ca_topic_score_gemma":0.002020845,"teacher_disagreement_score":0.0026962045,"about_ca_system_score_codex":0.0006176944,"about_ca_system_score_gemma":0.0010337239,"threshold_uncertainty_score":0.011446536},"labels":[],"label_agreement":null},{"id":"W3175911291","doi":"10.22266/ijies2021.0831.41","title":"MLBO: Mixed Leader Based Optimizer for Solving Optimization Problems","year":2021,"lang":"en","type":"article","venue":"International journal of intelligent engineering and systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Mathematical optimization; Meta-optimization; Optimization problem; Multi-swarm optimization; Particle swarm optimization; Population; Continuous optimization; Metaheuristic; Test functions for optimization; Derivative-free optimization; Algorithm; Mathematics","score_opus":0.03547555667392628,"score_gpt":0.27581750178400033,"score_spread":0.24034194511007406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175911291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006894653,0.00059115945,0.9854614,0.00018873952,0.00008593772,0.000089949506,0.00004394253,0.0010529656,0.0055912877],"genre_scores_gemma":[0.34951907,0.0010742614,0.63593924,0.000449059,0.00015607747,0.00093156256,0.0003844021,0.0004921825,0.011054186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995059,0.00015337604,0.00002239662,0.000068852096,0.00020526173,0.000044223507],"domain_scores_gemma":[0.99968886,0.000121934536,0.000054472206,0.000025072213,0.000086554464,0.000023214337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008944252,0.0012383969,0.0010715945,0.0006178033,0.00065423164,0.00091772265,0.001136485,0.0011639389,0.0033469559],"category_scores_gemma":[0.0012681681,0.0003732419,0.0008003581,0.0005296518,0.00048795683,0.000719008,0.00088899885,0.0012086867,0.00093204394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015218576,0.00012306597,0.0012478761,0.00043194758,0.00015327876,0.00017704166,0.00015996427,0.7969537,0.008250652,0.014804096,0.0075365235,0.17000975],"study_design_scores_gemma":[0.00002835069,0.00007991766,0.00017151024,0.00001762357,0.00001240543,0.00003581738,0.00001610006,0.9915884,0.0014662559,0.0019989451,0.004573657,0.0000109647435],"about_ca_topic_score_codex":0.0027372595,"about_ca_topic_score_gemma":0.0026128017,"teacher_disagreement_score":0.0033469559,"about_ca_system_score_codex":0.00043517275,"about_ca_system_score_gemma":0.0010285553,"threshold_uncertainty_score":0.011196673},"labels":[],"label_agreement":null},{"id":"W3181892836","doi":"10.1007/978-3-030-78743-1_21","title":"Two Modified NichePSO Algorithms for Multimodal Optimization","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Benchmark (surveying); Particle swarm optimization; Heuristic; Mathematical optimization; Algorithm; Evolutionary algorithm; Metaheuristic; Optimization algorithm; Multi-swarm optimization; Genetic algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.040345808245364365,"score_gpt":0.3135425495727767,"score_spread":0.27319674132741234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181892836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008236183,0.0011306785,0.97163534,0.0002676438,0.00049527193,0.00014323728,0.00011081595,0.00065319403,0.017327638],"genre_scores_gemma":[0.10545994,0.0006390758,0.87062114,0.00032532684,0.000268647,0.0006570467,0.0003080538,0.00060724997,0.021113537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992366,0.00021963766,0.000035310735,0.00008104102,0.0003440329,0.00008349824],"domain_scores_gemma":[0.99933285,0.00029256757,0.000035892117,0.000095603296,0.00018145623,0.00006162854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009684086,0.001488425,0.0013999776,0.0011194727,0.00059592054,0.0013577951,0.0026344114,0.0022600451,0.0087742675],"category_scores_gemma":[0.0033794378,0.00061541557,0.0012542867,0.0016732113,0.0006945586,0.0013559447,0.0026064063,0.002018451,0.001757392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040831981,0.00027343057,0.00040527442,0.0002998646,0.0001459127,0.00012854738,0.00014797406,0.36761916,0.0047821794,0.06517928,0.013458177,0.54715186],"study_design_scores_gemma":[0.00007455393,0.00008546484,0.00017716363,0.00002083803,0.00002294471,0.00006729274,0.000019589841,0.97799885,0.00081248535,0.012594332,0.00810246,0.000024032575],"about_ca_topic_score_codex":0.0022087083,"about_ca_topic_score_gemma":0.0032438396,"teacher_disagreement_score":0.0087742675,"about_ca_system_score_codex":0.0007262224,"about_ca_system_score_gemma":0.00089841516,"threshold_uncertainty_score":0.029352903},"labels":[],"label_agreement":null},{"id":"W3181997525","doi":"10.3390/app11136201","title":"Dimension-Wise Particle Swarm Optimization: Evaluation and Comparative Analysis","year":2021,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Alberta","keywords":"Particle swarm optimization; Dimension (graph theory); Maxima and minima; Meta-optimization; Mathematical optimization; Benchmark (surveying); Differential evolution; Multi-swarm optimization; Computer science; Convergence (economics); Algorithm; Imperialist competitive algorithm; Mathematics","score_opus":0.09690670564451638,"score_gpt":0.36220047255427756,"score_spread":0.2652937669097612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181997525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69435704,0.020461498,0.25070444,0.0006813208,0.00046393237,0.0004852612,0.0007107905,0.0012108408,0.030924756],"genre_scores_gemma":[0.8857718,0.0036735577,0.10800643,0.00005769919,0.00006586088,0.00015081413,0.0006744321,0.000107762164,0.0014916183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826366,0.00067699794,0.00016213153,0.00013108368,0.00069096504,0.00007528852],"domain_scores_gemma":[0.9969369,0.0016977342,0.00014463572,0.00026841133,0.00089233555,0.000060030816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00312656,0.0006793678,0.0009775269,0.0019874582,0.00031106954,0.0008785876,0.00066835067,0.00074391084,0.00081562204],"category_scores_gemma":[0.006116989,0.00013468265,0.0005377016,0.002340963,0.00035412092,0.00081178895,0.00063547917,0.00032515483,0.00015532278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008136027,0.00045313447,0.010628161,0.001374064,0.0006776496,0.00013059858,0.00015972838,0.59527946,0.0057258653,0.0074766437,0.003339143,0.37394196],"study_design_scores_gemma":[0.00008394477,0.001238704,0.009200838,0.000073611125,0.00022475544,0.00019378678,0.00012001895,0.9747931,0.00839672,0.0014867481,0.0041412646,0.000046530116],"about_ca_topic_score_codex":0.0016456806,"about_ca_topic_score_gemma":0.0011807571,"teacher_disagreement_score":0.00312656,"about_ca_system_score_codex":0.0006719553,"about_ca_system_score_gemma":0.0003680489,"threshold_uncertainty_score":0.016535044},"labels":[],"label_agreement":null},{"id":"W3182786887","doi":"10.1145/3449726.3463186","title":"Population-based coordinate descent algorithm with majority voting","year":2021,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Population; Coordinate descent; Voting; Mathematical optimization; Algorithm; Scale (ratio); Mathematics","score_opus":0.018907877567900123,"score_gpt":0.24380350571475212,"score_spread":0.224895628146852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182786887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008643768,0.0003325959,0.98688775,0.00017468735,0.00009726924,0.00010761334,0.000030075014,0.00041327582,0.0033128564],"genre_scores_gemma":[0.41900253,0.00044464818,0.5690428,0.00038704646,0.00014748743,0.00076487486,0.00035293784,0.0001711194,0.009686511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831057,0.00060792704,0.00008023975,0.00031094326,0.00052712095,0.00016320898],"domain_scores_gemma":[0.9986099,0.0004301404,0.00012181618,0.00014586789,0.00062612223,0.000066127184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021910144,0.0013734519,0.0027549984,0.0008333065,0.0008877005,0.0013113787,0.0032582514,0.0017187471,0.002167206],"category_scores_gemma":[0.0039379764,0.00053589855,0.0009714234,0.0013417043,0.0009281677,0.0010398894,0.0013591659,0.0014046363,0.00097500527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001522369,0.000089534806,0.0015255365,0.000121944315,0.0001470465,0.00012753005,0.00013869764,0.7648678,0.003171286,0.018108955,0.0064273723,0.20512205],"study_design_scores_gemma":[0.000040989384,0.00005167351,0.00011655916,0.000005976699,0.000014541985,0.00002749819,0.000009827849,0.9955669,0.0006167617,0.00210542,0.0014356526,0.000008238968],"about_ca_topic_score_codex":0.006934421,"about_ca_topic_score_gemma":0.0053391494,"teacher_disagreement_score":0.006934421,"about_ca_system_score_codex":0.0008174092,"about_ca_system_score_gemma":0.0019010975,"threshold_uncertainty_score":0.013788164},"labels":[],"label_agreement":null},{"id":"W3187712750","doi":"10.1155/2021/5526127","title":"Compact Sine Cosine Algorithm with Multigroup and Multistrategy for Dispatching System of Public Transit Vehicles","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Sine; Convergence (economics); Computer science; Trigonometric functions; Mathematical optimization; Optimization problem; Population; Wireless sensor network; Algorithm; Mathematics","score_opus":0.021482831399074472,"score_gpt":0.2792236875496082,"score_spread":0.2577408561505337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187712750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07234847,0.0004476683,0.9210019,0.00026110344,0.00010656495,0.00015162263,0.000028655784,0.0001711808,0.0054827947],"genre_scores_gemma":[0.7334907,0.00028039402,0.26110947,0.00014019855,0.0000664424,0.00030480418,0.00011241477,0.000051563326,0.0044440026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995919,0.00011637275,0.000030667605,0.0000698981,0.00013864304,0.000052688396],"domain_scores_gemma":[0.9995474,0.00017585748,0.000070316,0.00004002914,0.0001218537,0.000044439363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008460899,0.0007535998,0.0009397473,0.0007643721,0.00065962214,0.00078331784,0.0011543103,0.00095727795,0.0020136589],"category_scores_gemma":[0.00169924,0.0002754755,0.0005298473,0.00081656844,0.00059610856,0.000988168,0.0007635102,0.00069420686,0.00022943933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014387196,0.00013203314,0.000869891,0.00007892944,0.000051677664,0.00007117453,0.00014824429,0.8526613,0.0033917844,0.028231483,0.0014125813,0.112807095],"study_design_scores_gemma":[0.000021397258,0.000070810194,0.00008000655,0.000004194471,0.000005648397,0.000013369226,0.0000124623675,0.9963238,0.00033720225,0.0025687586,0.0005577573,0.000004562396],"about_ca_topic_score_codex":0.0052917376,"about_ca_topic_score_gemma":0.0039824042,"teacher_disagreement_score":0.0052917376,"about_ca_system_score_codex":0.000812511,"about_ca_system_score_gemma":0.0014456703,"threshold_uncertainty_score":0.010521829},"labels":[],"label_agreement":null},{"id":"W3189183394","doi":"10.1109/cec45853.2021.9504760","title":"Visualizing and Characterizing the Parameter Configuration Landscape of Particle Swarm Optimization using Physical Landform Classification","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Computer science; Swarm behaviour; Heuristic; Multi-swarm optimization; Landform; Mathematical optimization; Scheme (mathematics); Artificial intelligence; Machine learning; Mathematics; Geology","score_opus":0.06668862446659618,"score_gpt":0.33267334479366245,"score_spread":0.26598472032706627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189183394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25376195,0.00048200326,0.7326915,0.0005521451,0.000038739952,0.00010740295,0.00021840417,0.00095107156,0.01119662],"genre_scores_gemma":[0.8507094,0.00024663363,0.14778934,0.00004331456,0.00001316335,0.0000793794,0.00015508746,0.000106857835,0.0008567329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999044,0.00004028336,0.0000054986076,0.000014887017,0.000022698388,0.000012266343],"domain_scores_gemma":[0.9997297,0.00013654795,0.000041322815,0.000038387614,0.000036219477,0.00001776657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000429651,0.00048990914,0.0003015441,0.0010106585,0.00032881397,0.0011342845,0.00026700535,0.00045193208,0.0013164612],"category_scores_gemma":[0.0011803495,0.00019599045,0.000299045,0.0007199442,0.0005813587,0.0007715421,0.00055337034,0.0004234183,0.0001247649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016946808,0.00006938963,0.007325194,0.00016848026,0.00005100977,0.0003188594,0.0005770105,0.8372767,0.027644884,0.036888566,0.0018357671,0.08767467],"study_design_scores_gemma":[0.000014180744,0.000037929884,0.0032170927,0.000018761422,0.000009678121,0.000069382215,0.00012498416,0.97666013,0.0037845226,0.014323636,0.0017214019,0.000018229337],"about_ca_topic_score_codex":0.0020832068,"about_ca_topic_score_gemma":0.0019434709,"teacher_disagreement_score":0.0020832068,"about_ca_system_score_codex":0.00036371578,"about_ca_system_score_gemma":0.00037859476,"threshold_uncertainty_score":0.0044040084},"labels":[],"label_agreement":null},{"id":"W3189323750","doi":"10.1109/cec45853.2021.9504762","title":"Memetic Differential Evolution Using Coordinate Descent","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Memetic algorithm; Coordinate descent; Benchmark (surveying); Local search (optimization); Differential evolution; Mathematical optimization; Computer science; Population; Local optimum; Algorithm; Guided Local Search; Mathematics","score_opus":0.03685512702895182,"score_gpt":0.2925236321785362,"score_spread":0.2556685051495844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189323750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017716084,0.0012198803,0.9645278,0.00032814004,0.00016512307,0.00012693428,0.000054816737,0.00037395622,0.0154872],"genre_scores_gemma":[0.5883276,0.001573225,0.3963128,0.0004284823,0.0001571843,0.0007491131,0.00016913035,0.00010883509,0.012173661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997174,0.00007809602,0.000015046075,0.000049197268,0.00011471219,0.000025472484],"domain_scores_gemma":[0.999762,0.00010565149,0.00002878836,0.00002595571,0.00006662473,0.000010983696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057059765,0.00072211656,0.001210163,0.00056811085,0.00043869083,0.0008874747,0.0014358985,0.0010845285,0.0015252439],"category_scores_gemma":[0.0012965779,0.00033239694,0.0007524861,0.0007454494,0.000597343,0.00055084366,0.0008503355,0.0007036907,0.0003362287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004304884,0.00004449837,0.0008425404,0.00017482718,0.00012376679,0.00016731166,0.000098250675,0.87713355,0.005430652,0.03226766,0.0029576644,0.080716126],"study_design_scores_gemma":[0.000017232336,0.000033190736,0.00012363437,0.000009359896,0.000013909066,0.000051107607,0.0000069110383,0.9933981,0.00080393476,0.0026261532,0.0029093593,0.000007140469],"about_ca_topic_score_codex":0.00228376,"about_ca_topic_score_gemma":0.0016218749,"teacher_disagreement_score":0.00228376,"about_ca_system_score_codex":0.00061506487,"about_ca_system_score_gemma":0.0006962476,"threshold_uncertainty_score":0.0051024556},"labels":[],"label_agreement":null},{"id":"W3190760168","doi":"10.1109/cec45853.2021.9504905","title":"Machine Learning for Determining the Transition Point in Hybrid Metaheuristics","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Metaheuristic; Benchmark (surveying); Computer science; Task (project management); Relay; Artificial intelligence; Point (geometry); Transition (genetics); Hybrid algorithm (constraint satisfaction); Machine learning; Mathematical optimization; Mathematics; Engineering","score_opus":0.03133504659907127,"score_gpt":0.2886239191119007,"score_spread":0.25728887251282945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190760168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094014816,0.0006981226,0.90035397,0.0003706563,0.000060093,0.00018989439,0.00007279225,0.0005990107,0.0036406685],"genre_scores_gemma":[0.79938394,0.00023135217,0.19835463,0.0001684258,0.000037935417,0.00042597708,0.00017568549,0.00008583074,0.0011361919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992586,0.0003423872,0.0000559899,0.00010431052,0.00015427303,0.000084521744],"domain_scores_gemma":[0.996854,0.002324821,0.00026929608,0.00011552992,0.00036469047,0.000071686285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028122398,0.0010566169,0.0011468306,0.002151249,0.00055566686,0.0012528552,0.0012834956,0.0015919207,0.0015911578],"category_scores_gemma":[0.007341245,0.0005104134,0.0009468745,0.0010075181,0.0011120044,0.001209728,0.0010278755,0.001636754,0.00037794097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085582986,0.00006807983,0.0011036446,0.00006668911,0.000045253262,0.000027321874,0.000043432858,0.95878136,0.00074457517,0.0062938314,0.00030007167,0.03244013],"study_design_scores_gemma":[0.000005874086,0.000024665651,0.00006927477,0.0000077732875,0.000003586643,0.000003803414,0.0000073082992,0.9974922,0.00018897688,0.0021124107,0.00008172634,0.0000024711433],"about_ca_topic_score_codex":0.0025631252,"about_ca_topic_score_gemma":0.0019175565,"teacher_disagreement_score":0.0028122398,"about_ca_system_score_codex":0.0011766073,"about_ca_system_score_gemma":0.0011603992,"threshold_uncertainty_score":0.01487273},"labels":[],"label_agreement":null},{"id":"W3190982209","doi":"10.1109/cec45853.2021.9505006","title":"Predicting Particle Swarm Optimization Control Parameters From Fitness Landscape Characteristics","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Benchmark (surveying); Fitness landscape; Generalization; Computer science; Selection (genetic algorithm); Suite; Mathematical optimization; Control (management); Test suite; Metaheuristic; Field (mathematics); Machine learning; Optimization problem; Artificial intelligence; Test case; Algorithm; Mathematics; Population","score_opus":0.01980432618358108,"score_gpt":0.25438106389650383,"score_spread":0.23457673771292276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190982209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62519574,0.00070055155,0.36699542,0.00042251588,0.00004495443,0.00016659897,0.00023975866,0.0007350832,0.005499322],"genre_scores_gemma":[0.9514957,0.00016135364,0.04755845,0.00002749849,0.000006191673,0.00006960188,0.0002098484,0.00006282102,0.00040852054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997634,0.000083747196,0.00001542667,0.000037757214,0.00006953376,0.00003022949],"domain_scores_gemma":[0.9975374,0.0017213335,0.00023014171,0.00018554604,0.00028887743,0.000036798378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014021858,0.0009522376,0.00050937274,0.0012362101,0.00024386843,0.000968218,0.00034949242,0.00073311967,0.0006071158],"category_scores_gemma":[0.0066336114,0.00025951356,0.00030694078,0.0006402093,0.00039979693,0.0008892108,0.00032046597,0.0007239125,0.0001752713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032975324,0.00004625881,0.003019795,0.00003843459,0.000015226732,0.00002904999,0.000021138934,0.96754396,0.003436647,0.0007973532,0.00037291035,0.024646262],"study_design_scores_gemma":[0.0000032536523,0.000018165128,0.0008498841,0.0000037220188,0.000002389031,0.0000053667345,0.0000075191,0.9971614,0.0013125606,0.00052180066,0.000110344,0.0000035586372],"about_ca_topic_score_codex":0.0025258702,"about_ca_topic_score_gemma":0.0022321672,"teacher_disagreement_score":0.0025258702,"about_ca_system_score_codex":0.00044506695,"about_ca_system_score_gemma":0.0004423374,"threshold_uncertainty_score":0.007415533},"labels":[],"label_agreement":null},{"id":"W3191597211","doi":"10.1109/cec45853.2021.9504812","title":"An Exploration-only Exploitation-only Hybrid for Large Scale Global Optimization","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Selection (genetic algorithm); Population; Convergence (economics); Metaheuristic; Scale (ratio); Artificial intelligence; Mathematics; Geography; Economics","score_opus":0.037143198323096926,"score_gpt":0.3303448506157609,"score_spread":0.293201652292664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191597211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15925547,0.00055637094,0.82844585,0.00014045724,0.00003887708,0.00010298263,0.000037371752,0.0009172082,0.010505506],"genre_scores_gemma":[0.838843,0.00013296498,0.15742993,0.00010662895,0.00001928768,0.00016901997,0.000065463726,0.00007882904,0.0031548494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997683,0.000068482324,0.000010424372,0.000026029024,0.000100132725,0.000026750653],"domain_scores_gemma":[0.9996902,0.0001316668,0.00003303391,0.0000612112,0.00006144942,0.000022418957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046212514,0.00036559647,0.0004303456,0.00035067755,0.00029428073,0.0005023676,0.0006399025,0.0005232667,0.00095588673],"category_scores_gemma":[0.0008221524,0.00020760224,0.0002639367,0.00034998168,0.0002346004,0.0006511097,0.00069874665,0.00041410248,0.00020861339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002980082,0.00035353392,0.0039301594,0.00017981324,0.0002111301,0.00031350506,0.00027009824,0.5580325,0.09415526,0.0146241905,0.002059273,0.3255725],"study_design_scores_gemma":[0.000033790064,0.0004260358,0.0011889815,0.000013468128,0.000039503608,0.00019471634,0.000038111957,0.9805289,0.011822388,0.0031016585,0.0025874062,0.000025009549],"about_ca_topic_score_codex":0.00042431024,"about_ca_topic_score_gemma":0.0011575029,"teacher_disagreement_score":0.00095588673,"about_ca_system_score_codex":0.00017640824,"about_ca_system_score_gemma":0.000298065,"threshold_uncertainty_score":0.0031977296},"labels":[],"label_agreement":null},{"id":"W3192162026","doi":"10.1007/s43069-021-00068-x","title":"Review on Nature-Inspired Algorithms","year":2021,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Variety (cybernetics); Process (computing); Set (abstract data type); Engineering optimization; Class (philosophy); Optimization problem; Optimization algorithm; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.0741606981322478,"score_gpt":0.4232050557761675,"score_spread":0.3490443576439197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192162026","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017559886,0.9884261,0.0020580036,0.0021757423,0.0026976925,0.000012817135,0.000051326904,0.000022848228,0.0043799207],"genre_scores_gemma":[0.0024924933,0.9881997,0.0026808574,0.0015961917,0.0027554112,0.000019925763,0.0001235781,0.00001599975,0.0021157712],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917966,0.00017645053,0.000096938136,0.0001114425,0.00037344603,0.00006210688],"domain_scores_gemma":[0.99704945,0.001749518,0.0002327291,0.000110192705,0.0007472345,0.00011079228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013318107,0.001047163,0.0016389341,0.0030040774,0.00038856364,0.0023972634,0.0014723171,0.0017113945,0.0062864637],"category_scores_gemma":[0.004927881,0.00036477222,0.000746546,0.0059469324,0.0007258277,0.0025859172,0.0007845175,0.001959756,0.0029351597],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000944922,0.00007248479,0.0002572661,0.010555809,0.00016554823,0.00008895916,0.0000286501,0.0024820575,0.0007288243,0.021557089,0.12903775,0.834931],"study_design_scores_gemma":[0.000021059295,0.00006462644,0.00048252192,0.0035393534,0.00010916394,0.0002023028,0.000025296715,0.000845531,0.0002734699,0.012234566,0.9821792,0.000022905871],"about_ca_topic_score_codex":0.0018305462,"about_ca_topic_score_gemma":0.002491234,"teacher_disagreement_score":0.0062864637,"about_ca_system_score_codex":0.0011268369,"about_ca_system_score_gemma":0.0025869543,"threshold_uncertainty_score":0.021030366},"labels":[],"label_agreement":null},{"id":"W3195734723","doi":"10.22266/ijies2021.1031.12","title":"TIMBO: Three Influential Members Based Optimizer","year":2021,"lang":"en","type":"article","venue":"International journal of intelligent engineering and systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Particle swarm optimization; Mathematical optimization; Computer science; Population; Optimization problem; Genetic algorithm; Meta-optimization; Derivative-free optimization; Algorithm; Mathematics","score_opus":0.02104300154923021,"score_gpt":0.27077550879937656,"score_spread":0.24973250725014634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195734723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006608606,0.00030166682,0.9857276,0.00011666661,0.00006127821,0.00009420922,0.000038009228,0.0008007559,0.006251257],"genre_scores_gemma":[0.37157676,0.00079134665,0.6091763,0.00048592358,0.00013696389,0.0011137056,0.00047720145,0.0006313313,0.015610597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.00022442741,0.00003337289,0.00010794416,0.0004188584,0.000075809985],"domain_scores_gemma":[0.99953437,0.00014089093,0.00007165366,0.000043322263,0.0001588548,0.00005096579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013044557,0.0014058949,0.0014380319,0.0010043432,0.0011602793,0.0013285865,0.0021811498,0.0016492445,0.0041389517],"category_scores_gemma":[0.0018468949,0.00051823084,0.0011654261,0.00088954455,0.0007682003,0.0010267865,0.0015108659,0.0015538068,0.0012993898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021820333,0.00013220673,0.0010995212,0.00018468923,0.00015637209,0.00012310642,0.00015453881,0.80302554,0.005740699,0.014514775,0.0066068545,0.16804343],"study_design_scores_gemma":[0.000026363778,0.000052011204,0.00015410602,0.0000122881665,0.000018603656,0.000032737462,0.000013544017,0.99248344,0.0012533965,0.0020261907,0.003912494,0.000014751075],"about_ca_topic_score_codex":0.004636823,"about_ca_topic_score_gemma":0.003659356,"teacher_disagreement_score":0.004636823,"about_ca_system_score_codex":0.0008579874,"about_ca_system_score_gemma":0.0014144442,"threshold_uncertainty_score":0.013846159},"labels":[],"label_agreement":null},{"id":"W3197047861","doi":"10.1109/tcyb.2021.3101880","title":"A Promotive Particle Swarm Optimizer With Double Hierarchical Structures","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Korea Electric Power Corporation; National Natural Science Foundation of China","keywords":"Hierarchy; Particle swarm optimization; Benchmark (surveying); Swarm behaviour; Computer science; Convergence (economics); Set (abstract data type); Mathematical optimization; Local optimum; Operator (biology); Hierarchical organization; Mathematics; Artificial intelligence; Algorithm; Biology","score_opus":0.026172741535246874,"score_gpt":0.2747791986209256,"score_spread":0.24860645708567872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197047861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018564416,0.00034076694,0.97619087,0.00011323178,0.000059590537,0.00009022108,0.00003800339,0.00049568573,0.0041072555],"genre_scores_gemma":[0.39414966,0.0003662013,0.59844446,0.00017149323,0.000090362824,0.00045901674,0.00018035402,0.00010903529,0.006029437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997924,0.000051715415,0.000011063276,0.0000376195,0.000087382075,0.00001984578],"domain_scores_gemma":[0.99986684,0.000036204554,0.000022810113,0.000021576418,0.00003634909,0.000016291177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043585966,0.000619893,0.0006382783,0.00039867626,0.0003650808,0.0005324896,0.0011225599,0.00078748545,0.0013584367],"category_scores_gemma":[0.000533094,0.00030301846,0.00056042464,0.00036574394,0.00032027537,0.0005362797,0.0007284151,0.0007223375,0.0004566575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021520541,0.00015670882,0.0018793879,0.00031086442,0.00010072123,0.00026089099,0.00017609351,0.6895627,0.037036724,0.027851587,0.0038160097,0.23863311],"study_design_scores_gemma":[0.000031530257,0.00010860344,0.0001992407,0.000006873335,0.0000136463095,0.00004818568,0.0000089551195,0.9935457,0.0018839614,0.0013707691,0.002772687,0.000009882323],"about_ca_topic_score_codex":0.001719667,"about_ca_topic_score_gemma":0.0015533017,"teacher_disagreement_score":0.001719667,"about_ca_system_score_codex":0.00025672748,"about_ca_system_score_gemma":0.0006226897,"threshold_uncertainty_score":0.004544437},"labels":[],"label_agreement":null},{"id":"W3197111254","doi":"10.1609/socs.v12i1.18581","title":"Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Computer science; Incremental heuristic search; Null-move heuristic; Iterative deepening depth-first search; Search algorithm; Algorithm; Beam search; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.017984615461359425,"score_gpt":0.2674510381562879,"score_spread":0.24946642269492847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197111254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029301153,0.0002431856,0.9618761,0.000091470014,0.00004070132,0.0000948717,0.00005577347,0.001002289,0.007294497],"genre_scores_gemma":[0.4015197,0.00019985087,0.5912511,0.00017026282,0.000029730307,0.00042476575,0.00023350611,0.0002821805,0.0058889426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999446,0.00018134322,0.000028240065,0.000063480555,0.00016053804,0.00012047629],"domain_scores_gemma":[0.9990182,0.0005163478,0.00007725734,0.00016924548,0.00016842881,0.00005051824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506836,0.00074680534,0.0011744205,0.0008198996,0.0004818874,0.0009779274,0.002067365,0.001095017,0.00535127],"category_scores_gemma":[0.003802373,0.0005783513,0.0007207704,0.0009823776,0.00062980637,0.0012351214,0.002153329,0.001147813,0.0009493532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004042414,0.00024615665,0.00085258257,0.00022864835,0.00008329957,0.00010525324,0.0001971762,0.5960516,0.006203292,0.0549224,0.0023109254,0.33839443],"study_design_scores_gemma":[0.000046631398,0.000077776946,0.00006145931,0.000018322402,0.000015120111,0.000027940083,0.000025221503,0.986452,0.0020878594,0.009841318,0.0013366627,0.000009660873],"about_ca_topic_score_codex":0.004237058,"about_ca_topic_score_gemma":0.0051154103,"teacher_disagreement_score":0.00535127,"about_ca_system_score_codex":0.00070353755,"about_ca_system_score_gemma":0.0021071085,"threshold_uncertainty_score":0.017901778},"labels":[],"label_agreement":null},{"id":"W3199114070","doi":"10.1007/s00366-021-01487-4","title":"An improved Chaotic Harris Hawks Optimizer for solving numerical and engineering optimization problems","year":2021,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Maxima and minima; Chaotic; Mathematical optimization; Convergence (economics); Heuristics; Particle swarm optimization; Mathematics; Algorithm; Engineering optimization; Metaheuristic; Engineering design process; Computer science; Optimization problem; Engineering; Artificial intelligence","score_opus":0.008656017236220927,"score_gpt":0.21614573020336264,"score_spread":0.20748971296714172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199114070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06716018,0.00071321795,0.9176396,0.00019713314,0.00028540214,0.00011932067,0.00007143006,0.0006294396,0.01318427],"genre_scores_gemma":[0.61069673,0.0003466437,0.37785664,0.0002491983,0.00013711039,0.00029017826,0.00016299942,0.00017682217,0.0100837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982905,0.0000489196,0.000008557548,0.000023665405,0.000070876245,0.000018792518],"domain_scores_gemma":[0.9998394,0.000053880416,0.000015974512,0.000018835863,0.000052602074,0.000019335283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045719734,0.0006076791,0.000939068,0.00035382074,0.00039025754,0.00050646963,0.0010044785,0.0008901373,0.0025497237],"category_scores_gemma":[0.00070534577,0.00032504855,0.00056233513,0.0004360799,0.0004410601,0.0003784937,0.0007578419,0.0005911328,0.00046129487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015564852,0.000056191435,0.0004826581,0.00009859854,0.00009032469,0.0000863249,0.00003996054,0.9301994,0.0074992827,0.008771438,0.0018163312,0.050703846],"study_design_scores_gemma":[0.0000139162385,0.000028650122,0.000055183114,0.0000017693491,0.000006062781,0.000007313152,0.000002056109,0.99879056,0.00030001297,0.00039413586,0.00039719648,0.0000032104776],"about_ca_topic_score_codex":0.0027287365,"about_ca_topic_score_gemma":0.0027031114,"teacher_disagreement_score":0.0027287365,"about_ca_system_score_codex":0.00039711467,"about_ca_system_score_gemma":0.00061596016,"threshold_uncertainty_score":0.008529723},"labels":[],"label_agreement":null},{"id":"W3205411000","doi":"10.1007/978-3-030-70296-0_79","title":"An Adaptive Tribal Topology for Particle Swarm Optimization","year":2021,"lang":"en","type":"book-chapter","venue":"Transactions on computational science and computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Swarm behaviour; Particle swarm optimization; Maxima and minima; Metaheuristic; Multi-swarm optimization; Mathematical optimization; Computer science; Benchmark (surveying); Fitness function; Swarm intelligence; Population; Mathematics; Geography; Genetic algorithm","score_opus":0.0640853099857278,"score_gpt":0.3385461339797257,"score_spread":0.2744608239939979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205411000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005679209,0.0006518128,0.98133135,0.00020821649,0.00038852988,0.00005718821,0.000048848076,0.00030599828,0.011328818],"genre_scores_gemma":[0.26883003,0.0011673095,0.7142273,0.00022647732,0.00025711503,0.00038614255,0.00024435806,0.0003455123,0.014315777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975604,0.00009963692,0.000014447421,0.000025445835,0.00009212985,0.000012377619],"domain_scores_gemma":[0.99961156,0.00013649419,0.000023931305,0.000084122825,0.00010874827,0.000035135065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043418512,0.0005311982,0.0007289113,0.00068159646,0.00061161886,0.0012005783,0.0015944686,0.0013054414,0.004876912],"category_scores_gemma":[0.0022765745,0.0003405717,0.0004885084,0.0010416082,0.00064738747,0.0012492529,0.0014075628,0.0013008912,0.0012463299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001309276,0.000074341144,0.0002712169,0.0001622059,0.00003997879,0.0001191366,0.00009272346,0.7021652,0.0059245126,0.09474633,0.0076552937,0.1886182],"study_design_scores_gemma":[0.000009638997,0.000025793444,0.000035505447,0.000007491167,0.0000036228232,0.000032686607,0.0000073841898,0.9847073,0.00031921433,0.010760038,0.004086115,0.0000052328605],"about_ca_topic_score_codex":0.00084611133,"about_ca_topic_score_gemma":0.0008550558,"teacher_disagreement_score":0.004876912,"about_ca_system_score_codex":0.000317467,"about_ca_system_score_gemma":0.0003327489,"threshold_uncertainty_score":0.016314924},"labels":[],"label_agreement":null},{"id":"W3206167478","doi":"10.1155/2021/6642009","title":"An Improved Ant Colony Optimization Based on an Adaptive Heuristic Factor for the Traveling Salesman Problem","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Travelling salesman problem; Ant colony optimization algorithms; Mathematical optimization; Heuristic; Computer science; Population; Path (computing); Algorithm; Local optimum; Mathematics","score_opus":0.023403336667281678,"score_gpt":0.3020226378480316,"score_spread":0.27861930118074996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206167478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039497957,0.0011431982,0.9485952,0.00024538508,0.00027880626,0.00017730522,0.00007560133,0.0007419201,0.009244584],"genre_scores_gemma":[0.6248742,0.00083977205,0.36820993,0.00023475735,0.00013774533,0.00029616934,0.00025380804,0.00018876547,0.0049649053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994754,0.0001366342,0.000025769281,0.00009420655,0.00019510338,0.000072806695],"domain_scores_gemma":[0.9995229,0.00018018315,0.00005557492,0.00004219478,0.00016323554,0.000035909525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005650198,0.00089144346,0.0010865203,0.0010410675,0.0005074288,0.000700058,0.0014000769,0.0009898518,0.0017424013],"category_scores_gemma":[0.00193186,0.00028857068,0.0010384149,0.0011742467,0.00040593758,0.0008104321,0.0006487024,0.0008443422,0.00036251007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012233506,0.00011434558,0.0012231102,0.00016104273,0.00010713885,0.00019996423,0.000084709754,0.8326376,0.0062722126,0.00890515,0.0040207487,0.14615166],"study_design_scores_gemma":[0.000029556775,0.000045512068,0.0001555841,0.000005249061,0.000016547687,0.000055515495,0.000008864834,0.99666756,0.00046721127,0.00100708,0.0015323637,0.000008839609],"about_ca_topic_score_codex":0.009445408,"about_ca_topic_score_gemma":0.0070754504,"teacher_disagreement_score":0.009445408,"about_ca_system_score_codex":0.00052727934,"about_ca_system_score_gemma":0.0011701403,"threshold_uncertainty_score":0.018780828},"labels":[],"label_agreement":null},{"id":"W3206780878","doi":"10.1115/omae2021-62304","title":"Adaptive Constraint Handling in Optimization of Complex Structures by Using Machine Learning","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Constraint (computer-aided design); Convergence (economics); Multi-objective optimization; Mathematical optimization; Exploit; Artificial neural network; Task (project management); Artificial intelligence; Pareto principle; Optimization problem; Genetic algorithm; Machine learning; Algorithm; Engineering; Mathematics","score_opus":0.05955576062711624,"score_gpt":0.3081879165762,"score_spread":0.24863215594908375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206780878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020749329,0.00018484295,0.9765347,0.00008068916,0.000013556398,0.0000309421,0.000012306334,0.00016516427,0.0022283138],"genre_scores_gemma":[0.7270555,0.00023994487,0.27034485,0.00009451513,0.0000278932,0.0001960251,0.00005322579,0.000062751446,0.0019252596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996044,0.00017437896,0.000018101728,0.000041918454,0.00013099947,0.00003027297],"domain_scores_gemma":[0.9993137,0.00043316314,0.00009558341,0.000055490156,0.000088628716,0.000013491157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008367395,0.00065745035,0.0007170468,0.00048239477,0.00031124218,0.0006671434,0.0006809621,0.0007784991,0.0010422678],"category_scores_gemma":[0.0014561871,0.00035702102,0.00052457134,0.0005333641,0.00057201175,0.000554653,0.00059508625,0.0006624266,0.0001795088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012742828,0.000017816332,0.00019091355,0.000028763303,0.000016769201,0.000021827944,0.000013304907,0.9764023,0.0017174167,0.002036922,0.00010456212,0.019436762],"study_design_scores_gemma":[0.0000018369865,0.000009093643,0.000038479015,0.0000032196367,0.0000015344441,0.0000038116027,0.0000015890593,0.99880874,0.00037564713,0.0005964923,0.00015820163,0.000001458246],"about_ca_topic_score_codex":0.0025867168,"about_ca_topic_score_gemma":0.0024788657,"teacher_disagreement_score":0.0025867168,"about_ca_system_score_codex":0.00048062493,"about_ca_system_score_gemma":0.0005873462,"threshold_uncertainty_score":0.0051433444},"labels":[],"label_agreement":null},{"id":"W3207923187","doi":"10.1007/978-3-030-70296-0_89","title":"Simulated Annealing Embedded Within Personal Velocity Update of Particle Swarm Optimization","year":2021,"lang":"en","type":"book-chapter","venue":"Transactions on computational science and computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Simulated annealing; Particle swarm optimization; Swarm behaviour; Computer science; Materials science; Algorithm; Artificial intelligence","score_opus":0.04466950687585346,"score_gpt":0.30835453249913924,"score_spread":0.2636850256232858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207923187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007882313,0.0005535353,0.9764509,0.00011392829,0.00020508267,0.000028836315,0.000018538502,0.00034795745,0.014398949],"genre_scores_gemma":[0.49834526,0.0008589582,0.47602558,0.00011420851,0.00017264158,0.00015166416,0.000110676534,0.00037211078,0.02384889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978703,0.00007263422,0.000008500003,0.000027375563,0.00009012728,0.000014428013],"domain_scores_gemma":[0.99973315,0.00014241275,0.000018737583,0.000050913444,0.00004440813,0.00001038596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031996073,0.00037727397,0.0006886786,0.00023927973,0.0002942928,0.00073438144,0.0007425868,0.0009223783,0.0031716723],"category_scores_gemma":[0.0012596941,0.00034677307,0.00039815292,0.00056773383,0.00049020397,0.0007350676,0.0006938653,0.0011027193,0.0008409375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005740894,0.00003959859,0.00018363436,0.000058095797,0.00003461227,0.00003620944,0.00006890703,0.8633159,0.004339735,0.046477973,0.002034898,0.08335299],"study_design_scores_gemma":[0.0000025720535,0.0000102703625,0.000038152335,0.0000036564202,0.0000031889704,0.000006631184,0.0000028435386,0.99336916,0.0005319936,0.0041082534,0.0019210655,0.0000022420375],"about_ca_topic_score_codex":0.0020273516,"about_ca_topic_score_gemma":0.0020112724,"teacher_disagreement_score":0.0031716723,"about_ca_system_score_codex":0.0004003318,"about_ca_system_score_gemma":0.00047385498,"threshold_uncertainty_score":0.010610342},"labels":[],"label_agreement":null},{"id":"W3207992307","doi":"10.1109/ccece53047.2021.9569035","title":"A Multi-Agent Krill Herd Algorithm","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Benchmark (surveying); Computer science; Metaheuristic; Multi-agent system; Algorithm; Task (project management); Mathematical optimization; Krill; Artificial intelligence; Mathematics; Engineering","score_opus":0.04246127212241364,"score_gpt":0.3131368173121361,"score_spread":0.2706755451897225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207992307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021588195,0.0006653573,0.96769005,0.00035188516,0.00010901986,0.00013587838,0.00008790136,0.00053587125,0.008835863],"genre_scores_gemma":[0.4043469,0.0004141513,0.585147,0.0003364152,0.000060727274,0.0003164967,0.00029128694,0.00012294912,0.00896399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962676,0.00008768688,0.000019932637,0.00007663511,0.00012624286,0.00006279734],"domain_scores_gemma":[0.9997404,0.00008761134,0.00004242567,0.00003502293,0.000066521774,0.000028002905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059188466,0.0005851324,0.0011321596,0.0006542584,0.0006952785,0.00081345375,0.0022387945,0.0015071651,0.003323892],"category_scores_gemma":[0.0011474818,0.00036735676,0.00072661525,0.00067311036,0.00043107232,0.0010255909,0.001147642,0.00079128373,0.00058582745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012324852,0.00010919297,0.0014808411,0.00009333039,0.00014370843,0.00011765302,0.00009794064,0.79564774,0.005072909,0.023510033,0.005609648,0.1679938],"study_design_scores_gemma":[0.00002833515,0.000033478824,0.0001263021,0.0000066314783,0.000015402673,0.0000316888,0.000010711716,0.9949511,0.0004398195,0.0019771664,0.0023723857,0.000007024144],"about_ca_topic_score_codex":0.0051551093,"about_ca_topic_score_gemma":0.005541047,"teacher_disagreement_score":0.0051551093,"about_ca_system_score_codex":0.0007139314,"about_ca_system_score_gemma":0.0013646284,"threshold_uncertainty_score":0.011119485},"labels":[],"label_agreement":null},{"id":"W3208187808","doi":"10.1109/esscirc53450.2021.9567809","title":"The Power of Parallelism in Stochastic Search for Global Optimum: Keynote Paper","year":2021,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Parallelism (grammar); Computer science; Local optimum; Markov chain Monte Carlo; Population; Mathematical optimization; Parallel computing; Markov chain; Parallel tempering; Data parallelism; Hamming distance; Algorithm; Mathematics; Artificial intelligence; Machine learning; Bayesian probability","score_opus":0.02712710892445458,"score_gpt":0.3225874359842625,"score_spread":0.2954603270598079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208187808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04964309,0.004132482,0.91002285,0.0047907517,0.0006997941,0.00004920256,0.000054305227,0.00035778168,0.030249713],"genre_scores_gemma":[0.8097447,0.0035014525,0.17337678,0.00085285224,0.0009182668,0.00010474256,0.000094694915,0.00036544318,0.011041044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926394,0.00032092258,0.000017642562,0.0001334789,0.00020019563,0.00006379188],"domain_scores_gemma":[0.9980976,0.00136836,0.00010293081,0.00021775349,0.00013803501,0.000075356504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015019629,0.00041845406,0.0005549679,0.0003610477,0.00063987594,0.0016171526,0.0005866287,0.00057852885,0.004393744],"category_scores_gemma":[0.0057651806,0.0003082781,0.0005206299,0.000664434,0.0014621628,0.001951461,0.0013710343,0.0013333046,0.00068179396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020051724,0.000103666476,0.0014233665,0.00020394762,0.00012594949,0.00018329345,0.0002057909,0.49354914,0.0046179546,0.3951084,0.008182337,0.09609568],"study_design_scores_gemma":[0.000042787193,0.000112316106,0.0002527139,0.00003417235,0.000026674817,0.00007527656,0.000034008914,0.556628,0.0020219705,0.4285407,0.012213091,0.000018193663],"about_ca_topic_score_codex":0.0008609364,"about_ca_topic_score_gemma":0.00087495317,"teacher_disagreement_score":0.004393744,"about_ca_system_score_codex":0.00047817169,"about_ca_system_score_gemma":0.00068591937,"threshold_uncertainty_score":0.014698565},"labels":[],"label_agreement":null},{"id":"W3210481527","doi":"10.1155/2021/5538296","title":"Speed Proportional Integrative Derivative Controller: Optimization Functions in Metaheuristic Algorithms","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Politécnica de Madrid; Comunidad de Madrid","keywords":"Metaheuristic; Computer science; PID controller; Mathematical optimization; Fitness function; Algorithm; Function (biology); Optimization problem; Controller (irrigation); Mathematics; Control engineering; Engineering; Genetic algorithm","score_opus":0.015592075538055914,"score_gpt":0.2863815943135784,"score_spread":0.2707895187755225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210481527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00846074,0.00096890924,0.98690736,0.00015708197,0.000043431348,0.00004494049,0.000020270643,0.00019789494,0.0031994171],"genre_scores_gemma":[0.33272752,0.0018496027,0.6608748,0.00021008983,0.00010976497,0.0003544698,0.000089939735,0.00019485541,0.003588942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945766,0.00023228266,0.00003211273,0.00006431853,0.0001886301,0.000024921419],"domain_scores_gemma":[0.9993855,0.00038551088,0.00006257017,0.000048977705,0.00010384522,0.000013611206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001586823,0.0010391412,0.0007084599,0.0010276801,0.00031025743,0.0009715271,0.000816661,0.0010720774,0.001183504],"category_scores_gemma":[0.0028874096,0.00026891578,0.00065462705,0.0014146038,0.000782533,0.0009477608,0.0005050135,0.0011323419,0.00024319181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041214902,0.00006208303,0.0006492507,0.00022732884,0.00007972827,0.00003471695,0.00007574561,0.8252031,0.0034659195,0.046428364,0.0008367288,0.1228958],"study_design_scores_gemma":[0.000008770965,0.000038822218,0.00015948484,0.000023564793,0.000014609,0.000021836084,0.000010165787,0.9889137,0.0012660375,0.0073549408,0.002179891,0.000008120578],"about_ca_topic_score_codex":0.0017567505,"about_ca_topic_score_gemma":0.00096988044,"teacher_disagreement_score":0.0017567505,"about_ca_system_score_codex":0.0008113849,"about_ca_system_score_gemma":0.00062737876,"threshold_uncertainty_score":0.008392036},"labels":[],"label_agreement":null},{"id":"W3212356453","doi":"","title":"Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms","year":2021,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Stochastic gradient descent; Ergodic theory; Generalization; Dynamical systems theory; Mathematics; Computer science; Hessian matrix; Fractal; Artificial neural network; Bounded function; Hyperparameter; Invariant measure; Mathematical optimization; Artificial intelligence; Applied mathematics","score_opus":0.015430659584609402,"score_gpt":0.22833262797161744,"score_spread":0.21290196838700803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212356453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34096232,0.0032531212,0.6138521,0.0015654172,0.00023137937,0.000092565126,0.0002354502,0.00042422165,0.03938343],"genre_scores_gemma":[0.9369273,0.0013294753,0.05517244,0.00016249546,0.00032463236,0.00010111255,0.00022865956,0.0001377618,0.0056160307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994647,0.00017665242,0.00003830672,0.000082196144,0.00018220332,0.000055969034],"domain_scores_gemma":[0.99243873,0.0052379793,0.00077442924,0.00050689164,0.0007827275,0.0002593031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013849286,0.0004104655,0.00083693565,0.0018890055,0.00071413995,0.0015520421,0.0004845097,0.0007323477,0.0026166255],"category_scores_gemma":[0.011709448,0.0004081287,0.00087193376,0.0010954333,0.0014193335,0.0016971518,0.00083026534,0.0011935869,0.00020947245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042968448,0.00003136996,0.001704496,0.00009426721,0.000042040865,0.00011243318,0.00015939353,0.17956436,0.00211254,0.79446405,0.0015939029,0.020078106],"study_design_scores_gemma":[0.000015546817,0.000036473524,0.0015525843,0.000027601089,0.000017869666,0.00013383054,0.000024803498,0.7048751,0.00046209284,0.2908736,0.0019646431,0.000015840602],"about_ca_topic_score_codex":0.0014210443,"about_ca_topic_score_gemma":0.00087933434,"teacher_disagreement_score":0.0026166255,"about_ca_system_score_codex":0.001004225,"about_ca_system_score_gemma":0.0005897667,"threshold_uncertainty_score":0.008753419},"labels":[],"label_agreement":null},{"id":"W3213339069","doi":"10.32920/ryerson.14647074.v1","title":"RankGPES: learning to rank for information retrieval using a hybrid genetic programming with evolutionary strategies","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rank (graph theory); Genetic programming; Computer science; Ranking (information retrieval); Learning to rank; Artificial intelligence; Machine learning; Evolutionary algorithm; Evolutionary programming; Genetic algorithm; Mathematics","score_opus":0.028395259418108748,"score_gpt":0.2993532365904498,"score_spread":0.27095797717234105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213339069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022007594,0.00036261106,0.97279155,0.0003735964,0.00008179328,0.00015670205,0.00007524903,0.00090174866,0.0032491495],"genre_scores_gemma":[0.2763277,0.00030822083,0.7154492,0.0004749527,0.000114105795,0.00041301557,0.00027824435,0.00018324179,0.0064513073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915695,0.00032129238,0.000036797992,0.00012459444,0.0002815813,0.00007877251],"domain_scores_gemma":[0.9988895,0.0006997063,0.0000723456,0.00006720489,0.00022599929,0.000045184603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015127374,0.00081110076,0.0011850073,0.001121631,0.00045642245,0.0011269136,0.0013644763,0.0016247181,0.0022983851],"category_scores_gemma":[0.003279281,0.00037367415,0.0007930955,0.0009216281,0.00060120213,0.0011765565,0.0009351448,0.0013832307,0.000587597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103434664,0.00023301881,0.0011935508,0.00012287412,0.000101470054,0.000087603636,0.0000776665,0.66885453,0.0030808642,0.017511433,0.0043301983,0.3043033],"study_design_scores_gemma":[0.000016658934,0.00006314609,0.000079633515,0.000005146577,0.000009108447,0.000019027008,0.000007977936,0.99562436,0.0006709769,0.0027096423,0.0007877654,0.000006656692],"about_ca_topic_score_codex":0.003459969,"about_ca_topic_score_gemma":0.0036204585,"teacher_disagreement_score":0.003459969,"about_ca_system_score_codex":0.00068159576,"about_ca_system_score_gemma":0.0012233998,"threshold_uncertainty_score":0.008000195},"labels":[],"label_agreement":null},{"id":"W3213436692","doi":"10.5267/j.dsl.2021.8.004","title":"Binary social group optimization algorithm for solving 0-1 knapsack problem","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Continuous knapsack problem; Binary number; Algorithm; Mathematical optimization; Optimization problem; Group (periodic table); Mathematics; Transformation (genetics); Continuous optimization; Polynomial-time approximation scheme; Computer science; Multi-swarm optimization","score_opus":0.029899433794663356,"score_gpt":0.31840861658667674,"score_spread":0.2885091827920134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213436692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012452399,0.00038758045,0.9794993,0.00020987951,0.00009683415,0.00011712185,0.00004255251,0.0002170833,0.0069772736],"genre_scores_gemma":[0.28177896,0.00047615694,0.7102697,0.0002837036,0.00007306059,0.0005442303,0.00030680175,0.00010836268,0.006159097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999046,0.00035156016,0.000041979267,0.000103197366,0.00036178608,0.00009543404],"domain_scores_gemma":[0.9995592,0.00018027272,0.000068658665,0.00003614381,0.00012779009,0.000028010143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011565986,0.00088808377,0.00083182065,0.0010166769,0.000654134,0.0007240708,0.0010855016,0.0010892199,0.0037936806],"category_scores_gemma":[0.0018911392,0.00026381394,0.000566061,0.0010389739,0.00057049864,0.0010243411,0.0011172513,0.0008964882,0.0008147481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028202485,0.00020040864,0.001329931,0.0003640266,0.00009889039,0.00008574924,0.00018468428,0.65497476,0.0055310363,0.052849125,0.006081715,0.2780176],"study_design_scores_gemma":[0.00006151855,0.0001306722,0.00024269227,0.000027266064,0.000016310714,0.00005042409,0.00004705361,0.9780683,0.00158562,0.0154996775,0.004255273,0.000015280208],"about_ca_topic_score_codex":0.0023684516,"about_ca_topic_score_gemma":0.0018806037,"teacher_disagreement_score":0.0037936806,"about_ca_system_score_codex":0.0004859829,"about_ca_system_score_gemma":0.0010159058,"threshold_uncertainty_score":0.01269114},"labels":[],"label_agreement":null},{"id":"W3217452736","doi":"10.1080/09540091.2021.2002266","title":"A conditional opposition-based particle swarm optimisation for feature selection","year":2021,"lang":"en","type":"article","venue":"Connection Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Particle swarm optimization; Metaheuristic; Computer science; Feature selection; Swarm behaviour; Benchmark (surveying); Artificial intelligence; Feature (linguistics); Machine learning; Selection (genetic algorithm); Multi-swarm optimization; Convergence (economics); Mathematical optimization; Data mining; Mathematics","score_opus":0.0388511532403716,"score_gpt":0.3306135890364989,"score_spread":0.2917624357961273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217452736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017078193,0.00018672759,0.98015577,0.00012873903,0.00005142418,0.00008389129,0.00003243221,0.00022024139,0.0020625098],"genre_scores_gemma":[0.67679894,0.00023497795,0.31863457,0.00021624622,0.00006733365,0.00054740696,0.0002300724,0.0000642504,0.0032062104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993819,0.00021769918,0.000036826255,0.00009789123,0.0002069245,0.00005872429],"domain_scores_gemma":[0.9993272,0.00035816894,0.000060659604,0.00003951429,0.0001850782,0.000029357978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012681246,0.00076777773,0.0009837984,0.00084749307,0.0004167155,0.000824486,0.0012037399,0.0010037472,0.0013630308],"category_scores_gemma":[0.0026333167,0.00034356766,0.00081576424,0.00087539345,0.000605464,0.00057029777,0.0009988173,0.00087057444,0.00021910586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013486714,0.00008609102,0.0011189353,0.00012883871,0.00008214549,0.00010189183,0.00008489892,0.8949704,0.004963456,0.0077404818,0.0014010675,0.08918687],"study_design_scores_gemma":[0.000010444676,0.000027082904,0.0000963186,0.000003434986,0.000005878241,0.00001029303,0.0000033358083,0.99876815,0.00037632496,0.00047674688,0.00021864356,0.000003296665],"about_ca_topic_score_codex":0.0029930891,"about_ca_topic_score_gemma":0.0019242082,"teacher_disagreement_score":0.0029930891,"about_ca_system_score_codex":0.0005194281,"about_ca_system_score_gemma":0.0008914631,"threshold_uncertainty_score":0.006706536},"labels":[],"label_agreement":null},{"id":"W34283273","doi":"10.1007/s00484-021-02167-0","title":"Classification system optimization with multi-objective genetic algorithms","year":2006,"lang":"en","type":"article","venue":"International Conference on Frontiers in Handwriting Recognition","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Feature extraction; Pattern recognition (psychology); Genetic algorithm; Statistical classification; Machine learning; Random subspace method; Data mining; Algorithm","score_opus":0.04635011991833306,"score_gpt":0.2815833445060461,"score_spread":0.23523322458771306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34283273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018953718,0.0034111785,0.96764016,0.0007354435,0.00023553432,0.00036083712,0.0004237039,0.0018714261,0.006368087],"genre_scores_gemma":[0.40656576,0.001603113,0.5783492,0.00084245607,0.0002211721,0.0024436046,0.0019345535,0.00039173625,0.0076484624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885094,0.00053825584,0.00009079802,0.000239023,0.00011097754,0.00016988917],"domain_scores_gemma":[0.9960007,0.0032042807,0.00017151279,0.000087636596,0.0004753234,0.00006047112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025646933,0.002827013,0.0033373798,0.0020776372,0.00078619126,0.0019528721,0.0023636601,0.003425804,0.007201472],"category_scores_gemma":[0.0052499734,0.0013189724,0.0025676847,0.00205787,0.0008698708,0.0008812089,0.0017969342,0.0024773874,0.001302808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039698414,0.000036396636,0.00033589377,0.00013110031,0.00010926017,0.000038718234,0.000025553609,0.96553457,0.00015906527,0.0012060401,0.0010509848,0.031332754],"study_design_scores_gemma":[0.000012440668,0.000015080294,0.00005583337,0.000013897455,0.000012645645,0.0000035617556,0.0000067401324,0.99837506,0.000045560788,0.0011640725,0.00029178194,0.0000033837741],"about_ca_topic_score_codex":0.020340955,"about_ca_topic_score_gemma":0.012658046,"teacher_disagreement_score":0.020340955,"about_ca_system_score_codex":0.001389536,"about_ca_system_score_gemma":0.0029150888,"threshold_uncertainty_score":0.04044509},"labels":[],"label_agreement":null},{"id":"W36751344","doi":"10.1007/978-3-642-37192-9_20","title":"On the Utility of Trading Criteria Based Retraining in Forex Markets","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Retraining; Foreign exchange market; Business; Foreign exchange; Computer science; Financial economics; Economics; Monetary economics; International trade","score_opus":0.048440032444271454,"score_gpt":0.2936856222458886,"score_spread":0.24524558980161718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36751344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33656064,0.009084823,0.6213225,0.0038470367,0.00062468665,0.0001845993,0.00014960073,0.0008555107,0.027370581],"genre_scores_gemma":[0.9548903,0.0008510177,0.03708775,0.0003434739,0.00021236928,0.00004199215,0.00007653997,0.00013254833,0.006364046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880266,0.000683044,0.00005880129,0.00011657133,0.00019469408,0.0001442831],"domain_scores_gemma":[0.98435694,0.01361673,0.00042766213,0.0005915148,0.000726129,0.0002809707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065949773,0.0011401615,0.0017849054,0.0005779653,0.00065974507,0.0015860677,0.0023633083,0.0019330069,0.0039966456],"category_scores_gemma":[0.026945002,0.00037749088,0.00048929197,0.0006045036,0.0013754442,0.0030902647,0.0012847424,0.0026527024,0.00029559052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014892663,0.00045664338,0.001950509,0.00022191198,0.00012703243,0.00022552742,0.0001353582,0.7883879,0.0015909702,0.05990394,0.005111082,0.14039987],"study_design_scores_gemma":[0.000031194228,0.00010226964,0.00023528513,0.000020083293,0.000019289175,0.000026454587,0.000017259334,0.9799534,0.00034750343,0.019052545,0.00018768712,0.000006976934],"about_ca_topic_score_codex":0.002896168,"about_ca_topic_score_gemma":0.0018733401,"teacher_disagreement_score":0.0065949773,"about_ca_system_score_codex":0.00077472365,"about_ca_system_score_gemma":0.0010117418,"threshold_uncertainty_score":0.034877956},"labels":[],"label_agreement":null},{"id":"W404655571","doi":"10.1007/s00500-015-1716-3","title":"Novel self-adaptive particle swarm optimization methods","year":2015,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Swarm behaviour; Particle swarm optimization; Multi-swarm optimization; Computer science; Metaheuristic; Mathematical optimization; Premature convergence; Algorithm; Mathematics; Artificial intelligence","score_opus":0.09085828163086822,"score_gpt":0.37004264148158894,"score_spread":0.2791843598507207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W404655571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007531333,0.0004463514,0.9837082,0.00016655566,0.00023608463,0.000047401092,0.000019867874,0.00016031438,0.007683988],"genre_scores_gemma":[0.23669632,0.00075525464,0.74664843,0.00027240076,0.00029020675,0.0003400387,0.0001168288,0.00015017462,0.014730356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968433,0.000090968555,0.000018026649,0.000036968213,0.00015158282,0.000018164257],"domain_scores_gemma":[0.99947506,0.00021683592,0.000052413077,0.000060956878,0.0001665789,0.000028207294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835149,0.0006197002,0.0006450499,0.000578092,0.00042552446,0.00092937035,0.0012380435,0.0011362864,0.0028684882],"category_scores_gemma":[0.0018594045,0.00036116407,0.00056786643,0.0006850489,0.0004500937,0.000903334,0.0009426583,0.00085067673,0.000796048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015659918,0.00019143622,0.0011727031,0.00029933074,0.00018330537,0.0001387106,0.00013917238,0.56138414,0.00856726,0.09359535,0.0075064087,0.32666558],"study_design_scores_gemma":[0.000012679252,0.000018007657,0.00006682666,0.000005795957,0.000007645775,0.000020013458,0.0000041165467,0.9947208,0.00042451208,0.0031289218,0.0015865535,0.000004114192],"about_ca_topic_score_codex":0.0007526001,"about_ca_topic_score_gemma":0.0011396958,"teacher_disagreement_score":0.0028684882,"about_ca_system_score_codex":0.00029898458,"about_ca_system_score_gemma":0.0005087451,"threshold_uncertainty_score":0.00959599},"labels":[],"label_agreement":null},{"id":"W4200615498","doi":"10.1002/9781119794929.ch8","title":"Incorporating LP and Hybridizing It with Meta‐heuristic Algorithms","year":2021,"lang":"en","type":"other","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Heuristic; Linear programming; Convergence (economics); Algorithm; Meta heuristic; Mathematical optimization; Evolutionary algorithm; Computer science; Rate of convergence; Mathematics","score_opus":0.05414899837175338,"score_gpt":0.29534885222674084,"score_spread":0.24119985385498746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200615498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008353015,0.0009041492,0.9745026,0.00023848719,0.000097848446,0.000051852217,0.000029710045,0.00070667965,0.015115637],"genre_scores_gemma":[0.366058,0.001709241,0.6231305,0.0002972953,0.0001447076,0.0003282196,0.00016002923,0.00036417675,0.0078079803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995204,0.00020933717,0.000026698506,0.00006563521,0.00013361723,0.000044377302],"domain_scores_gemma":[0.9992428,0.00044477283,0.000054626555,0.00012525138,0.00011170172,0.000020787658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012096963,0.0010187931,0.0007020192,0.0010646326,0.0003044835,0.0018037887,0.0012075854,0.0010611234,0.003148265],"category_scores_gemma":[0.0022905052,0.0005300546,0.0009106324,0.0013261479,0.00055531744,0.0015609828,0.0011819015,0.0012686562,0.0010907869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041865525,0.00006779386,0.0005379658,0.00017735764,0.0001113233,0.0000935193,0.00006953026,0.8471301,0.0033897834,0.026551878,0.0011128385,0.12071608],"study_design_scores_gemma":[0.000009292984,0.000034755743,0.00008205023,0.000026238939,0.000027338692,0.000030878953,0.000017125829,0.9825431,0.0013171138,0.011712128,0.0041902484,0.000009888141],"about_ca_topic_score_codex":0.0017802175,"about_ca_topic_score_gemma":0.0017058143,"teacher_disagreement_score":0.003148265,"about_ca_system_score_codex":0.00050165533,"about_ca_system_score_gemma":0.00065178826,"threshold_uncertainty_score":0.010531962},"labels":[],"label_agreement":null},{"id":"W4205998440","doi":"10.5267/j.ijiec.2021.11.001","title":"A new hybrid algorithm based on MVO and SA for function optimization","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Benchmark (surveying); Hybrid algorithm (constraint satisfaction); Algorithm; Metaheuristic; Optimization algorithm; Computer science; Mathematical optimization; Mathematics","score_opus":0.030199681041480582,"score_gpt":0.27547507868005605,"score_spread":0.24527539763857548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205998440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016865974,0.0010343195,0.9754564,0.00012146407,0.00014924273,0.00007957798,0.00007301796,0.00058219966,0.005637897],"genre_scores_gemma":[0.29409003,0.0006666216,0.6974197,0.00023393011,0.000098355864,0.00044430402,0.00042257956,0.00018749101,0.006437061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.00010677618,0.000026225485,0.00008304499,0.00017257199,0.000040697498],"domain_scores_gemma":[0.999746,0.00010895942,0.000030140243,0.00003546048,0.000062136525,0.000017297243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754563,0.0007944968,0.0010562481,0.0010934122,0.00039585924,0.00079683436,0.0012682714,0.00096362166,0.0017996097],"category_scores_gemma":[0.0010540828,0.00038161117,0.0011942151,0.0010870668,0.0003815268,0.00084021053,0.00087427394,0.00074743154,0.0003431449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015368703,0.00010938505,0.00173051,0.00027110678,0.00030317155,0.00009327458,0.00010858889,0.6129595,0.01589234,0.023425391,0.0029695856,0.3419835],"study_design_scores_gemma":[0.000040219136,0.00011677627,0.0003471848,0.000021359225,0.00003285133,0.000076160584,0.00001761238,0.9865459,0.0021703977,0.004137387,0.006477411,0.000016637834],"about_ca_topic_score_codex":0.002065302,"about_ca_topic_score_gemma":0.002464546,"teacher_disagreement_score":0.002065302,"about_ca_system_score_codex":0.0004075601,"about_ca_system_score_gemma":0.00070301007,"threshold_uncertainty_score":0.0060203075},"labels":[],"label_agreement":null},{"id":"W4206995338","doi":"10.1090/mbk/139/32","title":"The Pollard Rho factorisaction algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Algorithm","score_opus":0.02215236016215544,"score_gpt":0.2742301322675225,"score_spread":0.2520777721053671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206995338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046662968,0.0013382066,0.9485974,0.0003524878,0.00035806478,0.00012827104,0.00010255979,0.00095692417,0.04349973],"genre_scores_gemma":[0.099220216,0.0012960702,0.8413752,0.00050120795,0.00019009237,0.0004560107,0.0004053187,0.00075731764,0.055798676],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927384,0.00022782297,0.00002664154,0.00014460029,0.00022947256,0.0000976672],"domain_scores_gemma":[0.9995084,0.00021010224,0.000023621158,0.00010705225,0.00012437324,0.000026504593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010844475,0.0012956507,0.0014721748,0.001341756,0.0010271271,0.002028526,0.0019860363,0.0017495537,0.017557716],"category_scores_gemma":[0.0039391564,0.00059425813,0.0011282003,0.0017110672,0.0011342278,0.0015675565,0.0019871045,0.0021262022,0.005102812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018494495,0.00008186261,0.00035117744,0.00019145772,0.00007662271,0.00007776005,0.00011858349,0.17156693,0.0023710842,0.15300114,0.028179916,0.6437984],"study_design_scores_gemma":[0.00009355323,0.00011036234,0.0002516428,0.00008517583,0.00005114921,0.00014265082,0.00004954942,0.83284914,0.002593644,0.097716264,0.066012226,0.000044692082],"about_ca_topic_score_codex":0.006470555,"about_ca_topic_score_gemma":0.005438981,"teacher_disagreement_score":0.017557716,"about_ca_system_score_codex":0.00090587756,"about_ca_system_score_gemma":0.0021066943,"threshold_uncertainty_score":0.058736384},"labels":[],"label_agreement":null},{"id":"W4207030585","doi":"10.36227/techrxiv.16860049.v1","title":"Adaptability of Improved NEAT in Variable Environments","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Python (programming language); Adaptability; Computer science; Programming language; Management","score_opus":0.024624348800726014,"score_gpt":0.26988654375425397,"score_spread":0.24526219495352797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207030585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82037866,0.00046981318,0.14538029,0.0008147417,0.0001607926,0.00041367026,0.0004847451,0.0006606225,0.031236654],"genre_scores_gemma":[0.9673487,0.0000823481,0.030419141,0.00009028589,0.000009424366,0.00020303013,0.00013371248,0.000076471624,0.0016368077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785334,0.0011635219,0.00008875394,0.0002918381,0.00042434508,0.00017827564],"domain_scores_gemma":[0.9936692,0.004162665,0.00040652615,0.0008645814,0.0006044668,0.00029254422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028805018,0.0004636463,0.0003853712,0.00036645783,0.0006626706,0.0011357842,0.0010426571,0.00076163135,0.004262995],"category_scores_gemma":[0.015105104,0.00017699474,0.0004204253,0.00037664163,0.001370884,0.0016249756,0.0015321778,0.0008357208,0.000492916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015035511,0.0009934298,0.018775195,0.002098496,0.00026100405,0.0014388133,0.008805952,0.6345401,0.08085743,0.03663734,0.007906329,0.20618235],"study_design_scores_gemma":[0.00034174026,0.0031057447,0.028381443,0.00050658616,0.00017481772,0.0010608623,0.0077129304,0.80167806,0.054863326,0.06185156,0.03997509,0.000347771],"about_ca_topic_score_codex":0.0006225998,"about_ca_topic_score_gemma":0.00080633175,"teacher_disagreement_score":0.004262995,"about_ca_system_score_codex":0.0006529145,"about_ca_system_score_gemma":0.00053793745,"threshold_uncertainty_score":0.0152336955},"labels":[],"label_agreement":null},{"id":"W4207051291","doi":"10.36227/techrxiv.16860049","title":"Adaptability of Improved NEAT in Variable Environments","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Python (programming language); Adaptability; Computer science; Research data; Data science; Programming language; Biology; Ecology","score_opus":0.024624348800726014,"score_gpt":0.26988654375425397,"score_spread":0.24526219495352797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207051291","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8188173,0.00052694284,0.14625633,0.0008499744,0.00018004455,0.00039915153,0.00051531923,0.0006897233,0.031765122],"genre_scores_gemma":[0.9678648,0.000088013534,0.029856766,0.00009580411,0.000010531836,0.00019954899,0.00014637753,0.000083614366,0.0016546815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794954,0.0010817678,0.0000871259,0.00029496723,0.00040978027,0.00017685186],"domain_scores_gemma":[0.99356306,0.0042600343,0.00040443314,0.0008709557,0.0005992945,0.00030217477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027364125,0.000485866,0.0003995249,0.00036893747,0.00065574696,0.0011490099,0.00102219,0.0007794303,0.004525806],"category_scores_gemma":[0.015363524,0.00018048502,0.00042958098,0.00037621948,0.0013397402,0.0016650931,0.0015426846,0.00086438004,0.00052826863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014415038,0.0009527009,0.01784995,0.0020326048,0.00026273902,0.0013666613,0.007396709,0.6557336,0.07631589,0.035344098,0.007969738,0.19333376],"study_design_scores_gemma":[0.0003282129,0.0028871815,0.026409373,0.0004942622,0.00017086932,0.0010129531,0.006544996,0.8097742,0.051039193,0.06261492,0.03838509,0.00033878424],"about_ca_topic_score_codex":0.0006187632,"about_ca_topic_score_gemma":0.00080506917,"teacher_disagreement_score":0.004525806,"about_ca_system_score_codex":0.000627685,"about_ca_system_score_gemma":0.0005208687,"threshold_uncertainty_score":0.015140355},"labels":[],"label_agreement":null},{"id":"W4210373550","doi":"10.1155/2022/8858756","title":"The Train Delay Model Developed by the Genetic Programming Algorithm","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; European Regional Development Fund; Univerzita Pardubice","keywords":"Genetic programming; Algorithm; Symbolic regression; Genetic algorithm; Computer science; A priori and a posteriori; Function (biology); Exponential function; Mathematical optimization; Machine learning; Mathematics","score_opus":0.01738930336743416,"score_gpt":0.28013132535090934,"score_spread":0.2627420219834752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210373550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073286686,0.00011454595,0.9881677,0.000120248216,0.000033031036,0.000029981546,0.00005999389,0.00015055516,0.0039952453],"genre_scores_gemma":[0.50890046,0.00072739425,0.47145537,0.00016594758,0.00006809755,0.0005638542,0.0003891265,0.00016394499,0.017565714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996239,0.000104670784,0.000012814061,0.000098969016,0.000119234246,0.00004034141],"domain_scores_gemma":[0.9996419,0.0002034172,0.000027393786,0.000019327961,0.0000960154,0.000011893606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063333486,0.0006435651,0.00060166296,0.00077492045,0.00038726028,0.0008733431,0.0010513308,0.0009787519,0.0021616707],"category_scores_gemma":[0.0021716303,0.0003531518,0.0006536507,0.0012439769,0.0005605021,0.0008723414,0.00050622365,0.0012099089,0.0004913819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106021025,0.000008377855,0.00021138767,0.00001206494,0.000012246535,0.00002076288,0.00001882711,0.96800196,0.0002721236,0.015106816,0.00033647928,0.01598833],"study_design_scores_gemma":[0.0000022232673,0.0000057225047,0.000040408817,0.0000027978613,0.000002551547,0.0000068287563,0.0000019290217,0.9947384,0.00011650782,0.004581068,0.00049895945,0.000002543908],"about_ca_topic_score_codex":0.014841566,"about_ca_topic_score_gemma":0.0057465783,"teacher_disagreement_score":0.014841566,"about_ca_system_score_codex":0.0010029944,"about_ca_system_score_gemma":0.0014399037,"threshold_uncertainty_score":0.02951032},"labels":[],"label_agreement":null},{"id":"W4220855481","doi":"10.1007/s00366-021-01591-5","title":"A boosted chimp optimizer for numerical and engineering design optimization challenges","year":2022,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Mitacs; Simon Fraser University; University of Calgary","keywords":"Benchmark (surveying); Maxima and minima; Mathematical optimization; Convergence (economics); Dimension (graph theory); Global optimization; Computer science; Optimization problem; Algorithm; Mathematics","score_opus":0.02153520288673531,"score_gpt":0.21542051356170663,"score_spread":0.19388531067497133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220855481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011580515,0.00036769698,0.96665543,0.00041868348,0.0003063706,0.00012052909,0.00011295774,0.0023494025,0.01808842],"genre_scores_gemma":[0.24441919,0.00035531123,0.7424221,0.00053047447,0.00024356385,0.00033716246,0.00020669734,0.0006714785,0.01081406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996613,0.00009222537,0.000009566458,0.00004000073,0.00017217139,0.000024668258],"domain_scores_gemma":[0.99968696,0.00010800803,0.000018526962,0.00006469918,0.00008819874,0.000033699696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006997068,0.00076878176,0.0010192911,0.00047033303,0.00057688606,0.0008719831,0.0015318758,0.0013376419,0.0083805565],"category_scores_gemma":[0.0015393837,0.0005857825,0.00075395324,0.00048239058,0.00049437204,0.00061737775,0.0015292154,0.0019050908,0.0024523605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017446915,0.00011363138,0.00047247222,0.00017621272,0.000083858635,0.00013874004,0.000042690597,0.82470095,0.013923525,0.030126072,0.0067171454,0.12333027],"study_design_scores_gemma":[0.000014142466,0.000025987305,0.000043200977,0.0000053235167,0.0000060404745,0.000013072012,0.0000027285505,0.99349713,0.00067272683,0.003022609,0.0026927504,0.0000043091627],"about_ca_topic_score_codex":0.0017954465,"about_ca_topic_score_gemma":0.0024213376,"teacher_disagreement_score":0.0083805565,"about_ca_system_score_codex":0.00037575027,"about_ca_system_score_gemma":0.00095969887,"threshold_uncertainty_score":0.02803576},"labels":[],"label_agreement":null},{"id":"W4220924655","doi":"10.1155/2022/9864064","title":"Corrigendum to “The Fourth-Party Logistics Routing Problem Using Ant Colony System-Improved Grey Wolf Optimization”","year":2022,"lang":"en","type":"erratum","venue":"Journal of Advanced Transportation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Section (typography); Table (database); Adjacency list; Function (biology); Ant colony optimization algorithms; Routing (electronic design automation); Combinatorics; Mathematics; Computer science; Algorithm; Data mining","score_opus":0.03257004666300837,"score_gpt":0.2868427415935368,"score_spread":0.2542726949305284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220924655","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032574724,0.002268537,0.0060684048,0.041871272,0.9281872,0.00008011046,0.0015309888,0.0007044537,0.018963333],"genre_scores_gemma":[0.017511688,0.008652519,0.0141635435,0.04511028,0.13339853,0.0002830821,0.004914561,0.0020627386,0.77390313],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99738055,0.00048211653,0.00025390254,0.0003775867,0.0013277382,0.00017812915],"domain_scores_gemma":[0.985148,0.0022800597,0.00032551592,0.00066703075,0.011126169,0.00045327775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00178916,0.001747893,0.0018322374,0.0027837285,0.0023435415,0.0029798965,0.0026316766,0.0034783746,0.13488999],"category_scores_gemma":[0.021735296,0.00063903973,0.0016363817,0.0027586836,0.001299016,0.0020135324,0.0017083229,0.0046763993,0.06428608],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021680504,0.000006199673,0.00003580994,0.00008441818,0.0000057776947,0.000083887215,0.00001201642,0.00020476179,0.0000640969,0.001535269,0.9919952,0.0059508267],"study_design_scores_gemma":[0.000021547692,0.000033051405,0.0005433406,0.00013876865,0.000028576153,0.0002131426,0.000049277365,0.002504789,0.00060676946,0.003177247,0.99264234,0.00004114719],"about_ca_topic_score_codex":0.03070297,"about_ca_topic_score_gemma":0.041040417,"teacher_disagreement_score":0.13488999,"about_ca_system_score_codex":0.0045305216,"about_ca_system_score_gemma":0.003330288,"threshold_uncertainty_score":0.45125198},"labels":[],"label_agreement":null},{"id":"W4220995982","doi":"10.18280/ria.360101","title":"Enhanced Black Widow Algorithm for Numerical Functions Optimization","year":2022,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Initialization; Crossover; Mathematical optimization; Benchmark (surveying); Metaheuristic; Algorithm; Computer science; Convergence (economics); Local optimum; Mathematics; Artificial intelligence","score_opus":0.04153612484385261,"score_gpt":0.29781834474197355,"score_spread":0.25628221989812094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220995982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003982953,0.0007291754,0.99252594,0.00008257066,0.00005836772,0.0000399058,0.000031157164,0.00023707042,0.0023128153],"genre_scores_gemma":[0.18008575,0.0011707989,0.81204796,0.00016010807,0.00006813041,0.00043763474,0.0002171781,0.00016195198,0.005650548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950993,0.00017160818,0.000025930489,0.000053951037,0.00019615752,0.000042450207],"domain_scores_gemma":[0.9996933,0.00012649386,0.00002981157,0.00003138943,0.00010133628,0.00001775051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008644851,0.00092492515,0.0009337816,0.0010628251,0.00047186314,0.00086860935,0.0013315736,0.0011554995,0.003407148],"category_scores_gemma":[0.0017419087,0.00030811003,0.00094941515,0.0013210098,0.0005330779,0.00090523215,0.0009195589,0.0011325695,0.00081820996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014634221,0.000079619145,0.000757076,0.00019375327,0.00010256494,0.00009210553,0.00008799288,0.73666525,0.007874647,0.04233436,0.0030763014,0.20859],"study_design_scores_gemma":[0.000019202946,0.00003118423,0.00007813292,0.000012881026,0.000007305881,0.000023365646,0.000006100678,0.9907127,0.0010623372,0.0045654885,0.003472846,0.000008502633],"about_ca_topic_score_codex":0.003280313,"about_ca_topic_score_gemma":0.0027293374,"teacher_disagreement_score":0.003407148,"about_ca_system_score_codex":0.00054617494,"about_ca_system_score_gemma":0.001098977,"threshold_uncertainty_score":0.011398077},"labels":[],"label_agreement":null},{"id":"W4224036513","doi":"10.1016/j.aml.2022.108125","title":"A Vanka-type multigrid solver for complex-shifted Laplacian systems from diagonalization-based parallel-in-time algorithms","year":2022,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multigrid method; Solver; Smoothing; Mathematics; Type (biology); Sequence (biology); Algorithm; Laplacian smoothing; Applied mathematics; Laplace operator; Partial differential equation; Mathematical optimization; Mathematical analysis; Finite element method","score_opus":0.03460324402762935,"score_gpt":0.26525686558098854,"score_spread":0.2306536215533592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224036513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005883934,0.000121312805,0.98534966,0.00017897521,0.00020579087,0.00008738558,0.00008462927,0.0006767059,0.0074117403],"genre_scores_gemma":[0.07673784,0.00014240235,0.91448855,0.00014654962,0.00006381912,0.00023546389,0.0003061933,0.0006615788,0.007217591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968386,0.000084763684,0.000017155005,0.000035295994,0.0001497639,0.000029194563],"domain_scores_gemma":[0.9995285,0.00012743312,0.000024576719,0.000077737175,0.00019410023,0.000047622543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044259382,0.00072667276,0.00072776224,0.0006079035,0.0007537428,0.0011703856,0.0016844783,0.0011801049,0.0072181793],"category_scores_gemma":[0.0018692734,0.00044515496,0.00076470326,0.0008354074,0.0006012583,0.00087567547,0.0017653235,0.0017168485,0.0021407043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017978676,0.00031651527,0.00070096756,0.00040265717,0.00014004044,0.00024033592,0.0002915814,0.5210372,0.030473614,0.1746586,0.014902944,0.25665572],"study_design_scores_gemma":[0.000025246078,0.000020437763,0.00005932832,0.000011017694,0.0000067157207,0.000035098543,0.000017083883,0.98007673,0.002303818,0.010943956,0.006487079,0.000013500319],"about_ca_topic_score_codex":0.0036467179,"about_ca_topic_score_gemma":0.006867862,"teacher_disagreement_score":0.0072181793,"about_ca_system_score_codex":0.00047056438,"about_ca_system_score_gemma":0.0016383812,"threshold_uncertainty_score":0.024147213},"labels":[],"label_agreement":null},{"id":"W4225134652","doi":"10.1007/s10898-022-01162-y","title":"Parallel algorithm portfolios with adaptive resource allocation strategy","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"European Social Fund","keywords":"Resource allocation; Mathematical optimization; Process (computing); Algorithm; Computer science; Swarm intelligence; Mathematics; Particle swarm optimization","score_opus":0.01724348718280352,"score_gpt":0.2643682714715833,"score_spread":0.2471247842887798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225134652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03466903,0.00042612036,0.9520418,0.00030322978,0.00015862798,0.00014000901,0.000060676448,0.0003564927,0.01184399],"genre_scores_gemma":[0.6375605,0.00039958852,0.34932423,0.00021310685,0.00017376697,0.00042689,0.00015959596,0.00009652743,0.011645859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928254,0.0002975756,0.000030852163,0.000102241785,0.0001905096,0.000096335774],"domain_scores_gemma":[0.99927527,0.00031872917,0.000067551686,0.000116416464,0.00017165316,0.00005041566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011832443,0.00067622325,0.0010545423,0.00065854087,0.00043574895,0.0010462835,0.0011619781,0.0009798971,0.0034839804],"category_scores_gemma":[0.0032589578,0.00042731847,0.00052597874,0.0010555333,0.0003481997,0.0010527711,0.0009952693,0.00081821816,0.0007666094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020706882,0.00019834012,0.0007077338,0.00006441298,0.0000915013,0.00010385518,0.00002440869,0.8486913,0.0022316745,0.025025584,0.0033742345,0.11928001],"study_design_scores_gemma":[0.000027903572,0.00006299235,0.000095746946,0.0000036990011,0.000013866011,0.000033836306,0.0000046041923,0.9905828,0.00045341367,0.007956785,0.000761074,0.00000323841],"about_ca_topic_score_codex":0.0008423253,"about_ca_topic_score_gemma":0.00083129335,"teacher_disagreement_score":0.0034839804,"about_ca_system_score_codex":0.0004970469,"about_ca_system_score_gemma":0.0009321265,"threshold_uncertainty_score":0.011655092},"labels":[],"label_agreement":null},{"id":"W4225154779","doi":"10.1162/evco_a_00311","title":"Active Sets for Explicitly Constrained Evolutionary Optimization","year":2022,"lang":"en","type":"article","venue":"Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Set (abstract data type); Active set method; Computer science; Mathematical optimization; Evolutionary algorithm; Optimization problem; Black box; Constrained optimization problem; Evolution strategy; Mathematics; Algorithm; Artificial intelligence; Nonlinear programming","score_opus":0.029664006408876446,"score_gpt":0.3041633975792627,"score_spread":0.27449939117038624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225154779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047454896,0.0005063246,0.9954482,0.00013961525,0.000061282284,0.000038336235,0.000031227923,0.00012848729,0.0031720418],"genre_scores_gemma":[0.08734869,0.0021533591,0.89986867,0.00043870416,0.00022998021,0.0010965879,0.00029574742,0.00038537217,0.008182908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987727,0.0005676965,0.00006547511,0.00010236597,0.00044867012,0.0000430666],"domain_scores_gemma":[0.99710995,0.0021770408,0.00017719921,0.0002175953,0.00025919802,0.000058956575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022523669,0.0017595633,0.0013493288,0.0013221408,0.0006699357,0.0019927705,0.0021135763,0.0027099783,0.009744567],"category_scores_gemma":[0.0070992983,0.00077833707,0.0013727276,0.0016423349,0.0018540518,0.0020344984,0.0025895012,0.0047668493,0.0026109782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051483792,0.00006181532,0.00021100766,0.0004421291,0.00009715265,0.00010050587,0.000117490046,0.5498977,0.0047636433,0.3424823,0.0050433944,0.09673134],"study_design_scores_gemma":[0.000017332753,0.000023154493,0.00004479255,0.00006419119,0.000011754735,0.00004744686,0.000009954237,0.89373875,0.0014827527,0.09177741,0.012763546,0.000018932313],"about_ca_topic_score_codex":0.0008859121,"about_ca_topic_score_gemma":0.00087160565,"teacher_disagreement_score":0.009744567,"about_ca_system_score_codex":0.0007711473,"about_ca_system_score_gemma":0.000994151,"threshold_uncertainty_score":0.032598794},"labels":[],"label_agreement":null},{"id":"W4226445767","doi":"10.1007/978-981-16-8248-3_8","title":"An Improved SHO Technique for Mathematical and Multidisciplinary Engineering Applications","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Hyena; Benchmark (surveying); Metaheuristic; Computer science; Mathematical optimization; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Geography; Cartography","score_opus":0.010276293095107733,"score_gpt":0.26041220460087006,"score_spread":0.2501359115057623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226445767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063067386,0.00053655787,0.9640582,0.00023434934,0.00045817348,0.00007968561,0.00009200606,0.00086530094,0.027368875],"genre_scores_gemma":[0.05095833,0.0007152779,0.9042971,0.00030241272,0.0002615717,0.00012748447,0.00021227777,0.00060830987,0.042517263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952507,0.000089387904,0.00002610875,0.000075781536,0.00023343292,0.00005029302],"domain_scores_gemma":[0.999571,0.00009698258,0.000026847261,0.00012164015,0.00015041727,0.00003317525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047836406,0.00084425975,0.000828029,0.0017236966,0.0010171711,0.0010928941,0.0012853992,0.0008411126,0.01703467],"category_scores_gemma":[0.001056851,0.0004466137,0.0013529526,0.0021361988,0.0007446606,0.0017336311,0.0023802253,0.0018394635,0.0076614716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017906514,0.00026986818,0.00059381983,0.000472522,0.000079475445,0.00029529328,0.00019115378,0.022142146,0.06906771,0.14027144,0.022292856,0.74414474],"study_design_scores_gemma":[0.00012756762,0.00044395094,0.0016689906,0.00014812223,0.00013766067,0.0021835323,0.00026064203,0.5685733,0.04765225,0.11513059,0.2635146,0.00015869008],"about_ca_topic_score_codex":0.00076289236,"about_ca_topic_score_gemma":0.0018795407,"teacher_disagreement_score":0.01703467,"about_ca_system_score_codex":0.00025774873,"about_ca_system_score_gemma":0.00085408636,"threshold_uncertainty_score":0.05698669},"labels":[],"label_agreement":null},{"id":"W4229942708","doi":"10.1007/978-3-319-41192-7","title":"Search and Optimization by Metaheuristics","year":2016,"lang":"en","type":"book","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.022259608063322885,"score_gpt":0.27432474020655084,"score_spread":0.25206513214322795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229942708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011814095,0.21578202,0.40656355,0.0034742416,0.0077298325,0.0001364413,0.00031704167,0.0009306033,0.36388478],"genre_scores_gemma":[0.026238954,0.14742295,0.30950025,0.0021759153,0.0047841156,0.00052936573,0.00074611034,0.001436337,0.50716597],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994423,0.000098325676,0.000020351406,0.000073462674,0.00033825717,0.000027319109],"domain_scores_gemma":[0.9995932,0.00023339786,0.000025806137,0.0000674686,0.0000612841,0.00001886779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468316,0.0021552087,0.0018471357,0.0016818607,0.0004096772,0.0026998534,0.0013202261,0.001630534,0.022696488],"category_scores_gemma":[0.0016094767,0.00084499497,0.0011687235,0.003650044,0.001410832,0.0031236783,0.0013871065,0.0037475328,0.015670717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056924946,0.00008258774,0.00009980601,0.0013265414,0.00013196451,0.00006184603,0.0000918974,0.03268854,0.002003765,0.24434158,0.20334339,0.5157712],"study_design_scores_gemma":[0.000028189294,0.000043897453,0.00018469308,0.0005602704,0.00004461528,0.00020168732,0.00003221112,0.042222932,0.0010546668,0.23905452,0.7165398,0.00003261211],"about_ca_topic_score_codex":0.000908658,"about_ca_topic_score_gemma":0.0013093568,"teacher_disagreement_score":0.022696488,"about_ca_system_score_codex":0.0009372629,"about_ca_system_score_gemma":0.0008955981,"threshold_uncertainty_score":0.07592732},"labels":[],"label_agreement":null},{"id":"W4234022368","doi":"10.22215/etd/2014-10580","title":"Swarm Optimization Using Agents Modeled as Distributions","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Perspective (graphical); Metaheuristic; Computer science; Heuristic; Swarm behaviour; Mathematical optimization; Field (mathematics); Black box; Artificial intelligence; Machine learning; Mathematics","score_opus":0.04076039808083713,"score_gpt":0.3485973512389364,"score_spread":0.3078369531580993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234022368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01024066,0.0009741006,0.96841955,0.00061338313,0.00014760466,0.000056271256,0.00006437874,0.00017489896,0.019309182],"genre_scores_gemma":[0.7038487,0.00546051,0.24656308,0.0002728966,0.0003511964,0.00030961278,0.0003086081,0.00016123413,0.042723987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964726,0.00014132968,0.000015271758,0.000059671103,0.00010990551,0.000026627615],"domain_scores_gemma":[0.99959904,0.00020462512,0.000048672762,0.000054864882,0.00006583942,0.000027028462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049757736,0.00053108175,0.00066621037,0.00039146215,0.00034579146,0.001754759,0.0008102028,0.00090643484,0.0024222303],"category_scores_gemma":[0.0018288933,0.00030420613,0.00057068217,0.0006899123,0.0009429852,0.0016067696,0.00110199,0.0009152213,0.0005973191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024980971,0.000020673506,0.0003766509,0.000056456025,0.00004006322,0.00006857255,0.00007536819,0.70028883,0.0009555964,0.27303255,0.0018851358,0.02317516],"study_design_scores_gemma":[0.000015855643,0.000016020023,0.000082724066,0.00001253536,0.000007621207,0.000018277793,0.000013114937,0.92388064,0.00021948825,0.069422364,0.0063053123,0.0000061319993],"about_ca_topic_score_codex":0.002980809,"about_ca_topic_score_gemma":0.0017010244,"teacher_disagreement_score":0.002980809,"about_ca_system_score_codex":0.0007863202,"about_ca_system_score_gemma":0.0008491384,"threshold_uncertainty_score":0.008103192},"labels":[],"label_agreement":null},{"id":"W4234932457","doi":"10.23952/asvao.1.2019.3.06","title":"Duality in vector optimization with domination structures","year":2019,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Duality (order theory); Vector optimization; Vector (molecular biology); Mathematics; Computer science; Mathematical optimization; Optimization problem; Combinatorics; Biology; Recombinant DNA; Genetics; Multi-swarm optimization","score_opus":0.01001554667937715,"score_gpt":0.2573089136681643,"score_spread":0.24729336698878712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234932457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03913456,0.00095635344,0.94504416,0.00037188025,0.00005487154,0.0000384392,0.000031547177,0.000042486317,0.014325726],"genre_scores_gemma":[0.85804445,0.0014647035,0.12835774,0.00024183941,0.00014931812,0.00016087164,0.00009118725,0.000085867454,0.011404099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847776,0.000868159,0.000054712156,0.00012958578,0.0003496871,0.000120055214],"domain_scores_gemma":[0.9978314,0.0013987398,0.00021322702,0.00013441508,0.00031849457,0.0001035848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037341602,0.00072460994,0.00066929753,0.00096689287,0.0005727488,0.0016916728,0.00060909765,0.0007148481,0.0018142462],"category_scores_gemma":[0.00532453,0.000329641,0.00075799506,0.00095309987,0.0021019303,0.0026020377,0.0018314011,0.0014162348,0.00024616712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003958666,0.000026029491,0.0002789021,0.00007415699,0.000019315603,0.000053013227,0.00011316728,0.07516972,0.002311525,0.90734285,0.00038806954,0.014183607],"study_design_scores_gemma":[0.00001901905,0.00011251292,0.00017431244,0.000031298343,0.000008944843,0.00008248116,0.000052499006,0.5195661,0.00174367,0.47476062,0.0034328136,0.0000157098],"about_ca_topic_score_codex":0.00057307153,"about_ca_topic_score_gemma":0.00033174513,"teacher_disagreement_score":0.0037341602,"about_ca_system_score_codex":0.0014380142,"about_ca_system_score_gemma":0.00077573577,"threshold_uncertainty_score":0.01974833},"labels":[],"label_agreement":null},{"id":"W4236332704","doi":"10.32920/ryerson.14664405.v1","title":"Implementation of a novel reactive navigation algorithm","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dijkstra's algorithm; Robot; Computer science; Traverse; Algorithm; Obstacle; Graph; Mobile robot; Hash function; Terrain; Holonomic; Process (computing); Artificial intelligence; Shortest path problem; Theoretical computer science; Geography","score_opus":0.04493479840962592,"score_gpt":0.3703739824579284,"score_spread":0.32543918404830247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236332704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006356506,0.00003902145,0.9882882,0.00006579758,0.00008541402,0.000052640175,0.000021651707,0.0017794291,0.003311375],"genre_scores_gemma":[0.18767372,0.00010437079,0.80193937,0.00012459198,0.00003772511,0.00024469628,0.0001711396,0.0002967624,0.009407648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996538,0.00004645612,0.000018586039,0.000070638926,0.00017069803,0.000039826624],"domain_scores_gemma":[0.9996834,0.00008185504,0.000032807384,0.00005517985,0.00012221305,0.000024595298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052580534,0.00058695895,0.0004325985,0.00039698728,0.00053753506,0.00092169567,0.0017737572,0.00090345676,0.00544305],"category_scores_gemma":[0.00093350676,0.000341062,0.00040882826,0.00025037455,0.00043547613,0.0006716375,0.0008920187,0.0007274595,0.0016641406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033556265,0.00022064,0.0011664495,0.00026603555,0.00009371952,0.00039156788,0.00032499878,0.4535405,0.07968487,0.07115706,0.0064803306,0.3863383],"study_design_scores_gemma":[0.00006009701,0.00009543154,0.00011743331,0.000010404208,0.000016953922,0.00008687642,0.0000233666,0.97233915,0.009793803,0.004378017,0.013062221,0.000016245276],"about_ca_topic_score_codex":0.0019134397,"about_ca_topic_score_gemma":0.0017169807,"teacher_disagreement_score":0.00544305,"about_ca_system_score_codex":0.00042452247,"about_ca_system_score_gemma":0.0007574351,"threshold_uncertainty_score":0.018208742},"labels":[],"label_agreement":null},{"id":"W4240258315","doi":"10.1504/ijcse.2016.10001035","title":"Constraint handling in probability collectives using a modified feasibility-based rule","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Science and Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Variety (cybernetics); Heuristic; Computer science; Constraint (computer-aided design); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.04244383824893212,"score_gpt":0.31466687842316077,"score_spread":0.27222304017422866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240258315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008916507,0.00007165403,0.9875159,0.0001313033,0.000027718432,0.00006572893,0.000018452698,0.00009263909,0.0031600383],"genre_scores_gemma":[0.36282247,0.00017476172,0.63221884,0.00018344517,0.000118635784,0.0004826341,0.00009527418,0.00013678132,0.0037671144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760723,0.0008178813,0.00014920771,0.00035801076,0.0008929278,0.00017477952],"domain_scores_gemma":[0.994823,0.0029979458,0.00063484424,0.0007079066,0.00063712726,0.00019924321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040338514,0.00058810296,0.0013634221,0.0011965955,0.0010522162,0.0017042194,0.0023581076,0.0014046122,0.0027552382],"category_scores_gemma":[0.010868212,0.00059850817,0.0013288182,0.0012874827,0.0022300263,0.0019911986,0.0026722522,0.0018380763,0.0005853162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100222394,0.00007581035,0.0013497596,0.0001384745,0.00009080617,0.00038066856,0.0002721255,0.7998241,0.0039009464,0.11678963,0.002090427,0.074987024],"study_design_scores_gemma":[0.000026848089,0.000048053436,0.000121593686,0.000014971141,0.000015965265,0.00009140385,0.000020844447,0.96975696,0.0008283987,0.027350439,0.0017117682,0.000012734641],"about_ca_topic_score_codex":0.0024175292,"about_ca_topic_score_gemma":0.0021686596,"teacher_disagreement_score":0.0040338514,"about_ca_system_score_codex":0.00053237646,"about_ca_system_score_gemma":0.0013424443,"threshold_uncertainty_score":0.021333277},"labels":[],"label_agreement":null},{"id":"W4240609839","doi":"10.1515/iupac.85.0388","title":"Continuous Dynode Particle Multiplier","year":2016,"lang":"en","type":"dataset","venue":"IUPAC Standards Online","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; National Research Council Canada","funders":"","keywords":"Chemical nomenclature; Terminology; Mass spectrometry; Chemistry; Analytical Chemistry (journal); Chromatography; Organic chemistry","score_opus":0.019870117094674216,"score_gpt":0.40609520557054896,"score_spread":0.3862250884758747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240609839","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060353015,0.000547507,0.0020454854,0.00022160156,0.00013704303,0.00007884533,0.9909531,0.002414855,0.0029981704],"genre_scores_gemma":[0.0018108421,0.00045670327,0.004067573,0.00013185656,0.00002388025,0.0003236476,0.99066085,0.00023961702,0.0022850467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986206,0.00024967786,0.0001840377,0.00036857207,0.00042650753,0.00015052583],"domain_scores_gemma":[0.99781644,0.0006347032,0.00019635608,0.0006525432,0.00059620105,0.00010375241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011862348,0.0020983366,0.0014384018,0.0022761577,0.00080372737,0.0024421122,0.0034897,0.0015220656,0.06521827],"category_scores_gemma":[0.008660448,0.0005785109,0.0017031132,0.0044089393,0.00031372052,0.0017832502,0.001514596,0.0019353974,0.09689983],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015611136,0.000049112972,0.0009879903,0.0007862131,0.000045482197,0.000025941554,0.000012928535,0.002058389,0.00013371505,0.0013167678,0.9734178,0.021009587],"study_design_scores_gemma":[0.00034284007,0.000053990374,0.00255443,0.0004412045,0.000044503184,0.00014740432,0.000060733935,0.0070121693,0.0010735481,0.0072844825,0.98094004,0.000044703113],"about_ca_topic_score_codex":0.012310418,"about_ca_topic_score_gemma":0.019504013,"teacher_disagreement_score":0.06521827,"about_ca_system_score_codex":0.0014399044,"about_ca_system_score_gemma":0.0026749773,"threshold_uncertainty_score":0.21817684},"labels":[],"label_agreement":null},{"id":"W4242271313","doi":"10.1017/s0021900200006070","title":"Geometric Convergence of Genetic Algorithms Under Tempered Random Restart","year":2009,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crossover; Mathematics; Algorithm; Convergence (economics); Population; Genetic algorithm; Rate of convergence; Mutation; Class (philosophy); Mathematical optimization; Computer science; Key (lock); Artificial intelligence","score_opus":0.02888184872187093,"score_gpt":0.27749243825187647,"score_spread":0.24861058953000553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242271313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06399696,0.0011949334,0.9239885,0.00042866243,0.00009706623,0.000058630758,0.00004912912,0.00037756775,0.009808533],"genre_scores_gemma":[0.866545,0.0012189309,0.12539805,0.0003413787,0.00015815208,0.00021621794,0.00017667015,0.00043016433,0.005515414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972051,0.0011752915,0.00012729825,0.0005148679,0.00069423096,0.00028318027],"domain_scores_gemma":[0.9893505,0.0069434717,0.001082955,0.0010026657,0.0012922445,0.00032818364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056186,0.0011900126,0.0015847131,0.0013750748,0.00084257487,0.0020228885,0.0016342587,0.0016416361,0.0015022848],"category_scores_gemma":[0.032808322,0.0005867754,0.0017215376,0.0009656248,0.0052442667,0.002528414,0.002721178,0.0024686204,0.0005374231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000136745,0.000020120668,0.00088325463,0.000057168327,0.000076175704,0.000114208,0.00015921291,0.76240695,0.0018505217,0.22282246,0.0006819323,0.010791265],"study_design_scores_gemma":[0.000022140435,0.00006154451,0.00021763478,0.000018366814,0.000020551053,0.000060614104,0.000015245964,0.87968737,0.0007849586,0.11851611,0.00057620497,0.00001923574],"about_ca_topic_score_codex":0.0023639447,"about_ca_topic_score_gemma":0.0008047425,"teacher_disagreement_score":0.0056186,"about_ca_system_score_codex":0.0025896293,"about_ca_system_score_gemma":0.0013024935,"threshold_uncertainty_score":0.029714346},"labels":[],"label_agreement":null},{"id":"W4244270277","doi":"10.22215/etd/2011-07154","title":"Exchange inlet design optimization by genetic algorithm","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Algorithm","score_opus":0.03229938946203255,"score_gpt":0.2758832408898755,"score_spread":0.24358385142784295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244270277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020273494,0.00043263606,0.93427265,0.0001949272,0.0002059246,0.00013769491,0.00008268154,0.0008656291,0.0435344],"genre_scores_gemma":[0.49360985,0.0006991694,0.4449531,0.00018444945,0.00008468874,0.00042460955,0.00033800886,0.00048617096,0.05922007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996377,0.00009760452,0.000012690943,0.0000574026,0.00014760334,0.000046958216],"domain_scores_gemma":[0.9997905,0.000079578975,0.00002371243,0.00004147785,0.000050128318,0.0000145903705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006662666,0.00077592133,0.0010104077,0.0010727763,0.00076313113,0.0012746765,0.0011522142,0.0011716628,0.012331523],"category_scores_gemma":[0.0011236116,0.00043027135,0.0006731347,0.0010393081,0.00055823434,0.00091060903,0.0012444503,0.00068192877,0.0018235762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014305543,0.00007907145,0.00040212437,0.000103617094,0.000034112018,0.00008891217,0.00007026552,0.8826597,0.0046694246,0.01880101,0.0039015696,0.08904713],"study_design_scores_gemma":[0.000020202653,0.00006510963,0.00009822817,0.00001345085,0.000011690426,0.000024000421,0.000017639142,0.98585284,0.0019977326,0.0055499426,0.0063417493,0.0000073119913],"about_ca_topic_score_codex":0.0028104952,"about_ca_topic_score_gemma":0.002806314,"teacher_disagreement_score":0.012331523,"about_ca_system_score_codex":0.0008338578,"about_ca_system_score_gemma":0.000880103,"threshold_uncertainty_score":0.04125303},"labels":[],"label_agreement":null},{"id":"W4244439700","doi":"10.32920/ryerson.14647050.v1","title":"Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Meta-optimization; Metaheuristic; Imperialist competitive algorithm; Multi-swarm optimization; Derivative-free optimization; Algorithm; Hybrid algorithm (constraint satisfaction); Mathematical optimization; Computer science; Optimization problem; Particle swarm optimization; Test functions for optimization; Continuous optimization; Benchmark (surveying); Bees algorithm; Convergence (economics); Cuckoo search; Parallel metaheuristic; Ant colony optimization algorithms; Mathematics; Artificial intelligence; Constraint satisfaction; Probabilistic logic","score_opus":0.04353849727071869,"score_gpt":0.2966537671727526,"score_spread":0.2531152699020339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244439700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008967975,0.0008003214,0.98058003,0.00013939348,0.0000743344,0.00006969664,0.000054368025,0.00042599384,0.008887868],"genre_scores_gemma":[0.5392398,0.0015414185,0.4417317,0.00019605678,0.000098516015,0.00087361835,0.00041087545,0.00027881714,0.015629116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968195,0.0000985499,0.00002008368,0.000051017763,0.00011647184,0.000031905463],"domain_scores_gemma":[0.9996001,0.00021269695,0.000045628352,0.000026856134,0.00010287668,0.000011892768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008636926,0.00093886716,0.00078562775,0.0009346237,0.00042657793,0.0011327782,0.0011571082,0.0011695381,0.0027389561],"category_scores_gemma":[0.0013721205,0.00041096256,0.0011263696,0.00085986155,0.00045610496,0.000765695,0.0006962609,0.0008653055,0.00079306524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025391539,0.000022211936,0.00049073756,0.00008416197,0.00005129941,0.000034087396,0.0000311992,0.95298374,0.0009600275,0.0132289175,0.0008251586,0.031263098],"study_design_scores_gemma":[0.000002704278,0.000008780975,0.0000415662,0.000006142761,0.00000389643,0.000005942916,0.0000021641526,0.9978968,0.00016520865,0.0011403116,0.00072412274,0.0000023547416],"about_ca_topic_score_codex":0.0055930987,"about_ca_topic_score_gemma":0.0036897664,"teacher_disagreement_score":0.0055930987,"about_ca_system_score_codex":0.0008765612,"about_ca_system_score_gemma":0.0010379273,"threshold_uncertainty_score":0.011121094},"labels":[],"label_agreement":null},{"id":"W4244442967","doi":"10.1007/978-3-319-41192-7_5","title":"Evolutionary Strategies","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"CMA-ES; Evolution strategy; Adaptation (eye); Construct (python library); Mathematical optimization; Evolutionary algorithm; Quadratic equation; Point (geometry); Mathematics; Covariance matrix; Matrix (chemical analysis); Computer science; Algorithm; Physics; Materials science; Geometry","score_opus":0.0298019123276116,"score_gpt":0.27284737817835575,"score_spread":0.24304546585074416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244442967","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023577504,0.009930382,0.2069694,0.0014848734,0.001199794,0.00008284549,0.00014764664,0.00045815413,0.77736914],"genre_scores_gemma":[0.06479524,0.014340029,0.08913037,0.0009930813,0.00059559796,0.00021260952,0.00042683468,0.00043008066,0.8290763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978083,0.0000402304,0.00000819969,0.000040796494,0.00011156497,0.000018428464],"domain_scores_gemma":[0.9998971,0.00003292358,0.0000061083106,0.000024280029,0.000029910836,0.000009621175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023540387,0.00096415845,0.0004877246,0.00076030864,0.0005101033,0.0018322574,0.0008847741,0.001067411,0.038127985],"category_scores_gemma":[0.0008033147,0.00026416482,0.00044188366,0.0008100751,0.00072859356,0.001473317,0.0011570569,0.0013899483,0.014015258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013612914,0.000031190866,0.00008222677,0.00019645988,0.00002176684,0.00007354083,0.000111551446,0.009033475,0.0018497724,0.59821254,0.05126587,0.339108],"study_design_scores_gemma":[0.000012538904,0.000033075237,0.00018245625,0.00021066703,0.000017284176,0.0003029566,0.00006671169,0.017443983,0.0018101912,0.329663,0.650238,0.000019066521],"about_ca_topic_score_codex":0.0006326169,"about_ca_topic_score_gemma":0.0008309749,"teacher_disagreement_score":0.038127985,"about_ca_system_score_codex":0.0007215934,"about_ca_system_score_gemma":0.0005627335,"threshold_uncertainty_score":0.12755084},"labels":[],"label_agreement":null},{"id":"W4247450063","doi":"10.32920/ryerson.14647074","title":"RankGPES: learning to rank for information retrieval using a hybrid genetic programming with evolutionary strategies","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rank (graph theory); Genetic programming; Computer science; Ranking (information retrieval); Learning to rank; Artificial intelligence; Evolutionary algorithm; Machine learning; Evolutionary programming; Genetic algorithm; Mathematics","score_opus":0.028395259418108748,"score_gpt":0.2993532365904498,"score_spread":0.27095797717234105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247450063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022007594,0.00036261106,0.97279155,0.0003735964,0.00008179328,0.00015670205,0.00007524903,0.00090174866,0.0032491495],"genre_scores_gemma":[0.2763277,0.00030822083,0.7154492,0.0004749527,0.000114105795,0.00041301557,0.00027824435,0.00018324179,0.0064513073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915695,0.00032129238,0.000036797992,0.00012459444,0.0002815813,0.00007877251],"domain_scores_gemma":[0.9988895,0.0006997063,0.0000723456,0.00006720489,0.00022599929,0.000045184603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015127374,0.00081110076,0.0011850073,0.001121631,0.00045642245,0.0011269136,0.0013644763,0.0016247181,0.0022983851],"category_scores_gemma":[0.003279281,0.00037367415,0.0007930955,0.0009216281,0.00060120213,0.0011765565,0.0009351448,0.0013832307,0.000587597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103434664,0.00023301881,0.0011935508,0.00012287412,0.000101470054,0.000087603636,0.0000776665,0.66885453,0.0030808642,0.017511433,0.0043301983,0.3043033],"study_design_scores_gemma":[0.000016658934,0.00006314609,0.000079633515,0.000005146577,0.000009108447,0.000019027008,0.000007977936,0.99562436,0.0006709769,0.0027096423,0.0007877654,0.000006656692],"about_ca_topic_score_codex":0.003459969,"about_ca_topic_score_gemma":0.0036204585,"teacher_disagreement_score":0.003459969,"about_ca_system_score_codex":0.00068159576,"about_ca_system_score_gemma":0.0012233998,"threshold_uncertainty_score":0.008000195},"labels":[],"label_agreement":null},{"id":"W4248360727","doi":"10.1109/ijcnn.2006.1716775","title":"Virtual Reality Visual Data Mining via Neural Networks obtained from Multi-objective Evolutionary Optimization: Application to Geophysical Prospecting","year":2006,"lang":"en","type":"article","venue":"The 2006 IEEE International Joint Conference on Neural Network Proceedings","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Genetic programming; Computer science; Artificial neural network; Artificial intelligence; Principal component analysis; Set (abstract data type); Genetic algorithm; Multi-objective optimization; Linear programming; Pattern recognition (psychology); Data mining; Machine learning; Algorithm","score_opus":0.05396050701975837,"score_gpt":0.31641636383682803,"score_spread":0.2624558568170697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248360727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024310665,0.00015748362,0.97413003,0.00016277535,0.000015364278,0.000027145245,0.000024289206,0.0001880107,0.000984206],"genre_scores_gemma":[0.41955757,0.00023205578,0.5783161,0.000068059795,0.00002312685,0.00015393957,0.00009920979,0.00007837251,0.0014715763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978083,0.000075403084,0.000012009128,0.000035724952,0.000073314586,0.000022768987],"domain_scores_gemma":[0.9995547,0.00024115546,0.00005620055,0.00003866643,0.00008541941,0.000023754113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007392788,0.000581041,0.00062394614,0.00084849587,0.00034496648,0.0011540431,0.0007198543,0.0008155909,0.0007950606],"category_scores_gemma":[0.0023464586,0.00043747056,0.0007207313,0.0008540985,0.0006547343,0.0008977756,0.0010831754,0.00089765916,0.00014394204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050538154,0.000036730493,0.000491077,0.00005267751,0.000035589383,0.000070744594,0.000092052935,0.8891253,0.0038285952,0.008366987,0.0003505652,0.09749923],"study_design_scores_gemma":[0.0000025433205,0.0000060188936,0.00006334534,0.0000034986838,0.0000019845613,0.000008741527,0.0000076062515,0.9967571,0.0005258231,0.0024643738,0.00015580654,0.0000031296565],"about_ca_topic_score_codex":0.0027234785,"about_ca_topic_score_gemma":0.0021719022,"teacher_disagreement_score":0.0027234785,"about_ca_system_score_codex":0.00066535024,"about_ca_system_score_gemma":0.00048182052,"threshold_uncertainty_score":0.005415201},"labels":[],"label_agreement":null},{"id":"W4248426926","doi":"10.1109/ccece.2018.8447836","title":"IIR Filter Design Using Multiobjective Artificial Bee Colony Algorithm","year":2018,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Infinite impulse response; Artificial bee colony algorithm; Mathematical optimization; Convergence (economics); Computer science; Filter (signal processing); Passband; Algorithm; Global optimization; Mathematics; Digital filter; Engineering; Band-pass filter","score_opus":0.09843313491562941,"score_gpt":0.3416223917468706,"score_spread":0.24318925683124118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248426926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058005136,0.0003569529,0.9912042,0.000058709647,0.00003201146,0.000028524359,0.000008856125,0.00020080603,0.0023093408],"genre_scores_gemma":[0.25985438,0.00079605734,0.7326114,0.00022141033,0.000057051904,0.00021729441,0.00008334955,0.000109148976,0.0060499315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969935,0.00005135166,0.000015297614,0.000056872555,0.00015244608,0.000024733012],"domain_scores_gemma":[0.9997651,0.00007780446,0.000043453845,0.000018085242,0.00008585869,0.0000096812555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003838571,0.00082619267,0.0006753429,0.00047448915,0.0003051362,0.00077955285,0.00058801606,0.0011843493,0.0015967109],"category_scores_gemma":[0.0007131498,0.0003312783,0.0006330401,0.0004166158,0.0003067167,0.00047031953,0.00027543269,0.00049113727,0.0006078071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010436461,0.000078471116,0.00068686873,0.00031016368,0.0001351336,0.00019549414,0.00014581413,0.6687877,0.07150074,0.009324037,0.0020757192,0.24665546],"study_design_scores_gemma":[0.00001520472,0.00007462623,0.00015618336,0.000013061618,0.00002108892,0.00007544644,0.000010185969,0.99202865,0.004157489,0.0010133354,0.0024248187,0.000009927671],"about_ca_topic_score_codex":0.0016115446,"about_ca_topic_score_gemma":0.0014897869,"teacher_disagreement_score":0.0016115446,"about_ca_system_score_codex":0.00032717013,"about_ca_system_score_gemma":0.000407809,"threshold_uncertainty_score":0.00534153},"labels":[],"label_agreement":null},{"id":"W4248646680","doi":"10.23952/jano.2.2020.1.01","title":"A special issue focused on superiorization versus constrained optimization: analysis and applications","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Psychology","score_opus":0.01826649990284673,"score_gpt":0.2627202259413634,"score_spread":0.24445372603851667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248646680","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020134246,0.04558228,0.018296853,0.02600502,0.8586502,0.00013519132,0.0005686168,0.00033349087,0.04841486],"genre_scores_gemma":[0.011086355,0.03255872,0.0067134043,0.007227622,0.8052799,0.00014795705,0.0010115523,0.00085344026,0.13512102],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781597,0.0003507207,0.00016075812,0.0004278875,0.0010524668,0.00019223793],"domain_scores_gemma":[0.99226624,0.0027933049,0.00055147475,0.0005622902,0.0028976589,0.00092899316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026595474,0.001948266,0.002583649,0.0040738275,0.0014937558,0.007419307,0.0018884932,0.0037845387,0.07723168],"category_scores_gemma":[0.0081137065,0.00060723006,0.0020250326,0.003825223,0.0011359407,0.0044038286,0.0016774071,0.004391667,0.020030633],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011585899,0.00011811919,0.00027105163,0.0005389806,0.00006634416,0.00010891025,0.000015470523,0.00077682367,0.0006396849,0.009432888,0.9187377,0.06917826],"study_design_scores_gemma":[0.000044613436,0.00024812194,0.0016966691,0.0005121514,0.000112800386,0.0004044691,0.00005832623,0.0064726626,0.00076572294,0.020003602,0.9696398,0.000041091986],"about_ca_topic_score_codex":0.0006075502,"about_ca_topic_score_gemma":0.001461677,"teacher_disagreement_score":0.07723168,"about_ca_system_score_codex":0.0016850422,"about_ca_system_score_gemma":0.0020843956,"threshold_uncertainty_score":0.2583657},"labels":[],"label_agreement":null},{"id":"W4249797588","doi":"10.1007/978-1-4419-1665-5_2","title":"Tabu Search","year":2010,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Tabu search; Guided Local Search; Hill climbing; Diversification (marketing strategy); Computer science; Heuristic; Space (punctuation); Incremental heuristic search; Beam search; Theoretical computer science; Search algorithm; Algorithm; Artificial intelligence","score_opus":0.06679086680121286,"score_gpt":0.41150676708795514,"score_spread":0.34471590028674226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249797588","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016830161,0.006660006,0.5234633,0.0013897936,0.0018706373,0.00081512943,0.008929904,0.022040589,0.41800043],"genre_scores_gemma":[0.11378775,0.001943226,0.7052852,0.0011866161,0.000287441,0.00078580837,0.01467886,0.005180201,0.156865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922144,0.00021073234,0.000030192708,0.00017054674,0.00027721227,0.000089970184],"domain_scores_gemma":[0.9992914,0.00025998542,0.00003270816,0.0001870247,0.00020133078,0.000027405318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007905128,0.0011731354,0.0010450304,0.0024502852,0.0012031341,0.002224845,0.0018177546,0.0016239029,0.13198793],"category_scores_gemma":[0.003794007,0.00060799305,0.0011475082,0.003774323,0.0004646892,0.0015737759,0.0010160403,0.0013080698,0.036867965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026028592,0.00020691578,0.00045532788,0.00047522693,0.00011426212,0.00006447399,0.00007307617,0.054016285,0.001743354,0.056636766,0.16346471,0.7224893],"study_design_scores_gemma":[0.00037660316,0.00029113298,0.0008010774,0.0003837921,0.00016565618,0.00041381415,0.00020688053,0.48252127,0.0074521475,0.12331083,0.3839989,0.00007791497],"about_ca_topic_score_codex":0.0025038442,"about_ca_topic_score_gemma":0.0042077987,"teacher_disagreement_score":0.13198793,"about_ca_system_score_codex":0.0008038905,"about_ca_system_score_gemma":0.0016149753,"threshold_uncertainty_score":0.44154364},"labels":[],"label_agreement":null},{"id":"W4251848796","doi":"10.32920/ryerson.14664405","title":"Implementation of a novel reactive navigation algorithm","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dijkstra's algorithm; Robot; Computer science; Traverse; Obstacle; Algorithm; Hash function; Graph; Mobile robot; Terrain; Process (computing); Holonomic; Artificial intelligence; Shortest path problem; Theoretical computer science; Geography","score_opus":0.04493479840962592,"score_gpt":0.3703739824579284,"score_spread":0.32543918404830247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251848796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006356506,0.00003902145,0.9882882,0.00006579758,0.00008541402,0.000052640175,0.000021651707,0.0017794291,0.003311375],"genre_scores_gemma":[0.18767372,0.00010437079,0.80193937,0.00012459198,0.00003772511,0.00024469628,0.0001711396,0.0002967624,0.009407648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996538,0.00004645612,0.000018586039,0.000070638926,0.00017069803,0.000039826624],"domain_scores_gemma":[0.9996834,0.00008185504,0.000032807384,0.00005517985,0.00012221305,0.000024595298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052580534,0.00058695895,0.0004325985,0.00039698728,0.00053753506,0.00092169567,0.0017737572,0.00090345676,0.00544305],"category_scores_gemma":[0.00093350676,0.000341062,0.00040882826,0.00025037455,0.00043547613,0.0006716375,0.0008920187,0.0007274595,0.0016641406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033556265,0.00022064,0.0011664495,0.00026603555,0.00009371952,0.00039156788,0.00032499878,0.4535405,0.07968487,0.07115706,0.0064803306,0.3863383],"study_design_scores_gemma":[0.00006009701,0.00009543154,0.00011743331,0.000010404208,0.000016953922,0.00008687642,0.0000233666,0.97233915,0.009793803,0.004378017,0.013062221,0.000016245276],"about_ca_topic_score_codex":0.0019134397,"about_ca_topic_score_gemma":0.0017169807,"teacher_disagreement_score":0.00544305,"about_ca_system_score_codex":0.00042452247,"about_ca_system_score_gemma":0.0007574351,"threshold_uncertainty_score":0.018208742},"labels":[],"label_agreement":null},{"id":"W4254212488","doi":"10.1007/978-3-540-68830-3_6","title":"Opposition-Based Differential Evolution","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ode; Initialization; Opposition (politics); Differential evolution; Suite; Test suite; Mathematical optimization; Benchmark (surveying); Population; Computer science; Algorithm; Mathematics; Applied mathematics; Test case; Law","score_opus":0.12689775363702605,"score_gpt":0.3686390694557175,"score_spread":0.24174131581869146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254212488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008433635,0.005120977,0.7655209,0.0005853436,0.0008816612,0.00007384843,0.00006580015,0.00029612682,0.21902184],"genre_scores_gemma":[0.4274801,0.0074123126,0.37799034,0.00060113176,0.00039375314,0.0002983684,0.00035133495,0.00032586083,0.18514682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985206,0.000028211423,0.000004724702,0.000015635705,0.00008920072,0.000010164919],"domain_scores_gemma":[0.99989164,0.000056673885,0.0000069989414,0.0000109973535,0.000025767184,0.000007934267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003025191,0.0003889891,0.0005744633,0.00033323336,0.00022472364,0.0008338455,0.00088308455,0.00072811637,0.005348167],"category_scores_gemma":[0.0006912605,0.00018704365,0.0003273698,0.0006023929,0.0005977203,0.0005201589,0.00067438075,0.0010524462,0.0011869605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006337761,0.000066579996,0.00023229972,0.00024465082,0.000042959815,0.00010637312,0.0001237156,0.22086337,0.008691371,0.45709392,0.014781303,0.29769015],"study_design_scores_gemma":[0.000033413096,0.00007957705,0.0002518174,0.000066933506,0.000018233766,0.00021952075,0.000023607501,0.79557115,0.0030088357,0.11862125,0.082080804,0.000024908486],"about_ca_topic_score_codex":0.00047488348,"about_ca_topic_score_gemma":0.0005730808,"teacher_disagreement_score":0.005348167,"about_ca_system_score_codex":0.00039950188,"about_ca_system_score_gemma":0.00026964518,"threshold_uncertainty_score":0.017891407},"labels":[],"label_agreement":null},{"id":"W4254975740","doi":"10.4018/978-1-59904-996-0.ch017","title":"Graph Based Evolutionary Algorithms","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Evolutionary algorithm; Computer science; A priori and a posteriori; Evolutionary computation; Graph; Computation; Algorithm; Theoretical computer science; Artificial intelligence","score_opus":0.024928301964779652,"score_gpt":0.27080694542834866,"score_spread":0.245878643463569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254975740","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00336781,0.02447439,0.8178502,0.0013164432,0.0014134652,0.00017366109,0.00042946212,0.0010748416,0.14989974],"genre_scores_gemma":[0.10678307,0.051187046,0.6970294,0.0013765664,0.0006943846,0.00041486562,0.0019331638,0.000749565,0.13983202],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968326,0.00007044443,0.000014424204,0.000060715774,0.00014284159,0.000028336752],"domain_scores_gemma":[0.999765,0.00011906744,0.000011580879,0.000032200598,0.000056995636,0.000015264251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312145,0.0010411559,0.00085061643,0.0011093239,0.0006236819,0.0020669724,0.0014567017,0.001347039,0.01943757],"category_scores_gemma":[0.0012617343,0.00032531982,0.0009444076,0.0018838394,0.00055327755,0.0016846604,0.0012354814,0.0015068674,0.0074877217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027817958,0.000075713746,0.00038819615,0.00054999726,0.00008886919,0.000177193,0.00013222883,0.122965686,0.0022747235,0.36579633,0.044742424,0.46278083],"study_design_scores_gemma":[0.000023910572,0.00005216994,0.00026749374,0.00022181771,0.000038522692,0.0005262413,0.00008279274,0.19341247,0.001296834,0.31145355,0.49258602,0.000038222104],"about_ca_topic_score_codex":0.0012558396,"about_ca_topic_score_gemma":0.0016093985,"teacher_disagreement_score":0.01943757,"about_ca_system_score_codex":0.0007481976,"about_ca_system_score_gemma":0.0005189706,"threshold_uncertainty_score":0.06502521},"labels":[],"label_agreement":null},{"id":"W4255316375","doi":"10.35940/ijitee.a4215.119119","title":"BOSA: Binary Orientation Search Algorithm","year":2019,"lang":"en","type":"article","venue":"International Journal of Innovative Technology and Exploring Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmark (surveying); Orientation (vector space); Binary number; Algorithm; Computer science; Binary search algorithm; Optimization algorithm; Search algorithm; Mathematical optimization; Mathematics; Arithmetic","score_opus":0.02446113224111164,"score_gpt":0.2801468312143471,"score_spread":0.25568569897323545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255316375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018983692,0.002117063,0.95066917,0.0005947958,0.0003107305,0.00022779562,0.0003881947,0.0027019775,0.02400661],"genre_scores_gemma":[0.33218974,0.0016902523,0.6446383,0.0007371143,0.00015816178,0.0008164388,0.0015770791,0.0005618298,0.017631132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994789,0.00017318972,0.00003205659,0.000069005175,0.0001696798,0.000077282355],"domain_scores_gemma":[0.9996953,0.00010558622,0.00004390932,0.000032303793,0.000095341726,0.000027624468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056281773,0.0008987773,0.0010635387,0.00092691765,0.0005855316,0.0010434914,0.0011136449,0.0010789616,0.006615449],"category_scores_gemma":[0.0015578461,0.0003095371,0.0007116948,0.0013667034,0.00047648113,0.0009974255,0.0008960787,0.0011237571,0.0022076187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035782869,0.0002695865,0.002946442,0.00041464582,0.00015476844,0.00013907425,0.00011891351,0.47868648,0.0063800695,0.041271932,0.028309828,0.44095045],"study_design_scores_gemma":[0.00014377668,0.00013809196,0.0005135666,0.000053285105,0.00003730238,0.00011751485,0.00003753501,0.96251976,0.0024011103,0.012585934,0.021427687,0.000024495479],"about_ca_topic_score_codex":0.0050666328,"about_ca_topic_score_gemma":0.004246393,"teacher_disagreement_score":0.006615449,"about_ca_system_score_codex":0.00047260753,"about_ca_system_score_gemma":0.0015281861,"threshold_uncertainty_score":0.022130907},"labels":[],"label_agreement":null},{"id":"W4255726574","doi":"10.32920/ryerson.14647050","title":"Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Meta-optimization; Metaheuristic; Imperialist competitive algorithm; Multi-swarm optimization; Derivative-free optimization; Algorithm; Mathematical optimization; Hybrid algorithm (constraint satisfaction); Computer science; Optimization problem; Particle swarm optimization; Test functions for optimization; Continuous optimization; Benchmark (surveying); Convergence (economics); Bees algorithm; Cuckoo search; Ant colony optimization algorithms; Mathematics; Artificial intelligence; Probabilistic logic; Constraint satisfaction","score_opus":0.04353849727071869,"score_gpt":0.2966537671727526,"score_spread":0.2531152699020339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255726574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008967975,0.0008003214,0.98058003,0.00013939348,0.0000743344,0.00006969664,0.000054368025,0.00042599384,0.008887868],"genre_scores_gemma":[0.5392398,0.0015414185,0.4417317,0.00019605678,0.000098516015,0.00087361835,0.00041087545,0.00027881714,0.015629116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968195,0.0000985499,0.00002008368,0.000051017763,0.00011647184,0.000031905463],"domain_scores_gemma":[0.9996001,0.00021269695,0.000045628352,0.000026856134,0.00010287668,0.000011892768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008636926,0.00093886716,0.00078562775,0.0009346237,0.00042657793,0.0011327782,0.0011571082,0.0011695381,0.0027389561],"category_scores_gemma":[0.0013721205,0.00041096256,0.0011263696,0.00085986155,0.00045610496,0.000765695,0.0006962609,0.0008653055,0.00079306524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025391539,0.000022211936,0.00049073756,0.00008416197,0.00005129941,0.000034087396,0.0000311992,0.95298374,0.0009600275,0.0132289175,0.0008251586,0.031263098],"study_design_scores_gemma":[0.000002704278,0.000008780975,0.0000415662,0.000006142761,0.00000389643,0.000005942916,0.0000021641526,0.9978968,0.00016520865,0.0011403116,0.00072412274,0.0000023547416],"about_ca_topic_score_codex":0.0055930987,"about_ca_topic_score_gemma":0.0036897664,"teacher_disagreement_score":0.0055930987,"about_ca_system_score_codex":0.0008765612,"about_ca_system_score_gemma":0.0010379273,"threshold_uncertainty_score":0.011121094},"labels":[],"label_agreement":null},{"id":"W4280625329","doi":"10.23919/date54114.2022.9774576","title":"Efficient Traveling Salesman Problem Solvers using the Ising Model with Simulated Bifurcation","year":2022,"lang":"en","type":"article","venue":"2022 Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Travelling salesman problem; Solver; Computer science; Mathematical optimization; Simulated annealing; Benchmark (surveying); Ising model; Spins; Applied mathematics; Mathematics; Algorithm; Physics; Statistical physics","score_opus":0.0955018404612106,"score_gpt":0.30279289995429143,"score_spread":0.20729105949308083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280625329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03747382,0.0006313159,0.9524941,0.00029083007,0.00007511114,0.00015537052,0.00015745779,0.0011353521,0.0075865597],"genre_scores_gemma":[0.27351505,0.000611424,0.72234863,0.000119895114,0.000044614317,0.00042716993,0.0004575567,0.0001876852,0.0022879331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996513,0.00013890209,0.000027413464,0.000046615154,0.00009727773,0.000038565275],"domain_scores_gemma":[0.9992126,0.00053222204,0.000068223664,0.00006502408,0.000093752,0.00002813802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006719326,0.0008659257,0.0008731335,0.00084751734,0.00050541444,0.0008701121,0.0011215156,0.0013785798,0.0020528485],"category_scores_gemma":[0.0021827912,0.00056361087,0.0010043484,0.0011629531,0.00040608272,0.000871425,0.0007656647,0.0012146715,0.0003466939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030420986,0.000046918525,0.00033672608,0.00008431477,0.000057014167,0.00005164342,0.000040903833,0.9587231,0.001165194,0.010472105,0.0009867705,0.02800492],"study_design_scores_gemma":[0.000011356122,0.000006739042,0.0000210389,0.0000030784015,0.0000039983784,0.0000047539825,0.0000047636445,0.9973248,0.00023114594,0.0019825594,0.00040393035,0.0000017402227],"about_ca_topic_score_codex":0.008924048,"about_ca_topic_score_gemma":0.007732925,"teacher_disagreement_score":0.008924048,"about_ca_system_score_codex":0.00083950075,"about_ca_system_score_gemma":0.002287811,"threshold_uncertainty_score":0.017744184},"labels":[],"label_agreement":null},{"id":"W4283025888","doi":"10.1145/3544489","title":"Algorithm 1027: <tt>NOMAD</tt> Version 4: Nonlinear Optimization with the MADS Algorithm","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Algorithm; Component (thermodynamics); Software; Code (set theory); Parallel computing; Programming language; Set (abstract data type)","score_opus":0.015497266875545528,"score_gpt":0.25223856608583045,"score_spread":0.23674129921028492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283025888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069024875,0.0005200412,0.9270177,0.0011398612,0.000598042,0.0005205292,0.004460099,0.017206416,0.04163483],"genre_scores_gemma":[0.07874853,0.00027386955,0.8698093,0.000817862,0.00021100765,0.00171431,0.007935965,0.006200982,0.034288194],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995042,0.000121884004,0.00003282867,0.0001087033,0.00016325536,0.00006902226],"domain_scores_gemma":[0.99903667,0.0004504825,0.00007544288,0.00014944273,0.00023699513,0.000051048955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010051157,0.0015129837,0.0010340539,0.0010178685,0.0007870721,0.0015035622,0.0017348834,0.0017972103,0.093234845],"category_scores_gemma":[0.004820416,0.00059262465,0.00095161,0.00087002007,0.0005763532,0.0012616966,0.0018325591,0.0014768022,0.021532219],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037229306,0.00015210958,0.0016079096,0.0008142445,0.00013215478,0.00014375169,0.00010057105,0.36012158,0.00222866,0.040602393,0.22999933,0.36372498],"study_design_scores_gemma":[0.00030124898,0.00006183052,0.0004220219,0.000112676884,0.000025746618,0.000109209876,0.000043263033,0.89132905,0.002571732,0.024897192,0.08008609,0.00003985889],"about_ca_topic_score_codex":0.005557341,"about_ca_topic_score_gemma":0.0099858185,"teacher_disagreement_score":0.093234845,"about_ca_system_score_codex":0.0011882213,"about_ca_system_score_gemma":0.0026566312,"threshold_uncertainty_score":0.31190163},"labels":[],"label_agreement":null},{"id":"W4283212329","doi":"10.1109/iemtronics55184.2022.9795756","title":"A Data-Centric Machine Learning Approach for Controlling Exploration in Estimation of Distribution Algorithms","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International IOT, Electronics and Mechatronics Conference (IEMTRONICS)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Randomness; Machine learning; Artificial intelligence; Convergence (economics); Heuristic; Algorithm; Metaheuristic; Ideal (ethics); Fitness function; Process (computing); Mathematical optimization; Mathematics; Genetic algorithm","score_opus":0.0582568992309601,"score_gpt":0.3149985670819831,"score_spread":0.256741667851023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283212329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052893977,0.00016707832,0.9937448,0.00012608942,0.00001738159,0.000021524933,0.000011445213,0.00013104362,0.00049113086],"genre_scores_gemma":[0.5286887,0.00039125534,0.46872613,0.00019778885,0.000112049616,0.00029832532,0.00009098682,0.0001400699,0.0013546664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863094,0.00063497084,0.000084540545,0.00022202187,0.00035072205,0.00007681488],"domain_scores_gemma":[0.99539536,0.0028364325,0.00048186412,0.0004637209,0.00072117324,0.00010133118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034995468,0.0009695773,0.0011529746,0.0009666893,0.00042307275,0.0012665457,0.0017742232,0.0011825417,0.00082116824],"category_scores_gemma":[0.01342564,0.00051259465,0.00063013355,0.0010076785,0.0015159025,0.001935682,0.0015611084,0.0018875522,0.00018909851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036097354,0.000039543345,0.0006073435,0.000044291046,0.000030241945,0.000013910294,0.00003385532,0.95453703,0.0012131039,0.01494769,0.0002553007,0.028241612],"study_design_scores_gemma":[0.0000025215713,0.000017255,0.000038703867,0.000002486767,0.000001693297,0.0000035863925,0.0000017412711,0.9976745,0.00024869997,0.0018494605,0.00015719901,0.0000021599988],"about_ca_topic_score_codex":0.0024828129,"about_ca_topic_score_gemma":0.001989669,"teacher_disagreement_score":0.0034995468,"about_ca_system_score_codex":0.0011986529,"about_ca_system_score_gemma":0.0013587471,"threshold_uncertainty_score":0.0185076},"labels":[],"label_agreement":null},{"id":"W4283828779","doi":"10.1007/s00500-022-07280-9","title":"Self-adaptive salp swarm algorithm for optimization problems","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Benchmark (surveying); Computer science; Tuner; Convergence (economics); Algorithm; Mathematical optimization; Population; Metaheuristic; Swarm intelligence; Range (aeronautics); Genetic algorithm; Particle swarm optimization; Mathematics; Engineering; Geography","score_opus":0.024475305420277746,"score_gpt":0.270610781612458,"score_spread":0.24613547619218024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283828779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00703767,0.000489872,0.9857789,0.00019457257,0.000120130295,0.00003481209,0.000022634411,0.00024193386,0.006079477],"genre_scores_gemma":[0.4125948,0.0008807787,0.5722258,0.00031760137,0.00020788521,0.00039681414,0.00023791881,0.00022511474,0.012913224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996741,0.00012808332,0.000014893271,0.000027549402,0.00013565308,0.000019839174],"domain_scores_gemma":[0.9995147,0.0002585494,0.00003654167,0.000050912902,0.00012012042,0.000019152701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005999188,0.00049167994,0.000770135,0.00051047077,0.00039552312,0.00066680653,0.00094951736,0.00085435866,0.0023577216],"category_scores_gemma":[0.0018434146,0.00024281787,0.00046312378,0.0007583585,0.0004426478,0.0005652994,0.00075008953,0.0009707586,0.0008108898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008285186,0.00008474774,0.0004951405,0.00017106067,0.000080918624,0.00007883118,0.000093955554,0.79961956,0.0051061735,0.03603712,0.006188619,0.15196106],"study_design_scores_gemma":[0.000006787568,0.000011875337,0.00003061859,0.0000038247454,0.0000032111348,0.000007870482,0.00000387929,0.99538875,0.00026983276,0.0031968455,0.0010746572,0.0000017565537],"about_ca_topic_score_codex":0.0014326404,"about_ca_topic_score_gemma":0.0012832107,"teacher_disagreement_score":0.0023577216,"about_ca_system_score_codex":0.00037245586,"about_ca_system_score_gemma":0.0005773654,"threshold_uncertainty_score":0.007887363},"labels":[],"label_agreement":null},{"id":"W4285805441","doi":"10.1145/3520304.3528811","title":"Particle swarm optimization with average-fitness based selection","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Particle swarm optimization; Selection (genetic algorithm); Computer science; Multi-swarm optimization; Mathematical optimization; Position (finance); Swarm behaviour; Metaheuristic; Space (punctuation); Fitness landscape; Modal; Artificial intelligence; Machine learning; Mathematics; Population","score_opus":0.02056954485432722,"score_gpt":0.23725766189540073,"score_spread":0.21668811704107352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285805441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013434235,0.0004992361,0.97982717,0.0001421933,0.00012320295,0.000083447274,0.000047715715,0.00044133255,0.0054014954],"genre_scores_gemma":[0.53604233,0.0006682793,0.4530605,0.0001969421,0.00018445222,0.0005180965,0.00027382656,0.00012889704,0.0089266235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907875,0.0003268946,0.000051677864,0.00011859464,0.00035931292,0.00006469369],"domain_scores_gemma":[0.99937755,0.00025934487,0.00005884423,0.000061754145,0.00020937034,0.000033200064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013935295,0.000810726,0.0013066648,0.0007587995,0.00065898785,0.0011364758,0.0013531639,0.0011734471,0.0014604353],"category_scores_gemma":[0.0028471316,0.00034635462,0.00082163326,0.0012917491,0.0005111208,0.0008353808,0.00086892606,0.0008813185,0.00053912314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008299406,0.000074702104,0.0009563725,0.00008264811,0.000092165465,0.000111475245,0.0000652134,0.85539794,0.002434264,0.014337648,0.0027611144,0.12360352],"study_design_scores_gemma":[0.000016062602,0.000054905315,0.00021483039,0.0000055603373,0.000013437711,0.000036738606,0.000004078615,0.9953815,0.00046790353,0.0021640037,0.0016332738,0.000007746371],"about_ca_topic_score_codex":0.0039646174,"about_ca_topic_score_gemma":0.002679307,"teacher_disagreement_score":0.0039646174,"about_ca_system_score_codex":0.00058795756,"about_ca_system_score_gemma":0.00084715965,"threshold_uncertainty_score":0.007883072},"labels":[],"label_agreement":null},{"id":"W4293023448","doi":"10.1145/3489517.3530595","title":"Solving traveling salesman problems via a parallel fully connected ising machine","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Simulated annealing; Computer science; Ising model; Exponential function; Combinatorial optimization; Medoid; Mathematical optimization; Cluster analysis; Adaptive simulated annealing; Annealing (glass); Algorithm; Mathematics; Artificial intelligence; Materials science; Physics; Statistical physics","score_opus":0.05894507042106219,"score_gpt":0.26434047508557257,"score_spread":0.2053954046645104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293023448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067349896,0.0002506332,0.9215895,0.0002825636,0.00006981962,0.000086498054,0.00007167652,0.0010205399,0.009278909],"genre_scores_gemma":[0.50765604,0.00026134017,0.48819825,0.00012064344,0.000034486035,0.00020122193,0.00015866935,0.000087796674,0.0032815484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976736,0.000062830986,0.000018172208,0.000050709532,0.00007405234,0.00002700544],"domain_scores_gemma":[0.9996805,0.0001563233,0.000028265044,0.00006387005,0.000054252763,0.00001687791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028906245,0.0004137466,0.0006279575,0.00045162847,0.0007322148,0.00068458164,0.0009888677,0.0009168045,0.002140787],"category_scores_gemma":[0.0011399058,0.00036794733,0.0006827527,0.00067207287,0.00046050688,0.0010637773,0.0006121875,0.0007748883,0.00030374387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056548088,0.00006136808,0.0003088418,0.000063313106,0.000045644705,0.00006453857,0.000058791065,0.9065208,0.006046705,0.021463964,0.0009251458,0.0643843],"study_design_scores_gemma":[0.000006622135,0.0000129578475,0.00004477235,0.0000018171995,0.0000043477844,0.000011216125,0.000004304559,0.99248683,0.0005826926,0.0063878926,0.00045332804,0.0000033130054],"about_ca_topic_score_codex":0.003545063,"about_ca_topic_score_gemma":0.0043763486,"teacher_disagreement_score":0.003545063,"about_ca_system_score_codex":0.00055273384,"about_ca_system_score_gemma":0.0009013081,"threshold_uncertainty_score":0.007161677},"labels":[],"label_agreement":null},{"id":"W4293075356","doi":"10.1007/s11063-022-10876-9","title":"Derived Multi-population Genetic Algorithm for Adaptive Fuzzy C-Means Clustering","year":2022,"lang":"en","type":"article","venue":"Neural Processing Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Cluster analysis; Fuzzy clustering; Computer science; Premature convergence; Canopy clustering algorithm; Population; CURE data clustering algorithm; Correlation clustering; Data mining; Algorithm; Fuzzy logic; Artificial intelligence; Genetic algorithm; Machine learning","score_opus":0.04514023152022985,"score_gpt":0.29188349604611546,"score_spread":0.24674326452588563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293075356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008389446,0.00022719153,0.987611,0.000083954714,0.00007697927,0.000052931347,0.000021538808,0.0001785929,0.0033584032],"genre_scores_gemma":[0.21239905,0.00023196623,0.78206724,0.00014139112,0.000059195885,0.00033292687,0.0001414896,0.000098549266,0.0045281337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995702,0.00011637711,0.000019220188,0.000079216574,0.00017586417,0.000039184586],"domain_scores_gemma":[0.9995492,0.00014770319,0.000024289411,0.00003400045,0.00023065775,0.000014016549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079163373,0.000687027,0.00079400826,0.0010192605,0.0008713113,0.00085601205,0.0014551786,0.0017729409,0.0020497134],"category_scores_gemma":[0.0020538766,0.0003200318,0.00090668065,0.0010702625,0.0005296097,0.00062831346,0.00084308087,0.001074795,0.0005665022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055418397,0.00006078898,0.0005105078,0.00008113561,0.0000823646,0.00008025677,0.00012650846,0.8261478,0.0052610086,0.018115306,0.0021407304,0.14733818],"study_design_scores_gemma":[0.000007062688,0.000011317097,0.00008282747,0.0000051880697,0.0000070872075,0.00002241076,0.0000065418058,0.99746895,0.0005724298,0.0013475734,0.0004634842,0.0000050751964],"about_ca_topic_score_codex":0.007686491,"about_ca_topic_score_gemma":0.0058327396,"teacher_disagreement_score":0.007686491,"about_ca_system_score_codex":0.0008890167,"about_ca_system_score_gemma":0.0013847102,"threshold_uncertainty_score":0.015283525},"labels":[],"label_agreement":null},{"id":"W4294811381","doi":"10.1109/cec55065.2022.9870429","title":"Clustering Center-based Differential Evolution","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Congress on Evolutionary Computation (CEC)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Benchmark (surveying); Differential evolution; Cluster analysis; Computer science; Sampling (signal processing); Population; Centroid; Mathematical optimization; Algorithm; Heuristic; Data mining; Artificial intelligence; Mathematics","score_opus":0.023721451100349716,"score_gpt":0.2766270093293811,"score_spread":0.2529055582290314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023336627,0.00047637525,0.9711863,0.00011877078,0.00006350313,0.00007592954,0.00003704783,0.00021871828,0.00448665],"genre_scores_gemma":[0.66244805,0.00076424045,0.32856882,0.00019542847,0.000064209344,0.00035699646,0.0002431778,0.00011579781,0.007243375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994179,0.00015420186,0.000026584794,0.00011980746,0.00022688677,0.000054740594],"domain_scores_gemma":[0.9993717,0.00023885405,0.000057250225,0.00006283224,0.00024179454,0.000027480331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010192911,0.000711493,0.00111162,0.0010112287,0.0006376581,0.0009671805,0.0013994398,0.0008900414,0.0016346414],"category_scores_gemma":[0.0025398545,0.00032200888,0.0008797609,0.0011634822,0.0006778467,0.00079407106,0.0011300095,0.00058996654,0.0003473125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074792515,0.000044722965,0.0016560744,0.000103788625,0.00007877411,0.00009096118,0.00019255637,0.8553868,0.006431514,0.029954907,0.0017212469,0.10426392],"study_design_scores_gemma":[0.000005870071,0.000016861486,0.000099886,0.000003872683,0.000006623424,0.000022771594,0.000007434597,0.99592483,0.00083904265,0.0019771347,0.001089787,0.000005833023],"about_ca_topic_score_codex":0.0031503697,"about_ca_topic_score_gemma":0.0019104304,"teacher_disagreement_score":0.0031503697,"about_ca_system_score_codex":0.0011335965,"about_ca_system_score_gemma":0.00073093997,"threshold_uncertainty_score":0.008224845},"labels":[],"label_agreement":null},{"id":"W4294811509","doi":"10.1109/cec55065.2022.9870413","title":"Methods to Detect and Address Stall in Particle Swarm Optimization","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Congress on Evolutionary Computation (CEC)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Mathematical optimization; Computer science; Swarm behaviour; Stall (fluid mechanics); Multi-swarm optimization; Modal; Regular polygon; Mathematics; Engineering; Aerospace engineering","score_opus":0.035768465796337474,"score_gpt":0.34474380056316767,"score_spread":0.3089753347668302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004677053,0.0003340877,0.9933963,0.00012314112,0.00008307453,0.00006376971,0.000011575546,0.00034488807,0.0009660323],"genre_scores_gemma":[0.37261218,0.00059036026,0.6211775,0.00028052248,0.00017137227,0.00046355763,0.000104997824,0.00025857263,0.0043408843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992501,0.00023405587,0.00006204318,0.00009461863,0.00028966446,0.00006943062],"domain_scores_gemma":[0.9970866,0.0015019939,0.00041980002,0.0002722896,0.0006293033,0.00009004094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022831322,0.0011746102,0.0011717197,0.0011391606,0.0006021047,0.0011185916,0.0014532391,0.0013979565,0.0014779676],"category_scores_gemma":[0.010134496,0.0005341722,0.0005752624,0.00076266954,0.0009821412,0.0013404072,0.0015326112,0.0014409319,0.00048677454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013455807,0.00008624455,0.002554695,0.0002054593,0.00008505204,0.00010576622,0.00025316552,0.7693873,0.0042783213,0.021340135,0.0033647332,0.19820464],"study_design_scores_gemma":[0.0000087399585,0.000025174262,0.00018001832,0.000011228432,0.0000066996063,0.000012707207,0.0000137032575,0.9953768,0.00068291917,0.0026304622,0.0010436681,0.000007807628],"about_ca_topic_score_codex":0.0036511943,"about_ca_topic_score_gemma":0.0025228723,"teacher_disagreement_score":0.0036511943,"about_ca_system_score_codex":0.0005921682,"about_ca_system_score_gemma":0.0011205262,"threshold_uncertainty_score":0.0120744705},"labels":[],"label_agreement":null},{"id":"W4295866169","doi":"10.1007/s11047-022-09920-3","title":"Is integration of mechanisms a way to enhance a nature-inspired algorithm?","year":2022,"lang":"en","type":"article","venue":"Natural Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Firefly algorithm; Computer science; Novelty; Premature convergence; Convergence (economics); Theory of computation; Particle swarm optimization; Space (punctuation); Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Psychology","score_opus":0.015484774354612912,"score_gpt":0.3239023054742745,"score_spread":0.3084175311196616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295866169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09488336,0.0031354597,0.8494311,0.0038912413,0.00065224536,0.00017009734,0.000038198516,0.0010452181,0.04675306],"genre_scores_gemma":[0.70133066,0.0018392585,0.28666246,0.0010183966,0.00021400237,0.00021197421,0.000052541403,0.00019311483,0.008477583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991936,0.0002575068,0.000049400678,0.00012688723,0.0002876836,0.00008493577],"domain_scores_gemma":[0.99767977,0.0009181072,0.00029290677,0.0006589831,0.00031170872,0.00013852544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020454817,0.0006687295,0.0006992302,0.00064263435,0.00047828653,0.0028884916,0.0019764304,0.0020706838,0.007368974],"category_scores_gemma":[0.0062843845,0.00045771367,0.0007263273,0.0005979508,0.0013671545,0.0065793013,0.0020960884,0.0015526186,0.0012664807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032217355,0.0007747925,0.004345979,0.00067827734,0.00044090705,0.00027226206,0.00052693574,0.051241733,0.063701525,0.5713949,0.0021187912,0.30418172],"study_design_scores_gemma":[0.000389708,0.0019364562,0.0043564653,0.00047934166,0.00065597956,0.0012300691,0.00055624126,0.3773212,0.0468126,0.46081915,0.1052424,0.00020036529],"about_ca_topic_score_codex":0.0002448516,"about_ca_topic_score_gemma":0.00028973763,"teacher_disagreement_score":0.007368974,"about_ca_system_score_codex":0.00038121667,"about_ca_system_score_gemma":0.00078759994,"threshold_uncertainty_score":0.024651706},"labels":[],"label_agreement":null},{"id":"W4296715628","doi":"10.18280/mmep.090419","title":"An Overview of Self-Adaptive Differential Evolution Algorithms with Mutation Strategy","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Differential evolution; Adaptive mutation; Dependability; Mutation; Scheduling (production processes); Simplicity; Artificial neural network; Analogy; Algorithm; Mathematical optimization; Artificial intelligence; Machine learning; Genetic algorithm; Mathematics","score_opus":0.05385649436757183,"score_gpt":0.26581087624628075,"score_spread":0.2119543818787089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296715628","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022939965,0.022383967,0.9604973,0.00027878702,0.0001864604,0.00008924422,0.000064180174,0.00034145292,0.013864512],"genre_scores_gemma":[0.13423632,0.042914096,0.805852,0.00043318927,0.0004040091,0.00055006176,0.00038276188,0.00025218067,0.014975442],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999635,0.00008567087,0.00004330056,0.000061168954,0.00015121856,0.000023666138],"domain_scores_gemma":[0.9997296,0.00013407643,0.00003054503,0.000024495355,0.00006921371,0.000012064967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658557,0.001112441,0.0010592816,0.0009263394,0.00035731657,0.0011955525,0.0015420575,0.0013425478,0.0026567779],"category_scores_gemma":[0.0010655238,0.00041555654,0.0010628541,0.0016092383,0.000459052,0.0010869203,0.00084207684,0.0013222849,0.0011273528],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056747118,0.00011821827,0.0010806081,0.0009976227,0.00018610408,0.0002149014,0.00014386332,0.35551414,0.006808989,0.13675776,0.006087828,0.49203324],"study_design_scores_gemma":[0.000028121967,0.00011847461,0.00043597157,0.00018987716,0.00006685075,0.0003915201,0.000026132258,0.8624376,0.002532321,0.039129205,0.09459829,0.00004557347],"about_ca_topic_score_codex":0.0017658813,"about_ca_topic_score_gemma":0.0010673144,"teacher_disagreement_score":0.0026567779,"about_ca_system_score_codex":0.00059097423,"about_ca_system_score_gemma":0.0006809482,"threshold_uncertainty_score":0.008887827},"labels":[],"label_agreement":null},{"id":"W4312060289","doi":"10.5281/zenodo.7080764","title":"Invited paper: A Review of Thresheld Convergence","year":2015,"lang":"en","type":"review","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Convergence (economics); Computer science; Economics","score_opus":0.1112920629197347,"score_gpt":0.33568790035667717,"score_spread":0.22439583743694247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312060289","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000107177315,0.9926322,0.0007015975,0.0020247567,0.0017917817,0.000007237226,0.000025451964,0.000011492631,0.002698296],"genre_scores_gemma":[0.0013140831,0.99187917,0.0006008112,0.0016132584,0.0025081488,0.000016760863,0.000060616498,0.000014732971,0.0019924531],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911994,0.0002162027,0.00011758908,0.00017309531,0.00030844338,0.00006468599],"domain_scores_gemma":[0.9963561,0.0019064322,0.00025069987,0.000099476085,0.0012043421,0.00018286821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020235432,0.0010447641,0.0014856141,0.0038139466,0.00056926755,0.002277179,0.0018104255,0.0025086615,0.009174754],"category_scores_gemma":[0.0072267842,0.00047929972,0.00083787687,0.0047980035,0.0012010856,0.004032112,0.0013348395,0.0027670667,0.0075340765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010094768,0.00007553742,0.0003776907,0.017721245,0.00010793244,0.00027648458,0.00016956837,0.0009370883,0.00050267094,0.021149335,0.18796326,0.77061814],"study_design_scores_gemma":[0.000009848531,0.00005182652,0.00034397922,0.0043763383,0.000046444944,0.00086667493,0.000052060233,0.00012976979,0.0002168126,0.0058651087,0.9880166,0.000024419369],"about_ca_topic_score_codex":0.0013410808,"about_ca_topic_score_gemma":0.0015948641,"teacher_disagreement_score":0.009174754,"about_ca_system_score_codex":0.0012166197,"about_ca_system_score_gemma":0.0024850506,"threshold_uncertainty_score":0.030692637},"labels":[],"label_agreement":null},{"id":"W4312513771","doi":"10.23952/jnva.6.2022.6.02","title":"A steepest descent-like method for vector optimization problems with variable domination structure","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia, Tecnología y Medio Ambiente","keywords":"Descent (aeronautics); Method of steepest descent; Gradient descent; Variable (mathematics); Mathematical optimization; Mathematics; Computer science; Artificial intelligence; Physics; Mathematical analysis; Artificial neural network","score_opus":0.012543719876499338,"score_gpt":0.2745541484731804,"score_spread":0.26201042859668106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312513771","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030184155,0.00012082415,0.99575776,0.00007839395,0.00002602007,0.000041390405,0.000012928435,0.00007917036,0.00086502766],"genre_scores_gemma":[0.1544593,0.0003580132,0.8378183,0.00022195325,0.00007217197,0.00040169945,0.0001514024,0.00012617782,0.0063909763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995751,0.00017983462,0.000020693282,0.0000473023,0.0001423491,0.000034708566],"domain_scores_gemma":[0.99952435,0.00020673423,0.00003594514,0.000038734677,0.0001530866,0.00004113313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011161743,0.0008987893,0.0010459826,0.0006807564,0.0005118572,0.0008102932,0.0010542113,0.001187415,0.001719924],"category_scores_gemma":[0.0020349778,0.00041472827,0.00082272023,0.00069209735,0.0008559386,0.00082793913,0.001003401,0.0013631749,0.00045046606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070416194,0.00009293146,0.0006878805,0.00017808203,0.00011758993,0.00014380294,0.00010685131,0.8087151,0.010006951,0.071982674,0.002767673,0.10512996],"study_design_scores_gemma":[0.00000951115,0.000048518454,0.000055214477,0.0000068339523,0.0000059013055,0.000019050956,0.0000047978006,0.98994935,0.0005895069,0.00796752,0.001337095,0.000006619671],"about_ca_topic_score_codex":0.0024430242,"about_ca_topic_score_gemma":0.0031545218,"teacher_disagreement_score":0.0024430242,"about_ca_system_score_codex":0.00057329115,"about_ca_system_score_gemma":0.0012482704,"threshold_uncertainty_score":0.005902946},"labels":[],"label_agreement":null},{"id":"W4312533570","doi":"10.1109/tevc.2022.3227440","title":"Low-Dimensional Space Modeling-Based Differential Evolution for Large-Scale Global Optimization Problems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"HORIZON EUROPE Marie Sklodowska-Curie Actions; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; European Regional Development Fund; Science Foundation Ireland","keywords":"Differential evolution; Curse of dimensionality; Computer science; Mathematical optimization; Artificial intelligence; Dimensionality reduction; Metaheuristic; Global optimization; Algorithm; Mathematics","score_opus":0.017629956348911797,"score_gpt":0.2634041218648854,"score_spread":0.24577416551597359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312533570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012012896,0.00057390006,0.98411477,0.000233619,0.000044954926,0.00003200939,0.00002373087,0.00014123367,0.0028229377],"genre_scores_gemma":[0.62865835,0.00095692737,0.36385912,0.00032921153,0.00008760378,0.00057590747,0.0002215039,0.00019970982,0.005111648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968064,0.00013051403,0.000015926133,0.000048923346,0.000088527086,0.00003546756],"domain_scores_gemma":[0.99895954,0.0007911377,0.00007012301,0.00003751836,0.000100338,0.00004120236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010168527,0.0012309087,0.0012918438,0.000736591,0.00042917902,0.0010104731,0.00097555027,0.0013705003,0.0013930054],"category_scores_gemma":[0.0027461029,0.00051242835,0.0012368249,0.000787044,0.00093907467,0.00072928926,0.0012753225,0.001641468,0.00022141088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010782671,0.000012251272,0.0002487393,0.00003733166,0.000025831772,0.00003327593,0.00003211041,0.9836429,0.00041707527,0.006675547,0.00029355366,0.008570513],"study_design_scores_gemma":[0.0000023981545,0.0000046085224,0.000017243954,0.0000020957968,0.0000019842246,0.0000033384108,0.0000027676924,0.99840885,0.000041252402,0.0013521712,0.00016197676,0.0000014014323],"about_ca_topic_score_codex":0.0048819436,"about_ca_topic_score_gemma":0.0031263328,"teacher_disagreement_score":0.0048819436,"about_ca_system_score_codex":0.0009523564,"about_ca_system_score_gemma":0.0009728057,"threshold_uncertainty_score":0.009707093},"labels":[],"label_agreement":null},{"id":"W4312621041","doi":"10.1609/icaps.v32i1.19805","title":"Beam Search: Faster and Monotonic","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Beam search; Satisficing; Beam (structure); Computation; Monotonic function; Heuristic; Mathematical optimization; Beam diameter; Computer science; Search algorithm; Mathematics; Algorithm; Physics; Optics; Artificial intelligence; Mathematical analysis","score_opus":0.060167967661227346,"score_gpt":0.3081002708569113,"score_spread":0.24793230319568393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312621041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071392874,0.0020033456,0.97728866,0.0006966484,0.0002186824,0.00016059575,0.00019602508,0.0020097045,0.0102870185],"genre_scores_gemma":[0.08035788,0.0013663244,0.90547675,0.0014617211,0.00027911318,0.00061975594,0.0005560587,0.001487266,0.008395161],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996172,0.0014009483,0.00017831248,0.0005488764,0.0014106977,0.00028911358],"domain_scores_gemma":[0.9923394,0.0043258443,0.00043635763,0.0014571751,0.0012555671,0.0001856269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005696455,0.0018512585,0.0024029238,0.0021235298,0.0010104072,0.002688888,0.002870779,0.002571339,0.014699503],"category_scores_gemma":[0.018759582,0.0013495126,0.0020273766,0.0026720325,0.001651927,0.005551975,0.003021389,0.004351318,0.0043426603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005313485,0.00022698147,0.0015341069,0.00056164904,0.00023760973,0.00015072816,0.0003792328,0.30289266,0.008479758,0.16513176,0.031687856,0.48818636],"study_design_scores_gemma":[0.0002552847,0.00015809051,0.00034180313,0.0002321753,0.000073586394,0.00017337795,0.00008852003,0.8610642,0.0035723774,0.1061461,0.027838923,0.000055637323],"about_ca_topic_score_codex":0.007497427,"about_ca_topic_score_gemma":0.0075125364,"teacher_disagreement_score":0.014699503,"about_ca_system_score_codex":0.0015258829,"about_ca_system_score_gemma":0.002946925,"threshold_uncertainty_score":0.049174666},"labels":[],"label_agreement":null},{"id":"W4312671093","doi":"10.1007/978-3-031-20176-9_22","title":"An Extension of the iMOACO$$\\mathbb {_R}$$ Algorithm Based on Layer-Set Selection","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Brandon University","funders":"","keywords":"Selection (genetic algorithm); Fitness proportionate selection; Extension (predicate logic); Rank (graph theory); Layer (electronics); Benchmark (surveying); Algorithm; Reduction (mathematics); Set (abstract data type); Computer science; Mechanism (biology); Ant colony optimization algorithms; Mathematics; Probabilistic logic; Combinatorics; Mathematical optimization; Artificial intelligence; Fitness function; Geography; Physics","score_opus":0.02784172113464203,"score_gpt":0.28892666405086365,"score_spread":0.26108494291622164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312671093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007085684,0.0003167717,0.97465026,0.0002320338,0.00043125552,0.00016246035,0.00013559114,0.0017987018,0.015187225],"genre_scores_gemma":[0.0720166,0.0002442704,0.9099126,0.00027743948,0.00015913574,0.0003367885,0.0003403478,0.0005122606,0.016200513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994905,0.000110375506,0.000024067944,0.00010469455,0.00019236561,0.000077863544],"domain_scores_gemma":[0.99962175,0.00013513326,0.000023012704,0.00007960646,0.00010155183,0.000039008453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006447616,0.0011293541,0.0012176093,0.0010698915,0.00079928385,0.001235725,0.0026927101,0.0011174893,0.0153795155],"category_scores_gemma":[0.0016207641,0.00043195073,0.0010172171,0.0010419397,0.0005114636,0.001108244,0.001968048,0.0014819687,0.0027261635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038153966,0.0003622902,0.000700606,0.00022365373,0.00014037652,0.00013893083,0.00008866322,0.14047256,0.009281553,0.048051484,0.021585973,0.77857226],"study_design_scores_gemma":[0.000083048064,0.00008433818,0.00026088243,0.00002346259,0.00004129075,0.000107381,0.000023663166,0.97277945,0.002975206,0.012290177,0.011310705,0.00002031994],"about_ca_topic_score_codex":0.004940092,"about_ca_topic_score_gemma":0.0079350695,"teacher_disagreement_score":0.0153795155,"about_ca_system_score_codex":0.00074829604,"about_ca_system_score_gemma":0.0017259158,"threshold_uncertainty_score":0.051449597},"labels":[],"label_agreement":null},{"id":"W4312877245","doi":"10.1109/cloudsummit54781.2022.00004","title":"Table of Contents","year":2022,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Table (database); Computer science; Database","score_opus":0.03872965839526196,"score_gpt":0.28411123660206455,"score_spread":0.2453815782068026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312877245","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078278186,0.0041330094,0.0046066837,0.0029382736,0.010488149,0.00083507795,0.068866424,0.0026051095,0.90474445],"genre_scores_gemma":[0.0032571005,0.0034479175,0.0031272147,0.0019799392,0.0024380868,0.0005578338,0.048171304,0.0011913575,0.93582916],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993925,0.00007292984,0.000030689807,0.00010239765,0.0003525952,0.000048777703],"domain_scores_gemma":[0.9967056,0.0006351785,0.00014064822,0.00036561937,0.001753479,0.000399465],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006340602,0.0010816951,0.0010203423,0.0051121623,0.0014859996,0.0039192834,0.0015790339,0.000996088,0.8558972],"category_scores_gemma":[0.0068414123,0.00032280682,0.000578533,0.0040094284,0.00031101765,0.001878363,0.0016351428,0.0010257375,0.7976307],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030162284,0.000046538436,0.00017625204,0.00026340538,0.0000056207286,0.0000237002,0.00001094868,0.00018253284,0.00022814843,0.0014758225,0.9241322,0.07342468],"study_design_scores_gemma":[0.000008734792,0.000021303269,0.0004340784,0.00022762787,0.000007037081,0.000042091946,0.000028085098,0.00012159885,0.00024000347,0.0016556057,0.9972058,0.000007901266],"about_ca_topic_score_codex":0.0034984597,"about_ca_topic_score_gemma":0.004923461,"teacher_disagreement_score":0.14410281,"about_ca_system_score_codex":0.0013935422,"about_ca_system_score_gemma":0.0025051737,"threshold_uncertainty_score":0.20554507},"labels":[],"label_agreement":null},{"id":"W4312966805","doi":"10.1115/detc2022-88722","title":"Comparative Study of First-Order Moving Asymptotes Optimizers for the Moving Morphable Components Topology Optimization Framework","year":2022,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kinova (Canada); Polytechnique Montréal","funders":"","keywords":"Asymptote; Solver; Convergence (economics); Network topology; Topology optimization; Mathematical optimization; Computer science; Local optimum; Topology (electrical circuits); Mathematics; Finite element method; Engineering","score_opus":0.05434033578714452,"score_gpt":0.3284808397542143,"score_spread":0.2741405039670698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312966805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18005103,0.0014602047,0.80684376,0.0003467973,0.00010570942,0.00016023903,0.00011764857,0.00087128894,0.010043227],"genre_scores_gemma":[0.6932624,0.00038869228,0.3037732,0.00008971591,0.000030469013,0.00022040444,0.00019749881,0.00029925758,0.0017383461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992231,0.00038456396,0.00004052586,0.000074554104,0.00021323646,0.00006402947],"domain_scores_gemma":[0.9967912,0.0023273174,0.00020103881,0.00018208993,0.00038236348,0.000115937735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030858873,0.000974786,0.001092279,0.0012208854,0.00035548588,0.0010852944,0.00092740665,0.0012845302,0.0018635578],"category_scores_gemma":[0.0062176874,0.0003298466,0.00087123865,0.0006492414,0.00060019677,0.0006372781,0.0008122757,0.0010353433,0.0002864753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007278832,0.00006357247,0.0006997302,0.000113405535,0.000041518888,0.000045977868,0.000039009192,0.9634101,0.0016286889,0.0052498463,0.0004519444,0.028183512],"study_design_scores_gemma":[0.000003935517,0.000047736547,0.00010645162,0.000009024327,0.000004561454,0.000011470447,0.000009324296,0.99854445,0.00058903464,0.00047912527,0.00019182831,0.000003135436],"about_ca_topic_score_codex":0.0031573526,"about_ca_topic_score_gemma":0.0033888635,"teacher_disagreement_score":0.0031573526,"about_ca_system_score_codex":0.0006682837,"about_ca_system_score_gemma":0.0010419656,"threshold_uncertainty_score":0.016319871},"labels":[],"label_agreement":null},{"id":"W4313034700","doi":"10.1609/socs.v15i1.21758","title":"Optimal Search with Neural Networks: Challenges and Approaches","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Computer science; Machine learning; Artificial neural network; Heuristic; Artificial intelligence; Implementation; Classifier (UML); Beam search; Incremental heuristic search; Search algorithm; Algorithm","score_opus":0.040927950380743636,"score_gpt":0.2525866672370791,"score_spread":0.21165871685633547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313034700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007053409,0.017570544,0.94752526,0.0077617406,0.00026942327,0.00006916505,0.00008081041,0.0002861663,0.019383464],"genre_scores_gemma":[0.31402677,0.022690838,0.64625996,0.0020539947,0.0011674109,0.00041713755,0.00024197389,0.00046775144,0.012674171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980082,0.0008703232,0.00011865594,0.0003240714,0.0005252439,0.00015351674],"domain_scores_gemma":[0.9960758,0.002832398,0.00016464836,0.00037455818,0.00042490166,0.00012760186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038137531,0.00092235673,0.0017535791,0.0011427891,0.0007747167,0.0039693015,0.0028852155,0.0026556586,0.0035365717],"category_scores_gemma":[0.011275989,0.00089586363,0.0009001186,0.0016651431,0.0026978333,0.005737464,0.0028686107,0.004229852,0.0009860491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007678693,0.0001291482,0.0006613068,0.00046819658,0.00007379113,0.00006662628,0.0001388513,0.4593189,0.00026143822,0.37891153,0.0050585386,0.15483496],"study_design_scores_gemma":[0.00001250806,0.000020007466,0.00005964144,0.00010771003,0.000007862716,0.000027198297,0.000053038755,0.6242126,0.00020354979,0.36869135,0.006590949,0.000013592347],"about_ca_topic_score_codex":0.004219874,"about_ca_topic_score_gemma":0.0031409839,"teacher_disagreement_score":0.004219874,"about_ca_system_score_codex":0.00231483,"about_ca_system_score_gemma":0.0021417558,"threshold_uncertainty_score":0.020169318},"labels":[],"label_agreement":null},{"id":"W4313595208","doi":"10.1007/s00500-022-07780-8","title":"An efficient hybrid swarm intelligence optimization algorithm for solving nonlinear systems and clustering problems","year":2023,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Cluster analysis; Swarm intelligence; Algorithm; Metaheuristic; Computer science; Particle swarm optimization; Harmony search; Maxima and minima; Firefly algorithm; Benchmark (surveying); Mathematical optimization; Hybrid algorithm (constraint satisfaction); Optimization problem; Meta-optimization; Multi-swarm optimization; Imperialist competitive algorithm; Cuckoo search; Mathematics; Artificial intelligence; Constraint satisfaction","score_opus":0.03421044503841995,"score_gpt":0.30782170338721,"score_spread":0.27361125834879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313595208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009799238,0.00026061738,0.98503417,0.00011779603,0.0001269375,0.0000691833,0.000040446845,0.00040424577,0.004147502],"genre_scores_gemma":[0.16393659,0.00021635497,0.82846636,0.00015532823,0.00008069689,0.00040852258,0.00018650662,0.00014155588,0.006408167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996623,0.00009295881,0.00001903463,0.000041287454,0.00015858433,0.000025826286],"domain_scores_gemma":[0.9995604,0.00021463197,0.00003014951,0.000038609905,0.00013243032,0.000023794042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009316027,0.0009534241,0.0011539772,0.0008998588,0.0007040953,0.0008186357,0.0013329891,0.0015165898,0.002565623],"category_scores_gemma":[0.0015175107,0.0005278609,0.00077224127,0.0011950532,0.0004936626,0.0008799667,0.0010858704,0.00082491786,0.0006726579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001280976,0.00008518627,0.0003570145,0.0001192118,0.00011670929,0.00007321118,0.00007424893,0.8099105,0.003987425,0.012238568,0.003926961,0.16898291],"study_design_scores_gemma":[0.000012671973,0.000018767529,0.000042630843,0.00000269184,0.0000065016266,0.00000990309,0.0000040925233,0.9978561,0.00029006007,0.0009964698,0.0007566229,0.0000035164712],"about_ca_topic_score_codex":0.003701695,"about_ca_topic_score_gemma":0.0054080696,"teacher_disagreement_score":0.003701695,"about_ca_system_score_codex":0.0005939849,"about_ca_system_score_gemma":0.00090295414,"threshold_uncertainty_score":0.00858289},"labels":[],"label_agreement":null},{"id":"W4313681586","doi":"10.1007/s00521-022-08179-0","title":"Velocity pausing particle swarm optimization: a novel variant for global optimization","year":2023,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Metaheuristic; Mathematical optimization; Computer science; Convergence (economics); Multi-swarm optimization; Local optimum; Premature convergence; Population; MATLAB; Algorithm; Mathematics","score_opus":0.05096111637006901,"score_gpt":0.33579487884874304,"score_spread":0.28483376247867404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313681586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009977134,0.00066589366,0.98496336,0.0001488909,0.00017935006,0.00006562808,0.000024305653,0.00034248317,0.0036329008],"genre_scores_gemma":[0.5364056,0.001136971,0.45623598,0.0003051151,0.000360792,0.00039169186,0.00025438739,0.00028037842,0.0046292143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944717,0.00018575383,0.000036946894,0.000089631554,0.00020047654,0.000040045128],"domain_scores_gemma":[0.99944526,0.00019019369,0.000091265414,0.00008890732,0.00014281154,0.000041487936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086607016,0.0010198059,0.00082829344,0.00081894745,0.00039002098,0.0010825704,0.0014567531,0.0009836752,0.0012804259],"category_scores_gemma":[0.0017160584,0.0003432349,0.0008491817,0.0009561681,0.00073152006,0.00092933176,0.0011509822,0.0010926822,0.00041828954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014061158,0.000099305515,0.001847004,0.00020643762,0.00013888531,0.00021643394,0.00013468249,0.7187014,0.013210943,0.03944542,0.0038399282,0.22201897],"study_design_scores_gemma":[0.000020089063,0.0000824826,0.0001818013,0.00001255202,0.000016091262,0.00006415657,0.000009053858,0.99108726,0.0010963201,0.0035787383,0.0038406216,0.000010846822],"about_ca_topic_score_codex":0.0017346274,"about_ca_topic_score_gemma":0.0009142482,"teacher_disagreement_score":0.0017346274,"about_ca_system_score_codex":0.0003552562,"about_ca_system_score_gemma":0.00068239623,"threshold_uncertainty_score":0.0045802593},"labels":[],"label_agreement":null},{"id":"W4317629412","doi":"10.22541/au.167419576.67789895/v1","title":"CBWO: Chaotic Beluga Whale Optimizer for Numerical and Engineering Optimization Problems","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmark (surveying); Chaotic; Computer science; Convergence (economics); Optimization algorithm; Heuristics; Rate of convergence; Mathematical optimization; Algorithm; Optimization problem; Whale; Code (set theory); Metaheuristic; Artificial intelligence; Mathematics; Key (lock)","score_opus":0.0534391344587794,"score_gpt":0.28947496647265875,"score_spread":0.23603583201387934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317629412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040416844,0.00068777235,0.9505994,0.00024761292,0.00008331508,0.00015434177,0.00007597827,0.00064672495,0.0070881667],"genre_scores_gemma":[0.59973335,0.0005943342,0.39305335,0.00014704267,0.00005675686,0.0006062206,0.0002768213,0.0001864254,0.0053456496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998306,0.000055306526,0.000009884756,0.000022305487,0.00006457989,0.000017272347],"domain_scores_gemma":[0.9998474,0.00006693128,0.000023435698,0.000016734877,0.000032315424,0.000013070615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044225095,0.00072034536,0.0005865074,0.00053238025,0.0004112949,0.00050967245,0.0008004637,0.00066352374,0.0015496506],"category_scores_gemma":[0.0009514971,0.00028090162,0.00045085247,0.00066717964,0.00042027025,0.00044028866,0.00073458237,0.00057268084,0.00023164488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007673246,0.00004205647,0.0012396459,0.00020126592,0.00007510315,0.00011474294,0.0000678613,0.9108081,0.0059404206,0.011248151,0.0018983255,0.068287686],"study_design_scores_gemma":[0.000021360154,0.000034530087,0.00018978279,0.000007571529,0.0000070331653,0.00002859864,0.000007270345,0.9958215,0.0008786114,0.0013310574,0.0016666701,0.0000060931147],"about_ca_topic_score_codex":0.0049017086,"about_ca_topic_score_gemma":0.0036736117,"teacher_disagreement_score":0.0049017086,"about_ca_system_score_codex":0.00035678234,"about_ca_system_score_gemma":0.0006436273,"threshold_uncertainty_score":0.009746373},"labels":[],"label_agreement":null},{"id":"W4317795292","doi":"10.2316/j.2023.203-0428","title":"3D ELECTRIC FIELD COMPUTATION OF OPTIMISED HIGH-VOLTAGE INSULATOR USING PSO-FEM COUPLED ALGORITHM, 1-6.","year":2023,"lang":"en","type":"article","venue":"International Journal of Power and Energy Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finite element method; Particle swarm optimization; Insulator (electricity); Computation; Electric field; Algorithm; Metaheuristic; Swarm behaviour; Voltage; Computer science; Materials science; Engineering; Mathematical optimization; Mathematics; Electrical engineering; Physics; Structural engineering","score_opus":0.016781871881028615,"score_gpt":0.28819385873980286,"score_spread":0.2714119868587742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317795292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065124996,0.0001584409,0.92699546,0.00012008595,0.000044770335,0.00004918589,0.00014979126,0.000767697,0.0065896153],"genre_scores_gemma":[0.75343657,0.00017072444,0.24290363,0.000050760675,0.000018348917,0.00009897247,0.0002814299,0.00011700376,0.002922672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999342,0.000013360046,0.0000030935519,0.000010496657,0.0000315781,0.000007285203],"domain_scores_gemma":[0.999819,0.000082988896,0.000023102022,0.000017563045,0.00004432744,0.000013041631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001893186,0.00046516827,0.00039975272,0.00042886657,0.00028273647,0.00069051876,0.00044398932,0.0009637204,0.002302188],"category_scores_gemma":[0.00061729597,0.00031853633,0.0005157509,0.0003121209,0.00027817255,0.0004896022,0.00035250146,0.00037285854,0.00046162275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050893133,0.000033121592,0.0011557867,0.00007421394,0.000024585119,0.000107177424,0.00005218033,0.9683331,0.007616587,0.0011939341,0.0006107823,0.020747563],"study_design_scores_gemma":[0.0000041748176,0.000011587784,0.0002607745,0.0000031545228,0.0000021904175,0.00001747672,0.000009507964,0.9982882,0.0008155116,0.0003217986,0.00026290878,0.0000026933142],"about_ca_topic_score_codex":0.0020265635,"about_ca_topic_score_gemma":0.002445858,"teacher_disagreement_score":0.002302188,"about_ca_system_score_codex":0.0003314786,"about_ca_system_score_gemma":0.0004969718,"threshold_uncertainty_score":0.0077016354},"labels":[],"label_agreement":null},{"id":"W4318323524","doi":"10.1016/j.ins.2023.01.103","title":"PSO-ELPM: PSO with elite learning, enhanced parameter updating, and exponential mutation operator","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Particle swarm optimization; Mathematical optimization; Benchmark (surveying); Operator (biology); Exponential function; Mutation; Population; Mathematics; Wilcoxon signed-rank test; Computer science; Statistics","score_opus":0.020217666523122513,"score_gpt":0.2964951871606678,"score_spread":0.2762775206375453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318323524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012706814,0.00077852106,0.9771006,0.00028433307,0.00036388278,0.00011040303,0.0001509435,0.0027993154,0.0057052555],"genre_scores_gemma":[0.30415928,0.00074689277,0.6805368,0.00035649343,0.00021942092,0.00029209274,0.00066283334,0.0006507104,0.012375478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995376,0.000116567026,0.000034998764,0.00008950025,0.00018460308,0.000036723406],"domain_scores_gemma":[0.9995807,0.00011400596,0.000043924803,0.00008952861,0.00013674103,0.000035050845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078608416,0.0006691502,0.0010368677,0.00068478746,0.0003553104,0.0008369105,0.0014209483,0.0012626342,0.0025022347],"category_scores_gemma":[0.002969985,0.00023056871,0.0005882459,0.001193966,0.00045402563,0.0012977028,0.0009977539,0.0014497434,0.0010084262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044709363,0.00038788677,0.0016270638,0.00044914923,0.00024532925,0.00024911412,0.000104902705,0.38568687,0.014455039,0.027757347,0.019832926,0.5487572],"study_design_scores_gemma":[0.000092064016,0.00008444314,0.00032906755,0.000015401192,0.000027346678,0.00013262012,0.000006069738,0.9844632,0.005562665,0.0030218556,0.0062463228,0.00001889639],"about_ca_topic_score_codex":0.0019507246,"about_ca_topic_score_gemma":0.0018013982,"teacher_disagreement_score":0.0025022347,"about_ca_system_score_codex":0.0004048032,"about_ca_system_score_gemma":0.0006631956,"threshold_uncertainty_score":0.008370817},"labels":[],"label_agreement":null},{"id":"W4318332884","doi":"10.23952/jano.5.2023.1.11","title":"Some topological properties of solution sets in partially ordered set optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Mathematics; Topology (electrical circuits); Solution set; Pure mathematics; Computer science; Combinatorics","score_opus":0.042646845383208565,"score_gpt":0.28389829597127375,"score_spread":0.24125145058806519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3904104,0.0010099537,0.5888248,0.0010254903,0.000040965508,0.0000907215,0.00022161884,0.00011399576,0.018262109],"genre_scores_gemma":[0.93708396,0.000779304,0.058165397,0.00008536346,0.000060041915,0.0001363051,0.00028825618,0.00006729309,0.0033340387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999298,0.0003072464,0.000043626038,0.00011056947,0.00019270954,0.00004780484],"domain_scores_gemma":[0.9956377,0.0027731408,0.0005510112,0.00020195886,0.00055785663,0.00027839906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018415949,0.0005065997,0.0005437663,0.0030275225,0.0009046014,0.0022284396,0.0007441665,0.0008154549,0.0023055782],"category_scores_gemma":[0.008182997,0.000478001,0.00070014846,0.0014751969,0.0026452143,0.0038063324,0.0014723984,0.0014346493,0.00016944516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053022544,0.00003140421,0.0012707365,0.00011034092,0.000032717282,0.00012453603,0.00038416949,0.06622549,0.00352484,0.9169028,0.00046637724,0.01087365],"study_design_scores_gemma":[0.000020655942,0.0001105934,0.0014145807,0.000064958294,0.000030519266,0.00018011821,0.00034388114,0.413314,0.0033961805,0.578244,0.0028510843,0.00002947157],"about_ca_topic_score_codex":0.0006235422,"about_ca_topic_score_gemma":0.00043979453,"teacher_disagreement_score":0.0030275225,"about_ca_system_score_codex":0.0011301581,"about_ca_system_score_gemma":0.00042177868,"threshold_uncertainty_score":0.009739399},"labels":[],"label_agreement":null},{"id":"W4318603845","doi":"10.1109/ssci51031.2022.10022110","title":"A Particle Swarm Optimization Decomposition Strategy for Large Scale Global Optimization","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Decomposition; Benchmark (surveying); Metaheuristic; Mathematical optimization; Multi-swarm optimization; Computer science; Optimization problem; Function (biology); Global optimization; Scale (ratio); Mathematics; Biology; Ecology; Physics","score_opus":0.030943502908614934,"score_gpt":0.33097788794344296,"score_spread":0.30003438503482804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318603845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002655511,0.00021150157,0.9943777,0.000122022866,0.000051812258,0.000037031514,0.00002302095,0.0001213264,0.0023999983],"genre_scores_gemma":[0.20959823,0.0006940957,0.78129697,0.00025255806,0.00013303659,0.00046345388,0.00032905999,0.00018306597,0.0070495694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995652,0.00015557164,0.000024690336,0.000067700545,0.00014735381,0.000039414732],"domain_scores_gemma":[0.9995011,0.00023582194,0.000048666556,0.000049743267,0.00012553575,0.000039119484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282027,0.0013744065,0.0010293885,0.0007643164,0.0004880455,0.0010037166,0.0010640012,0.0012370875,0.0022554735],"category_scores_gemma":[0.0020559486,0.0005169548,0.0011456257,0.0008078723,0.00066014635,0.0008637766,0.0014550457,0.0016250467,0.0007188068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038855596,0.000044435383,0.00045902372,0.000097688084,0.000066670626,0.000069775124,0.000059992715,0.9083381,0.0030848458,0.023905087,0.003115345,0.060720216],"study_design_scores_gemma":[0.000006866919,0.00001912959,0.000042566302,0.0000058059436,0.000005183397,0.000008892981,0.0000051905454,0.99631315,0.0002444803,0.0022846211,0.0010606885,0.0000033074707],"about_ca_topic_score_codex":0.0040019806,"about_ca_topic_score_gemma":0.0032541738,"teacher_disagreement_score":0.0040019806,"about_ca_system_score_codex":0.00072843354,"about_ca_system_score_gemma":0.0012632392,"threshold_uncertainty_score":0.007957339},"labels":[],"label_agreement":null},{"id":"W4318947280","doi":"10.1088/2632-2153/acb895","title":"Supplementing recurrent neural networks with annealing to solve combinatorial optimization problems","year":2023,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Vector Institute","keywords":"Travelling salesman problem; Simulated annealing; Mathematical optimization; Combinatorial optimization; Computer science; Markov chain; Optimization problem; Heuristic; Artificial neural network; Extremal optimization; Scheduling (production processes); Convergence (economics); Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.012655573042973819,"score_gpt":0.27166090448910435,"score_spread":0.2590053314461305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318947280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12128552,0.00081666344,0.8705879,0.0005248481,0.00012290235,0.00007985275,0.00003404923,0.0007578097,0.0057904343],"genre_scores_gemma":[0.7997168,0.000255278,0.19822575,0.00017028111,0.00005088527,0.0001454053,0.00007533319,0.00008452646,0.001275787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937373,0.00036138366,0.000031279364,0.00007303273,0.00010387708,0.000056714205],"domain_scores_gemma":[0.9969695,0.0023676397,0.00018497517,0.00017055884,0.00025458066,0.000052823256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020824308,0.00072101876,0.0010014585,0.0007061249,0.00038470316,0.0008969855,0.0011965494,0.0014254778,0.0012517609],"category_scores_gemma":[0.005799501,0.00066550187,0.0006788313,0.00067729136,0.00080726587,0.0011125989,0.00071636384,0.0011836445,0.00021937532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017462624,0.000024632944,0.00023141557,0.000022029548,0.00002315819,0.000011583232,0.000013258501,0.987007,0.00052284735,0.0022034654,0.00012441326,0.009798767],"study_design_scores_gemma":[0.0000016835478,0.0000072939483,0.000016344722,0.0000013151971,0.0000018218236,0.0000012291353,0.0000011784439,0.99927264,0.00011016449,0.0005327407,0.000052687996,8.285483e-7],"about_ca_topic_score_codex":0.007229474,"about_ca_topic_score_gemma":0.007521889,"teacher_disagreement_score":0.007229474,"about_ca_system_score_codex":0.0009776838,"about_ca_system_score_gemma":0.0010612762,"threshold_uncertainty_score":0.014374793},"labels":[],"label_agreement":null},{"id":"W4319299347","doi":"10.1002/ett.4739","title":"A levy flight based strategy to improve the exploitation capability of arithmetic optimization algorithm for engineering global optimization problems","year":2023,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Lévy flight; Algorithm; Meta-optimization; Firefly algorithm; Metaheuristic; Mathematical optimization; Derivative-free optimization; Engineering optimization; Population-based incremental learning; Multi-swarm optimization; Optimization problem; Imperialist competitive algorithm; Maxima and minima; Continuous optimization; Global optimization; Computer science; Particle swarm optimization; Cuckoo search; Mathematics; Genetic algorithm","score_opus":0.031272383800057736,"score_gpt":0.29909990819877014,"score_spread":0.2678275243987124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319299347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091026105,0.00061336707,0.8999648,0.0002875951,0.000111295194,0.000101347796,0.000017606031,0.0004241346,0.0074537224],"genre_scores_gemma":[0.8132097,0.00028438112,0.18266213,0.0002263174,0.00005864874,0.00022122703,0.000057894093,0.000048274163,0.0032313387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997316,0.000071276016,0.000018370374,0.000032446158,0.00011473963,0.000031502466],"domain_scores_gemma":[0.99971086,0.00009830305,0.00002791683,0.000018057357,0.00012571689,0.000019147985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911911,0.0005835813,0.0006500785,0.000712446,0.00034890184,0.00047847963,0.0008540965,0.000618284,0.0013078345],"category_scores_gemma":[0.0009996183,0.00019154431,0.00058341137,0.00043993624,0.00046694398,0.00048307827,0.00061010686,0.00043951016,0.00021368981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010190107,0.00013433685,0.0018793208,0.00012243752,0.00011258784,0.00018345131,0.00013986244,0.7798303,0.02438847,0.018935896,0.002403321,0.17176811],"study_design_scores_gemma":[0.00002031876,0.00008527775,0.00016003767,0.000006360831,0.0000139344,0.00003764625,0.000007966394,0.9966569,0.001231407,0.0010343284,0.0007386378,0.00000720391],"about_ca_topic_score_codex":0.0026231494,"about_ca_topic_score_gemma":0.0018230052,"teacher_disagreement_score":0.0026231494,"about_ca_system_score_codex":0.00039273078,"about_ca_system_score_gemma":0.00085823913,"threshold_uncertainty_score":0.005215764},"labels":[],"label_agreement":null},{"id":"W4319309759","doi":"10.1145/3571697.3571711","title":"A Novel Cooperative Parallel Multi-Population Optimization Algorithm","year":2022,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Probabilistic logic; Heuristic; Convergence (economics); Population; Evolutionary algorithm; Algorithm; Evolutionary computation; Mathematical optimization; Parametric statistics; Consistency (knowledge bases); Mathematics; Artificial intelligence","score_opus":0.04000195567319357,"score_gpt":0.29989982024325557,"score_spread":0.259897864570062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319309759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008027583,0.0002780781,0.9850621,0.00014287312,0.000076037264,0.00005805146,0.000033706725,0.00047716164,0.0058443416],"genre_scores_gemma":[0.22199705,0.0003516113,0.76712203,0.0002556373,0.00008724571,0.00041025516,0.00022062841,0.00021067896,0.009344928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995431,0.000096537035,0.000019824545,0.00009808739,0.00018807784,0.000054586562],"domain_scores_gemma":[0.9996792,0.00010443637,0.000037307676,0.000053302483,0.00009858158,0.000027260876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078147626,0.0007171473,0.00097468484,0.000774265,0.0007357996,0.0008361576,0.0020829816,0.0012843749,0.0031816168],"category_scores_gemma":[0.0012102224,0.00042624827,0.00078787835,0.0009594474,0.000441274,0.0011213057,0.0014617278,0.00093743514,0.0010527029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010903799,0.00011730522,0.00075129385,0.00011399166,0.00011143709,0.00014493968,0.00010259107,0.7190956,0.007422546,0.019083232,0.004902842,0.24804518],"study_design_scores_gemma":[0.000026962332,0.000026577223,0.0000695187,0.000004561546,0.000011149668,0.00004948417,0.0000076272636,0.99278945,0.00080847205,0.0029004107,0.0033002743,0.0000055569913],"about_ca_topic_score_codex":0.0022462553,"about_ca_topic_score_gemma":0.0020965082,"teacher_disagreement_score":0.0031816168,"about_ca_system_score_codex":0.0005689405,"about_ca_system_score_gemma":0.0012141626,"threshold_uncertainty_score":0.010643542},"labels":[],"label_agreement":null},{"id":"W4320149352","doi":"10.1007/978-3-031-24866-5_7","title":"Binary Black Widow Optimization Algorithm for Feature Selection Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Feature selection; Selection (genetic algorithm); Algorithm; Computer science; Binary number; Optimization algorithm; Feature (linguistics); Artificial intelligence; Mathematical optimization; Mathematics; Arithmetic; Philosophy","score_opus":0.020966405893147997,"score_gpt":0.26736875263416693,"score_spread":0.24640234674101893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320149352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005683645,0.0009090753,0.9906019,0.00009911195,0.000102736,0.000037464273,0.00005478051,0.00034738705,0.002163867],"genre_scores_gemma":[0.1276831,0.0007241271,0.85917443,0.0002256256,0.00010435086,0.00031127664,0.00036098599,0.00023393608,0.011182137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957556,0.00012244121,0.000021877951,0.000072783165,0.00015770132,0.00004960759],"domain_scores_gemma":[0.999701,0.0001556587,0.00002103953,0.000026241914,0.00007939199,0.000016616234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083625806,0.00080961664,0.0014045279,0.0008602738,0.0005144059,0.00092926767,0.001641004,0.0009979673,0.0062965876],"category_scores_gemma":[0.0014087242,0.00044966422,0.0006685255,0.0016388546,0.00040070963,0.00094113615,0.0010547382,0.001174268,0.0011450192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004457471,0.00020054376,0.00056291913,0.00025500666,0.00014475638,0.000067921894,0.00005955425,0.26274502,0.009273231,0.022012657,0.011876682,0.69235593],"study_design_scores_gemma":[0.000050167873,0.000074019525,0.00019539638,0.00001957109,0.000023183178,0.000042588334,0.000009273161,0.9870012,0.0021214182,0.0069539035,0.0034981198,0.000011175736],"about_ca_topic_score_codex":0.0019137291,"about_ca_topic_score_gemma":0.0018385629,"teacher_disagreement_score":0.0062965876,"about_ca_system_score_codex":0.00038381445,"about_ca_system_score_gemma":0.00059613475,"threshold_uncertainty_score":0.021064162},"labels":[],"label_agreement":null},{"id":"W4320149378","doi":"10.1007/978-3-031-24866-5","title":"Learning and Intelligent Optimization","year":2022,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"University of Ioannina; Far Eastern Federal University; SBA Research; Hefei University of Technology; Hefei University; Università di Bologna; Université de Lorraine; Jyväskylän Yliopisto; Univerzita Karlova v Praze; Università degli Studi di Genova; University of Crete; Università degli Studi di Cagliari","keywords":"Computer science; Artificial intelligence","score_opus":0.018030999264643233,"score_gpt":0.28231403016628837,"score_spread":0.2642830309016451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320149378","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047558993,0.070739366,0.47307897,0.0053115333,0.002103432,0.000060920484,0.0002589759,0.0007558986,0.44293508],"genre_scores_gemma":[0.16980821,0.053471074,0.17066127,0.0019577062,0.0031977135,0.00030753255,0.0006788693,0.00082171784,0.5990959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979883,0.000052191193,0.000007821997,0.000034244866,0.00009318019,0.00001369743],"domain_scores_gemma":[0.9997645,0.00013683677,0.000013656005,0.000045802582,0.000028587945,0.000010578942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032118996,0.0008838519,0.0010878211,0.0005810277,0.00033098317,0.0013459129,0.0005485195,0.00069045956,0.01606828],"category_scores_gemma":[0.0010817704,0.00033022356,0.00046462408,0.0010328725,0.0011765105,0.0017548266,0.00091104856,0.0016533526,0.0050650877],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002540267,0.000049904305,0.00018139543,0.00036663297,0.000056914778,0.00003967517,0.000104849154,0.040927928,0.0010024484,0.48536006,0.09545878,0.37642592],"study_design_scores_gemma":[0.00001108304,0.000035283552,0.00035190067,0.00014553433,0.000020201442,0.00009685204,0.000037034017,0.057493683,0.0009207724,0.7234416,0.21743116,0.000014812116],"about_ca_topic_score_codex":0.0006114746,"about_ca_topic_score_gemma":0.0008604148,"teacher_disagreement_score":0.01606828,"about_ca_system_score_codex":0.0006099051,"about_ca_system_score_gemma":0.00035875646,"threshold_uncertainty_score":0.053753734},"labels":[],"label_agreement":null},{"id":"W4321504838","doi":"10.1007/978-3-031-26504-4_6","title":"A Learning Metaheuristic Algorithm for a Scheduling Application","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Metaheuristic; Computer science; Parallel metaheuristic; Guided Local Search; Hyper-heuristic; Artificial intelligence; Scheduling (production processes); Mathematical optimization; Search-based software engineering; Machine learning; Algorithm; Mathematics; Software","score_opus":0.02921644708812989,"score_gpt":0.2975934123230751,"score_spread":0.26837696523494525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321504838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006059902,0.00029231576,0.9879447,0.0002144029,0.00011100293,0.00007055406,0.00003718182,0.00062938564,0.004640414],"genre_scores_gemma":[0.12006432,0.00034053525,0.8694493,0.00026621972,0.00016611516,0.00034200208,0.00012106707,0.00020640566,0.009043998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977523,0.00005828678,0.000011092297,0.00004396353,0.00008248872,0.0000290116],"domain_scores_gemma":[0.9996836,0.0001746984,0.000023697328,0.00002552215,0.00007291491,0.00001950163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005935353,0.0008176858,0.0007786219,0.0005271723,0.00054271804,0.00071511354,0.0014768724,0.0016618164,0.0046409317],"category_scores_gemma":[0.0013785844,0.00043847403,0.00082407804,0.00094799016,0.00050224835,0.0007463888,0.00082817033,0.0015368382,0.0009211733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005835193,0.00009948914,0.00015823414,0.00007555256,0.00003732679,0.00004402006,0.000028294353,0.7906365,0.0028309429,0.010777987,0.0033987195,0.19185464],"study_design_scores_gemma":[0.000011087756,0.000017806475,0.000025783349,0.0000039616816,0.000004905226,0.000008719929,0.000002726407,0.9961498,0.00033381965,0.002432745,0.0010059364,0.0000027127287],"about_ca_topic_score_codex":0.0035925987,"about_ca_topic_score_gemma":0.0035556736,"teacher_disagreement_score":0.0046409317,"about_ca_system_score_codex":0.0009014442,"about_ca_system_score_gemma":0.0011962639,"threshold_uncertainty_score":0.01552546},"labels":[],"label_agreement":null},{"id":"W4323342267","doi":"10.5267/j.ijiec.2023.1.002","title":"Hybrid algorithm proposal for optimizing benchmarking problems: Salp swarm algorithm enhanced by arithmetic optimization algorithm","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Benchmark (surveying); Benchmarking; Context (archaeology); Swarm behaviour; Optimization algorithm; Computer science; Swarm intelligence; Metaheuristic; Mathematics; Particle swarm optimization; Mathematical optimization; Artificial intelligence","score_opus":0.02614145670597141,"score_gpt":0.2875177971073566,"score_spread":0.2613763404013852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019401615,0.0004163874,0.9726131,0.00015812123,0.000120260054,0.00007940218,0.000044502463,0.00060853997,0.0065581603],"genre_scores_gemma":[0.40216306,0.00049165986,0.5909442,0.00017070174,0.00011907028,0.00043408095,0.00035558196,0.00016785422,0.0051537803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994236,0.00017697769,0.000031117608,0.000071521674,0.0002485292,0.00004830988],"domain_scores_gemma":[0.9996265,0.00012713071,0.000030108402,0.00004223853,0.0001524709,0.000021476564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011529591,0.00074109336,0.0008824356,0.0011765542,0.00038760985,0.00089948677,0.0013799347,0.0007922873,0.0026656613],"category_scores_gemma":[0.0013731975,0.00025061794,0.00073876214,0.0013078026,0.00048261342,0.00079607154,0.0009854203,0.00083587726,0.0005465634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012296229,0.00008673278,0.0012686402,0.00019051766,0.00012853873,0.00009806522,0.00009659855,0.72412425,0.00741989,0.024684036,0.0032247184,0.23855506],"study_design_scores_gemma":[0.000019540774,0.000059951784,0.00015586447,0.0000075820526,0.000011800692,0.00003043382,0.000011417865,0.99372053,0.0013191054,0.0022151847,0.0024415639,0.0000069586845],"about_ca_topic_score_codex":0.0018892725,"about_ca_topic_score_gemma":0.0013582406,"teacher_disagreement_score":0.0026656613,"about_ca_system_score_codex":0.00038530986,"about_ca_system_score_gemma":0.00094661285,"threshold_uncertainty_score":0.00891757},"labels":[],"label_agreement":null},{"id":"W4324137481","doi":"10.1109/icssit55814.2023.10060911","title":"Sparrow Search Optimizer for Constrained Engineering Optimal Designs","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Consistency (knowledge bases); Mathematical optimization; Optimal design; Value (mathematics); Artificial intelligence; Machine learning; Mathematics","score_opus":0.08495236879765003,"score_gpt":0.321829225325992,"score_spread":0.23687685652834198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324137481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06732391,0.000782603,0.9144598,0.00019258092,0.000068977024,0.00018281354,0.00024713308,0.0011707277,0.015571459],"genre_scores_gemma":[0.45383307,0.0004026905,0.5339056,0.00019745945,0.000031966563,0.0006771896,0.00066122,0.00024129364,0.010049456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983525,0.00005450149,0.000010946195,0.000029514564,0.000054730303,0.000015043214],"domain_scores_gemma":[0.9997993,0.00008816198,0.000029152361,0.000022169002,0.000052538697,0.000008560061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053553673,0.00076471857,0.0005766939,0.0005323582,0.0002152078,0.00041583137,0.0004721689,0.00050959905,0.0036184022],"category_scores_gemma":[0.0008944797,0.00032761836,0.00048020406,0.00037740165,0.00021604335,0.00026843883,0.00043233114,0.00049163256,0.0005111665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006279652,0.00004460629,0.0011324146,0.00014262638,0.0000615844,0.00005176227,0.000036687303,0.92111385,0.0034657319,0.0067519834,0.0020954914,0.06504042],"study_design_scores_gemma":[0.000015021993,0.000041261406,0.00015806015,0.000009896279,0.000007292203,0.00001211334,0.000008594627,0.9966164,0.00062971207,0.0008294711,0.001669635,0.0000025809463],"about_ca_topic_score_codex":0.0034160095,"about_ca_topic_score_gemma":0.0042556114,"teacher_disagreement_score":0.0036184022,"about_ca_system_score_codex":0.00027664992,"about_ca_system_score_gemma":0.00083149335,"threshold_uncertainty_score":0.01210469},"labels":[],"label_agreement":null},{"id":"W4324141208","doi":"10.3390/biomimetics8010121","title":"Green Anaconda Optimization: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Biomimetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Univerzita Hradec Králové","keywords":"Metaheuristic; Test suite; Suite; Algorithm; Computer science; Mathematical optimization; Evolutionary algorithm; Optimization problem; Optimization algorithm; Mathematics; Test case; Machine learning","score_opus":0.04784962429236665,"score_gpt":0.2954097904869883,"score_spread":0.24756016619462162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324141208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020125546,0.0010887869,0.96988094,0.00028008549,0.00014065436,0.00011455463,0.00009859099,0.0006739238,0.0075968816],"genre_scores_gemma":[0.23695979,0.0010475942,0.7547573,0.0004895387,0.00008125938,0.0006642211,0.00034867262,0.0002198561,0.0054318057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997249,0.00009238247,0.00001649078,0.00003813973,0.00010011644,0.000028029082],"domain_scores_gemma":[0.999746,0.00012608069,0.00003465001,0.000023797234,0.000053808737,0.000015646547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055071426,0.0009417694,0.00072219013,0.00087167585,0.0004375329,0.00073761906,0.0010788759,0.0010316962,0.0013237258],"category_scores_gemma":[0.000953608,0.00032490573,0.00093525526,0.0010454073,0.0005498323,0.0005758258,0.0007372455,0.0010048863,0.00031100638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063305524,0.000078050536,0.0011220799,0.00017632527,0.00013822109,0.000090277754,0.000054918557,0.8512276,0.006340595,0.018213589,0.0034672676,0.119027704],"study_design_scores_gemma":[0.000023496175,0.000046366786,0.00012497143,0.000013753605,0.000015531934,0.000028871451,0.000007820128,0.99165654,0.00079086097,0.0031924583,0.004092667,0.0000067449346],"about_ca_topic_score_codex":0.0037668217,"about_ca_topic_score_gemma":0.004883392,"teacher_disagreement_score":0.0037668217,"about_ca_system_score_codex":0.00060560595,"about_ca_system_score_gemma":0.0012154817,"threshold_uncertainty_score":0.0074898005},"labels":[],"label_agreement":null},{"id":"W4366193823","doi":"10.3390/math11081890","title":"Editorial for the Special Issue “Advances in Machine Learning and Mathematical Modeling for Optimization Problems”","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; De facto; Artificial intelligence; Deep learning; Range (aeronautics); Image processing; Machine learning; Image (mathematics); Engineering","score_opus":0.034403071202319016,"score_gpt":0.3257775433512778,"score_spread":0.2913744721489588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366193823","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032184882,0.002517375,0.00020917642,0.024422852,0.9716993,0.00002050196,0.000080665544,0.00006335177,0.0009546298],"genre_scores_gemma":[0.00022105154,0.001644556,0.000095072624,0.012369331,0.9821976,0.000019027622,0.00004014954,0.0000367867,0.0033765018],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99575126,0.00054628495,0.00052768,0.00086996733,0.001965569,0.00033929892],"domain_scores_gemma":[0.98030955,0.008186992,0.0014029606,0.00060262234,0.007076881,0.0024209302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053285523,0.0044199955,0.0046881307,0.003027023,0.002766254,0.008275651,0.004313156,0.013201517,0.02626299],"category_scores_gemma":[0.020568201,0.0013078524,0.0041541248,0.001336898,0.002340248,0.0043654735,0.001618032,0.02084014,0.02214551],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003978015,0.000013331825,0.000024152998,0.00013968415,0.000019866558,0.000063552136,0.0000037547304,0.000036027042,0.00006810565,0.00028669255,0.9962578,0.0030472649],"study_design_scores_gemma":[0.00012241326,0.0000629335,0.00044958855,0.0003508457,0.00007904424,0.00026441494,0.000020844825,0.00044905397,0.00024753122,0.0021660014,0.9957561,0.00003128854],"about_ca_topic_score_codex":0.00089711446,"about_ca_topic_score_gemma":0.002125587,"teacher_disagreement_score":0.02626299,"about_ca_system_score_codex":0.0020397361,"about_ca_system_score_gemma":0.0023653305,"threshold_uncertainty_score":0.0878585},"labels":[],"label_agreement":null},{"id":"W4377199999","doi":"10.1007/978-3-031-32726-1_13","title":"Designing Optimization Problems with Diverse Solutions","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mathematical optimization; Mathematics","score_opus":0.05251928756141984,"score_gpt":0.2676739807437541,"score_spread":0.21515469318233427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377199999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007385746,0.0008490158,0.98394394,0.00021697636,0.000080580954,0.00006918032,0.000027129485,0.000097321245,0.007330066],"genre_scores_gemma":[0.19506018,0.0023119783,0.7923222,0.0004378237,0.00038131385,0.00071698974,0.00022550112,0.00031496337,0.008229078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982135,0.00088935683,0.00008590648,0.00026691446,0.00043478754,0.000109490604],"domain_scores_gemma":[0.9973104,0.0019649744,0.00018297862,0.00023158497,0.00020543019,0.0001046281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031241577,0.0018588896,0.0016005262,0.0013859115,0.0007433461,0.0017406764,0.0018186476,0.00238966,0.004421259],"category_scores_gemma":[0.009865074,0.0011610786,0.001404748,0.001920949,0.001204299,0.0027472642,0.0037714753,0.0025618603,0.0011965311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009391583,0.0001257867,0.00044540002,0.0004754716,0.00018099537,0.00019618313,0.0001256021,0.7407353,0.0062094703,0.10281087,0.003465,0.14513604],"study_design_scores_gemma":[0.000040618237,0.00017720857,0.00011962024,0.00008681022,0.000040562187,0.00014047768,0.00006511099,0.9015025,0.0018124225,0.090148196,0.005848377,0.00001805558],"about_ca_topic_score_codex":0.0001279285,"about_ca_topic_score_gemma":0.00021274512,"teacher_disagreement_score":0.004421259,"about_ca_system_score_codex":0.0004909149,"about_ca_system_score_gemma":0.0003447513,"threshold_uncertainty_score":0.016522348},"labels":[],"label_agreement":null},{"id":"W4378419870","doi":"10.1007/978-3-031-34020-8_20","title":"Binary Black Widow with Hill Climbing Algorithm for Feature Selection","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hill climbing; Computer science; Algorithm; Feature selection; Metaheuristic; Binary number; Convergence (economics); Set (abstract data type); Ideal (ethics); Extension (predicate logic); Domain (mathematical analysis); Artificial intelligence; Mathematics","score_opus":0.04667246751670973,"score_gpt":0.3125757170518372,"score_spread":0.26590324953512745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378419870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009236432,0.0014796086,0.9807684,0.00012114186,0.00018539009,0.00010684208,0.00016880505,0.0014444205,0.00648902],"genre_scores_gemma":[0.13753231,0.00087879476,0.84025717,0.00018160285,0.000099858284,0.00034608497,0.00074886717,0.0002943309,0.019660972],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966764,0.00006312609,0.000017399403,0.000064184664,0.00014845634,0.00003913828],"domain_scores_gemma":[0.99986434,0.00004311141,0.000009043807,0.000020015941,0.00005503762,0.000008394184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038724346,0.000741707,0.0011430858,0.00084839604,0.0006446492,0.0007781998,0.0018311422,0.00086780195,0.007891682],"category_scores_gemma":[0.0007737251,0.00033830857,0.0007609222,0.0019461104,0.00020555104,0.0006787598,0.0007639436,0.00083346973,0.0017007581],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026645564,0.00017136565,0.00045230243,0.00029006245,0.0001323383,0.00013969101,0.00006562182,0.12675802,0.013794348,0.009119354,0.02140671,0.8274037],"study_design_scores_gemma":[0.00005944371,0.00012896686,0.0005710064,0.000025694257,0.00004488095,0.00017346512,0.000022424483,0.97583735,0.0059959865,0.0050496734,0.012065056,0.000026119027],"about_ca_topic_score_codex":0.003969243,"about_ca_topic_score_gemma":0.00334376,"teacher_disagreement_score":0.007891682,"about_ca_system_score_codex":0.00025675882,"about_ca_system_score_gemma":0.0005823714,"threshold_uncertainty_score":0.026400328},"labels":[],"label_agreement":null},{"id":"W4379259372","doi":"10.5267/j.dsl.2023.4.010","title":"A novel crossover operator for genetic algorithm: Stas crossover","year":2023,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Crossover; Genetic algorithm; Mathematical optimization; Population; Operator (biology); Selection (genetic algorithm); Computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04398463197428079,"score_gpt":0.3550297463470003,"score_spread":0.31104511437271953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379259372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01689661,0.0006070563,0.9737248,0.00018907564,0.0002402703,0.00012882544,0.00009756515,0.0011447661,0.0069709686],"genre_scores_gemma":[0.29579973,0.0010461981,0.6907754,0.00038065578,0.00026128948,0.00033164755,0.00052157673,0.00032435197,0.010559124],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990885,0.0002159161,0.000064545246,0.00014509779,0.00042778061,0.00005816071],"domain_scores_gemma":[0.9992717,0.00029014904,0.000080587146,0.0001308469,0.00019342604,0.000033246353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074982113,0.00048759233,0.00067731267,0.00094210915,0.0006246697,0.00085694436,0.0008419753,0.00079350674,0.00302469],"category_scores_gemma":[0.0020111555,0.00016790215,0.00079485,0.0015516402,0.0005861966,0.001030295,0.0007596872,0.0012084651,0.00064929895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034997577,0.00020394329,0.0024001203,0.0003524063,0.00017225402,0.0006867802,0.00049318594,0.08052445,0.0717742,0.13158394,0.0122037,0.6992551],"study_design_scores_gemma":[0.00031874413,0.00080880214,0.0024237586,0.00012180346,0.00019554971,0.0031128072,0.00013217896,0.73527586,0.05027567,0.04270708,0.16451128,0.00011650033],"about_ca_topic_score_codex":0.00068843353,"about_ca_topic_score_gemma":0.00063867564,"teacher_disagreement_score":0.00302469,"about_ca_system_score_codex":0.0004253393,"about_ca_system_score_gemma":0.00067792553,"threshold_uncertainty_score":0.010118604},"labels":[],"label_agreement":null},{"id":"W4382807941","doi":"10.1007/978-981-99-3428-7_5","title":"IGA: An Improved Genetic Algorithm for Real-Optimization Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Springer tracts in nature-inspired computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Crossover; Wilcoxon signed-rank test; Algorithm; Rate of convergence; Convergence (economics); Genetic algorithm; Mathematical optimization; Rank (graph theory); Computer science; Mutation; Selection (genetic algorithm); Mathematics; Statistics; Key (lock); Artificial intelligence","score_opus":0.02316120077301969,"score_gpt":0.29264962122112126,"score_spread":0.26948842044810156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382807941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028386943,0.0011558258,0.9874691,0.00014634764,0.00038712734,0.00002907944,0.000042441476,0.0010992042,0.0068321805],"genre_scores_gemma":[0.08121439,0.0014133237,0.9022301,0.0002460999,0.000284627,0.00017339102,0.00018610552,0.00046529016,0.013786691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996829,0.00007026379,0.000012706824,0.00004772429,0.00015275924,0.00003356389],"domain_scores_gemma":[0.99981946,0.00007094339,0.000012216575,0.000024536232,0.000062397325,0.000010531788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005545888,0.0011103384,0.0011557621,0.0006666432,0.00040657987,0.00096472126,0.0013725804,0.0015514555,0.0057231793],"category_scores_gemma":[0.0010513288,0.00033530282,0.0010363113,0.0012078149,0.000620122,0.00088360644,0.00088335935,0.0019320017,0.0017684451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011063541,0.000073999516,0.00026759537,0.0003035757,0.00011446556,0.000143928,0.0000993583,0.53259724,0.009936674,0.036313687,0.01577724,0.4042616],"study_design_scores_gemma":[0.000034149438,0.00006894863,0.00016797196,0.0000305262,0.000035039975,0.0000957552,0.000015254435,0.9631361,0.0018634029,0.0126204435,0.021916457,0.000016002587],"about_ca_topic_score_codex":0.00282301,"about_ca_topic_score_gemma":0.0019062081,"teacher_disagreement_score":0.0057231793,"about_ca_system_score_codex":0.0005110009,"about_ca_system_score_gemma":0.0008161697,"threshold_uncertainty_score":0.019145966},"labels":[],"label_agreement":null},{"id":"W4382866836","doi":"10.1609/icaps.v33i1.27175","title":"W-restrained Bidirectional Bounded-Suboptimal Heuristic Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"United States-Israel Binational Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Heuristic; Property (philosophy); Search algorithm; Mathematical optimization; Computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Mathematical analysis; Philosophy","score_opus":0.0726040891907504,"score_gpt":0.3367700420719623,"score_spread":0.2641659528812119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016182542,0.0002405251,0.9760188,0.00020261122,0.00003667862,0.00006425179,0.000048251775,0.00045125047,0.006755096],"genre_scores_gemma":[0.53976506,0.00025917366,0.45407856,0.00040767327,0.00003519298,0.0003458532,0.00021426563,0.00028340126,0.0046108398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984863,0.0006934377,0.000087289474,0.0001818452,0.0003558944,0.00019527625],"domain_scores_gemma":[0.99655044,0.0018504949,0.00027438934,0.000765494,0.00041966856,0.00013944964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002174398,0.0007655096,0.001079194,0.00058922876,0.0008491979,0.0011790555,0.001954584,0.001296907,0.0044962172],"category_scores_gemma":[0.012226085,0.0005521596,0.00060876424,0.00093093986,0.0010082335,0.0020145953,0.0026921122,0.0015291957,0.00093495456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035898105,0.00016213894,0.0017654483,0.00027159613,0.000089683745,0.00017602886,0.00030410243,0.6240079,0.004688633,0.2008854,0.0042993203,0.16299075],"study_design_scores_gemma":[0.000029911858,0.000060445218,0.00008515408,0.000023892064,0.000012820421,0.00004613351,0.000043602173,0.9423435,0.0010304352,0.05420468,0.0021099881,0.000009487731],"about_ca_topic_score_codex":0.0028146945,"about_ca_topic_score_gemma":0.0038549295,"teacher_disagreement_score":0.0044962172,"about_ca_system_score_codex":0.0007029501,"about_ca_system_score_gemma":0.0022804856,"threshold_uncertainty_score":0.015041351},"labels":[],"label_agreement":null},{"id":"W4383721094","doi":"10.1007/s10462-023-10542-z","title":"AFOX: a new adaptive nature-inspired optimization algorithm","year":2023,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Metaheuristic; Meta-optimization; Computer science; Mathematical optimization; Multi-swarm optimization; Derivative-free optimization; Particle swarm optimization; Imperialist competitive algorithm; Convergence (economics); Optimization problem; Algorithm; Local optimum; Parallel metaheuristic; Benchmark (surveying); Continuous optimization; Engineering optimization; Optimization algorithm; Mathematics","score_opus":0.09369246705703665,"score_gpt":0.37165255071036646,"score_spread":0.2779600836533298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383721094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055677067,0.0034716544,0.98091793,0.00033498564,0.00061720354,0.000078241756,0.000068175956,0.0005954065,0.0083487015],"genre_scores_gemma":[0.11664451,0.0035413557,0.86774457,0.0009218263,0.00047002625,0.00040780392,0.00024797514,0.00027728864,0.009744718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973005,0.00006365916,0.000012610915,0.000043173754,0.00012586817,0.0000246209],"domain_scores_gemma":[0.9997788,0.00010577445,0.000022431297,0.000018381861,0.000058176145,0.000016506961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006506103,0.0008583549,0.0008822872,0.0008747469,0.00043091798,0.0009189502,0.0015638331,0.0014680444,0.0029561822],"category_scores_gemma":[0.0011640976,0.00026465915,0.00082922174,0.0010324331,0.00042366685,0.0009917893,0.00095989095,0.0013541192,0.0006732973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015932579,0.000108532695,0.00085824373,0.00036808342,0.00017174995,0.00011252395,0.00007033026,0.3547045,0.005418526,0.041303262,0.012152113,0.58457285],"study_design_scores_gemma":[0.000059109625,0.00014069516,0.00020680655,0.00005296012,0.000049345803,0.00014086178,0.0000123158325,0.96419376,0.00113904,0.013150132,0.02083745,0.000017661952],"about_ca_topic_score_codex":0.0014884016,"about_ca_topic_score_gemma":0.0013509619,"teacher_disagreement_score":0.0029561822,"about_ca_system_score_codex":0.00035932517,"about_ca_system_score_gemma":0.00069937884,"threshold_uncertainty_score":0.009889424},"labels":[],"label_agreement":null},{"id":"W4383722638","doi":"10.36227/techrxiv.16860049.v2","title":"Adaptability of Improved NEAT in Variable Environments","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Python (programming language); Adaptability; Computer science; Data science; Programming language; Management","score_opus":0.05412458107371051,"score_gpt":0.2969718087178417,"score_spread":0.24284722764413116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383722638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82228947,0.0004699803,0.14380695,0.0008061637,0.00016138227,0.00040462977,0.00047903165,0.0006609344,0.030921577],"genre_scores_gemma":[0.9676932,0.0000821612,0.030089466,0.00008959535,0.000009482084,0.00019959583,0.0001331953,0.000076847864,0.0016265328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788046,0.0011439631,0.000087969194,0.00028959007,0.00042036737,0.00017764048],"domain_scores_gemma":[0.9937372,0.0041078804,0.00040318343,0.00086214975,0.00059835496,0.0002913122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028510657,0.00046485668,0.00038810883,0.00036641312,0.0006607169,0.0011352142,0.0010420072,0.00075996056,0.004262068],"category_scores_gemma":[0.01499519,0.00017764787,0.00042145676,0.00037597513,0.001363184,0.0016211439,0.0015355729,0.00083737524,0.0004947513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014930555,0.00097427325,0.018368486,0.002038314,0.00025823366,0.0014086139,0.008411414,0.64175576,0.07967324,0.03573852,0.0077356556,0.20214441],"study_design_scores_gemma":[0.00033810982,0.003076886,0.027736418,0.0004899963,0.00017185435,0.00104071,0.0073836185,0.8056236,0.05391702,0.0610526,0.038828123,0.00034109558],"about_ca_topic_score_codex":0.0006236028,"about_ca_topic_score_gemma":0.000805004,"teacher_disagreement_score":0.004262068,"about_ca_system_score_codex":0.00065079203,"about_ca_system_score_gemma":0.0005342005,"threshold_uncertainty_score":0.015078068},"labels":[],"label_agreement":null},{"id":"W4385488238","doi":"10.1109/ecai58194.2023.10194001","title":"Chaotic American zebra search optimization algorithm for benchmark challenges","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Chaotic; Benchmark (surveying); Truss; Computer science; Metaheuristic; Swarm intelligence; Algorithm; Swarm behaviour; Bar (unit); Modal; Mathematical optimization; CHAOS (operating system); Artificial intelligence; Mathematics; Engineering; Particle swarm optimization","score_opus":0.05494683518197453,"score_gpt":0.32366129423621354,"score_spread":0.268714459054239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385488238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04889813,0.00042819182,0.9432952,0.00017433327,0.0000666703,0.0000630237,0.000032024593,0.00033450846,0.006707997],"genre_scores_gemma":[0.6256576,0.00034004587,0.36792886,0.00012234601,0.000043980097,0.000290825,0.0001489629,0.00009509979,0.0053722267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997818,0.0000785168,0.000013180658,0.000030177676,0.00007293856,0.000023384619],"domain_scores_gemma":[0.9997991,0.000087692046,0.000021697686,0.000020696081,0.000059208844,0.000011595828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004760855,0.0005155769,0.00051331316,0.00058753905,0.00032189777,0.000418735,0.00066862395,0.00056415587,0.0012604011],"category_scores_gemma":[0.0011549245,0.00019074968,0.00044160092,0.00050408865,0.00036199723,0.0004924597,0.0006330687,0.0004919708,0.00022398689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102001904,0.000032349355,0.0010717856,0.00008330474,0.000065807406,0.000052021413,0.00007036711,0.88441986,0.0047608805,0.021061197,0.0013075863,0.08697297],"study_design_scores_gemma":[0.000011576844,0.00003181443,0.0000901901,0.000003431583,0.0000058994515,0.000012596267,0.000007462187,0.99652725,0.00053659617,0.0015615906,0.0012082058,0.0000033716285],"about_ca_topic_score_codex":0.0024610932,"about_ca_topic_score_gemma":0.0020940048,"teacher_disagreement_score":0.0024610932,"about_ca_system_score_codex":0.00035379443,"about_ca_system_score_gemma":0.00069907296,"threshold_uncertainty_score":0.0048934817},"labels":[],"label_agreement":null},{"id":"W4385763925","doi":"10.24963/ijcai.2023/625","title":"Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Heuristic; Computer science; Set (abstract data type); Algorithm; Bidirectional search; Mathematical optimization; Search algorithm; Beam search; Theoretical computer science; Incremental heuristic search; Mathematics; Artificial intelligence","score_opus":0.06058572995949063,"score_gpt":0.34199767726924996,"score_spread":0.2814119473097593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385763925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019456781,0.0017370166,0.96840626,0.00021871163,0.000051467377,0.0001521095,0.00008129754,0.00044917947,0.009447225],"genre_scores_gemma":[0.2884633,0.0012625047,0.7073503,0.00018385873,0.00006463571,0.0005067283,0.00029246576,0.0002998543,0.0015764118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944977,0.0030522642,0.00020713393,0.00041257116,0.00141178,0.00041865718],"domain_scores_gemma":[0.9764678,0.019364323,0.0007653375,0.0017597198,0.0013958563,0.00024706314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075708716,0.0017414081,0.0018045806,0.0023044902,0.0007277407,0.0029444362,0.00237171,0.0023833718,0.003979103],"category_scores_gemma":[0.03747497,0.0007832536,0.0009259621,0.0026419368,0.0016146463,0.0038053961,0.0025299534,0.0022928908,0.0007745502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022905516,0.00016804317,0.0010793731,0.00030641732,0.00007671728,0.000042006504,0.00010237613,0.77885747,0.0007206334,0.0793376,0.001717049,0.13736324],"study_design_scores_gemma":[0.000019039462,0.000060906696,0.00006760595,0.00006050907,0.0000165194,0.000017329725,0.000034592696,0.96955115,0.0005558249,0.028845537,0.00076401874,0.00000698762],"about_ca_topic_score_codex":0.0029607576,"about_ca_topic_score_gemma":0.0030763203,"teacher_disagreement_score":0.0075708716,"about_ca_system_score_codex":0.002083736,"about_ca_system_score_gemma":0.0031358849,"threshold_uncertainty_score":0.040039122},"labels":[],"label_agreement":null},{"id":"W4386170085","doi":"10.1016/j.swevo.2023.101387","title":"Deep reinforcement learning assisted co-evolutionary differential evolution for constrained optimization","year":2023,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Differential evolution; Benchmark (surveying); Evolutionary algorithm; Artificial intelligence; Convergence (economics); Neuroevolution; Evolutionary computation; Artificial neural network; Machine learning; Population; Flexibility (engineering); Generality; Mathematical optimization; Mathematics","score_opus":0.02676152662992749,"score_gpt":0.2939925407969376,"score_spread":0.2672310141670101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386170085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033374965,0.0005310381,0.95805776,0.0002906083,0.00012991142,0.000051221108,0.000034393965,0.00022601795,0.00730407],"genre_scores_gemma":[0.8365816,0.00022298541,0.1565014,0.00025018142,0.000052000632,0.00020072756,0.000074631236,0.00010520998,0.006011364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997819,0.00007003932,0.000010430092,0.000029958146,0.000070666574,0.000036913938],"domain_scores_gemma":[0.99898463,0.0006666514,0.00006665189,0.0000601204,0.00016942971,0.00005237747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093309424,0.0005993579,0.0011230434,0.00048656698,0.00038849955,0.0006934964,0.0012066747,0.0014076647,0.0024720281],"category_scores_gemma":[0.002385334,0.00040645333,0.0004895376,0.00050264155,0.0007792335,0.0006122686,0.0014022666,0.0014127862,0.0002804943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029450337,0.00003996992,0.00028418962,0.000034276,0.000027185442,0.000028682567,0.000025907204,0.9659887,0.00069525244,0.0085997125,0.00058209075,0.023664607],"study_design_scores_gemma":[0.0000021545472,0.0000050798753,0.000013769424,0.0000013077154,0.0000011733681,0.0000019764414,9.88486e-7,0.9992849,0.000046655026,0.00055875705,0.00008248004,7.1930623e-7],"about_ca_topic_score_codex":0.0066088033,"about_ca_topic_score_gemma":0.0064009633,"teacher_disagreement_score":0.0066088033,"about_ca_system_score_codex":0.0009925256,"about_ca_system_score_gemma":0.0009843389,"threshold_uncertainty_score":0.013140678},"labels":[],"label_agreement":null},{"id":"W4386536666","doi":"10.1063/5.0162724","title":"Arithmetic optimizer algorithm: A comprehensive survey of its results, variants, and applications","year":2023,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Icon; Citation; Computer science; Information retrieval; Search algorithm; Download; World Wide Web; Algorithm; Programming language","score_opus":0.07211304030383141,"score_gpt":0.3124150870787077,"score_spread":0.24030204677487627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386536666","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059161084,0.7628523,0.18870234,0.0022436068,0.000584962,0.00010292981,0.00061936723,0.0008598271,0.03811852],"genre_scores_gemma":[0.08835238,0.6649888,0.2290617,0.0012343347,0.0022635816,0.00026259196,0.001944943,0.0008212122,0.011070431],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984549,0.0003717102,0.00017733216,0.0002646703,0.0006575049,0.00007379534],"domain_scores_gemma":[0.9985214,0.0008461967,0.0000759645,0.00015351574,0.0003530352,0.00004996466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265638,0.0016736775,0.0017158908,0.0027848314,0.00047456243,0.0022364822,0.0014398716,0.0010858467,0.0052945316],"category_scores_gemma":[0.0038961063,0.0006403219,0.0016867715,0.0061602043,0.00077081966,0.0024032095,0.0012430843,0.0018675498,0.0029765663],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013132946,0.00011110405,0.0010336642,0.0032908402,0.00020930044,0.000050330596,0.00004851925,0.033329103,0.0008628092,0.020980723,0.020760924,0.9191914],"study_design_scores_gemma":[0.000101080506,0.0010291585,0.004378738,0.0031725282,0.00052174943,0.0012582918,0.0002521845,0.25563374,0.0058529647,0.09438548,0.6331976,0.00021650376],"about_ca_topic_score_codex":0.0020581393,"about_ca_topic_score_gemma":0.0015767389,"teacher_disagreement_score":0.0052945316,"about_ca_system_score_codex":0.0007367497,"about_ca_system_score_gemma":0.0013706771,"threshold_uncertainty_score":0.017711997},"labels":[],"label_agreement":null},{"id":"W4387005180","doi":"10.1109/cec53210.2023.10254079","title":"Block Differential Evolution","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Ontario Tech University","funders":"","keywords":"Computer science; Blocking (statistics); Benchmark (surveying); Block (permutation group theory); Dimension (graph theory); Mathematical optimization; Optimization problem; Differential evolution; Crossover; Convergence (economics); Heuristic; Algorithm; Mathematics; Artificial intelligence","score_opus":0.025059917013054843,"score_gpt":0.285770877123561,"score_spread":0.26071096011050615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387005180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013304757,0.0017703668,0.9539486,0.00035289247,0.0002448285,0.00009470827,0.00020570161,0.0003300062,0.02974812],"genre_scores_gemma":[0.51820964,0.0033708257,0.4377492,0.0005939092,0.00013243574,0.00069625303,0.00076693005,0.00027009315,0.038210597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976677,0.000057627123,0.0000118196895,0.00003797484,0.000097819255,0.000027989707],"domain_scores_gemma":[0.9996942,0.00015773898,0.0000313094,0.000027131811,0.00007006478,0.000019457435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043063203,0.00066574826,0.000845961,0.0005403318,0.00038851658,0.00086816255,0.0010169753,0.0009843961,0.005864182],"category_scores_gemma":[0.0013099537,0.00032274929,0.0008412336,0.0007044338,0.00052316196,0.00067226536,0.0010769069,0.0009662009,0.0010656909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000635373,0.000050851075,0.0014231858,0.00028772664,0.000110764646,0.00017524518,0.00012516709,0.7617879,0.007145436,0.12371772,0.005542494,0.099569894],"study_design_scores_gemma":[0.000012458174,0.000028328035,0.00014322289,0.000012450453,0.00001221381,0.000049244423,0.0000075615417,0.98182535,0.0006388301,0.008519367,0.008743313,0.000007644708],"about_ca_topic_score_codex":0.0028796648,"about_ca_topic_score_gemma":0.002355873,"teacher_disagreement_score":0.005864182,"about_ca_system_score_codex":0.0006838119,"about_ca_system_score_gemma":0.0006403283,"threshold_uncertainty_score":0.019617617},"labels":[],"label_agreement":null},{"id":"W4387005219","doi":"10.1109/cec53210.2023.10254195","title":"A Framework for Meta-heuristic Parameter Performance Prediction Using Fitness Landscape Analysis and Machine Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Particle swarm optimization; Machine learning; Heuristic; Artificial intelligence; Fitness landscape; Mathematical optimization; Control (management); Sampling (signal processing); Mathematics; Population","score_opus":0.10276649256352458,"score_gpt":0.33188698367722597,"score_spread":0.2291204911137014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387005219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027794521,0.0002920416,0.9949778,0.00014147714,0.000018284398,0.000038638547,0.000019802603,0.00018350543,0.0015489572],"genre_scores_gemma":[0.3222363,0.0008616826,0.67407423,0.0001782806,0.000113902905,0.0004764618,0.00015830994,0.00023487234,0.0016659971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991217,0.0003807289,0.000044420816,0.00012719103,0.00025547133,0.00007043514],"domain_scores_gemma":[0.99864715,0.00075316936,0.00019233605,0.00017025655,0.00018868898,0.00004838527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025201137,0.0016754151,0.0016565913,0.0019719463,0.0005472359,0.0018534705,0.002495759,0.0016236912,0.00138522],"category_scores_gemma":[0.0051920963,0.0006622747,0.0013000458,0.0015605391,0.0015341034,0.0015970469,0.0013212526,0.0021169218,0.00027458213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008549909,0.000030161309,0.00026861718,0.0000397526,0.00003550686,0.000022069305,0.000026579084,0.95232683,0.0005420287,0.026150052,0.00039210956,0.020157704],"study_design_scores_gemma":[0.0000022490858,0.00001217225,0.000048533137,0.0000089019695,0.000004300078,0.0000066118687,0.000003794379,0.9909594,0.00011494615,0.008470515,0.00036421246,0.0000042996767],"about_ca_topic_score_codex":0.004337523,"about_ca_topic_score_gemma":0.0031106432,"teacher_disagreement_score":0.004337523,"about_ca_system_score_codex":0.0015221309,"about_ca_system_score_gemma":0.0016910519,"threshold_uncertainty_score":0.013327777},"labels":[],"label_agreement":null},{"id":"W4387005463","doi":"10.1109/cec53210.2023.10254096","title":"A Data-Centric Approach to Parameter Tuning, an Application to Differential Evolution","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Differential evolution; Benchmark (surveying); Crossover; Computer science; Suite; Differential (mechanical device); Population; Process (computing); Evolutionary computation; Algorithm; Artificial intelligence; Machine learning; Engineering","score_opus":0.07405581540004094,"score_gpt":0.3362113741045886,"score_spread":0.26215555870454765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387005463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018035945,0.00019471864,0.99567115,0.00018995258,0.000041005598,0.00005577373,0.00003335042,0.00029191255,0.0017185196],"genre_scores_gemma":[0.16919477,0.000653739,0.8261503,0.0003817949,0.0001388633,0.0004507546,0.0001665724,0.0003482002,0.002515029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982425,0.0006121423,0.0001357788,0.00030524487,0.00065620313,0.00004823089],"domain_scores_gemma":[0.995896,0.002117289,0.0003715665,0.0010339114,0.0005063228,0.000074856805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036892632,0.0015105818,0.0014595614,0.0014931742,0.0006170583,0.0018683858,0.0022308761,0.0015272711,0.0026148292],"category_scores_gemma":[0.013866882,0.00083827256,0.0010096154,0.0016184296,0.0016315434,0.0016286543,0.00273142,0.0027351882,0.0007195501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008318384,0.00016800073,0.0014975627,0.00032709757,0.00019595362,0.00013792398,0.00020143637,0.6472548,0.0116354665,0.058175426,0.002708654,0.27761453],"study_design_scores_gemma":[0.000027821485,0.00009628654,0.0002724698,0.000040800154,0.00003179474,0.00013519771,0.000022500764,0.94307756,0.0053905514,0.04263034,0.008242959,0.000031667587],"about_ca_topic_score_codex":0.001098832,"about_ca_topic_score_gemma":0.001113637,"teacher_disagreement_score":0.0036892632,"about_ca_system_score_codex":0.0007164529,"about_ca_system_score_gemma":0.00086279394,"threshold_uncertainty_score":0.019510925},"labels":[],"label_agreement":null},{"id":"W4387195735","doi":"10.1007/978-3-031-43085-5_2","title":"Low-Dimensional Space Modeling-Based Differential Evolution: A Scalability Perspective on bbob-largescale suite","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scalability; Computer science; Curse of dimensionality; Differential evolution; Dimensionality reduction; Mathematical optimization; Suite; Global optimization; Artificial intelligence; Algorithm; Mathematics; Database","score_opus":0.024141184410859277,"score_gpt":0.28105012722075134,"score_spread":0.25690894280989207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387195735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020888047,0.0009788617,0.94250995,0.00088355574,0.00016476757,0.00007311112,0.00010885446,0.0017097706,0.03268308],"genre_scores_gemma":[0.4479458,0.0010163803,0.53182125,0.0003662647,0.00009958105,0.00021465859,0.00049923826,0.0005834552,0.017453326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994764,0.00016215474,0.000016448703,0.000048786867,0.00024192042,0.000054358094],"domain_scores_gemma":[0.999308,0.0002989257,0.000027482327,0.00015409008,0.00016237314,0.00004912125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000991579,0.00059506245,0.00097120134,0.00034093863,0.00043146696,0.001495434,0.001552062,0.0007529484,0.0066961925],"category_scores_gemma":[0.002925996,0.00023263403,0.00048141403,0.0008769338,0.0005580992,0.0013645887,0.0015911919,0.0016954996,0.001285486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014944683,0.00015235665,0.00090511714,0.00018185901,0.000060457238,0.00008921087,0.00008769245,0.62061113,0.0069929464,0.13496281,0.011770194,0.22403672],"study_design_scores_gemma":[0.0000056328868,0.000015261172,0.00006165128,0.0000070113574,0.0000047595204,0.000015014057,0.000008856781,0.984934,0.0008458716,0.011442765,0.002656357,0.000002858073],"about_ca_topic_score_codex":0.0035732465,"about_ca_topic_score_gemma":0.0036295883,"teacher_disagreement_score":0.0066961925,"about_ca_system_score_codex":0.00095855107,"about_ca_system_score_gemma":0.00083342125,"threshold_uncertainty_score":0.022400975},"labels":[],"label_agreement":null},{"id":"W4387265282","doi":"10.3390/biomimetics8060468","title":"OOBO: A New Metaheuristic Algorithm for Solving Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Biomimetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Calgary","keywords":"Population; Metaheuristic; Mathematical optimization; Computer science; Optimization problem; Process (computing); Continuous optimization; Algorithm; Engineering optimization; Test suite; Multi-objective optimization; Test functions for optimization; Multi-swarm optimization; Machine learning; Mathematics; Test case","score_opus":0.053851505432997965,"score_gpt":0.307190129778605,"score_spread":0.25333862434560706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387265282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028158922,0.0008051579,0.9934797,0.00014551196,0.00008430088,0.00006728338,0.000026593902,0.0002755203,0.002299944],"genre_scores_gemma":[0.10972068,0.0014196621,0.88296294,0.0005908232,0.00017443375,0.00080758147,0.00018514271,0.00029813495,0.0038405138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992624,0.00028866503,0.000038285092,0.00009431636,0.00026173843,0.00005469305],"domain_scores_gemma":[0.9995159,0.0002707728,0.00007453073,0.00003961598,0.000074500465,0.000024660365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359619,0.0012190354,0.001419977,0.001211003,0.0006216911,0.0010419388,0.001708901,0.0016356433,0.0017615778],"category_scores_gemma":[0.0022769829,0.00052695454,0.0012896034,0.001080659,0.0008225627,0.0011207194,0.0013647629,0.0016345917,0.0005158746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008794008,0.00011296555,0.0009062381,0.0003630157,0.00021356372,0.0000665784,0.00011221437,0.7793246,0.003761339,0.027735421,0.0041733454,0.18314284],"study_design_scores_gemma":[0.000040610852,0.00007427298,0.00014365716,0.000042955748,0.000028392773,0.000042851658,0.000017081404,0.9837473,0.0006853045,0.007617321,0.0075452733,0.000014989204],"about_ca_topic_score_codex":0.0036966095,"about_ca_topic_score_gemma":0.0034094008,"teacher_disagreement_score":0.0036966095,"about_ca_system_score_codex":0.0006988315,"about_ca_system_score_gemma":0.0013914899,"threshold_uncertainty_score":0.0073502064},"labels":[],"label_agreement":null},{"id":"W4387632706","doi":"","title":"Mixing Techniques to Compute Derivatives of semi-numerical models: Application to Magnetic Nano Switch Optimization","year":2011,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Center for Diagnosis and Research on Alzheimer's Disease","funders":"","keywords":"Nano-; Mixing (physics); Computer science; Materials science; Physics; Composite material","score_opus":0.023032758546071178,"score_gpt":0.24493156363230273,"score_spread":0.22189880508623155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387632706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012752784,0.000114025046,0.98406434,0.00013894467,0.000043391603,0.00004596259,0.00003349528,0.00037732153,0.0024296755],"genre_scores_gemma":[0.39345056,0.00026299234,0.59722906,0.00018011412,0.00008663317,0.0005126454,0.00020007689,0.0010266459,0.0070513664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968183,0.00014830944,0.0000183189,0.000031867417,0.00009316396,0.000026420908],"domain_scores_gemma":[0.9971059,0.002137743,0.00020314996,0.00016782945,0.00027060416,0.00011471364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019860128,0.0012376733,0.0010868525,0.0011767168,0.00088272116,0.0013488303,0.001416881,0.0024700651,0.004133552],"category_scores_gemma":[0.005932019,0.0010901375,0.0011799623,0.0009357299,0.0010778075,0.0015615054,0.0016380122,0.0026392106,0.0007306485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065387714,0.00009728192,0.00028869841,0.000074632466,0.00003289023,0.0000385629,0.000068179266,0.9461289,0.0028430377,0.020905962,0.0006311601,0.02882518],"study_design_scores_gemma":[0.000002718023,0.000004141709,0.00000948126,0.000001497769,9.341708e-7,0.0000016515369,0.0000015083979,0.9986719,0.0001650427,0.0010288397,0.00011085347,0.0000015090712],"about_ca_topic_score_codex":0.0041677463,"about_ca_topic_score_gemma":0.0043948335,"teacher_disagreement_score":0.0041677463,"about_ca_system_score_codex":0.0009474755,"about_ca_system_score_gemma":0.0013300704,"threshold_uncertainty_score":0.013828099},"labels":[],"label_agreement":null},{"id":"W4387736682","doi":"10.36227/techrxiv.24320203.v1","title":"Self-Adaptive Spherical Search with Constrained Multi-Operator Differential Evolution (SASS-CMODE) for nonlinear programming problems","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Sass; Mathematical optimization; Computer science; Differential evolution; Operator (biology); Metaheuristic; Nonlinear system; Algorithm; Mathematics","score_opus":0.06809769907260968,"score_gpt":0.3194999808892484,"score_spread":0.2514022818166387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387736682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004948378,0.00031284793,0.9923528,0.00013125615,0.00003499488,0.000050413055,0.000013927277,0.0000923085,0.0020630122],"genre_scores_gemma":[0.24544762,0.000749001,0.7490151,0.0002757208,0.000079534926,0.00065255613,0.00014843246,0.00016356962,0.0034684953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995308,0.00022228487,0.000022453594,0.000047780966,0.00015104932,0.000025622057],"domain_scores_gemma":[0.9987435,0.000929611,0.000090176974,0.0000562246,0.00013914541,0.00004144161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011200012,0.0010612169,0.0007960477,0.0006391089,0.000355702,0.0006021598,0.0009860562,0.0011762634,0.00156636],"category_scores_gemma":[0.0033625881,0.0004548981,0.0010276258,0.00091955543,0.00080302806,0.00064945617,0.0014729068,0.0013554139,0.0002999673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025177287,0.000029751487,0.00034990342,0.000104000384,0.000048633952,0.00004981862,0.000049564944,0.94421023,0.0015777505,0.020387717,0.0007872467,0.032380216],"study_design_scores_gemma":[0.0000039656607,0.000011155655,0.000023536299,0.0000039242173,0.0000019042841,0.000006277559,0.0000020579894,0.9976259,0.00013103378,0.0018074008,0.00038076282,0.0000021954263],"about_ca_topic_score_codex":0.0034755275,"about_ca_topic_score_gemma":0.0028789022,"teacher_disagreement_score":0.0034755275,"about_ca_system_score_codex":0.0007073783,"about_ca_system_score_gemma":0.0013358085,"threshold_uncertainty_score":0.0069105625},"labels":[],"label_agreement":null},{"id":"W4387873795","doi":"10.3390/biomimetics8060507","title":"Lyrebird Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Biomimetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Metaheuristic; Algorithm; Benchmark (surveying); Computer science; Mathematical optimization; Test suite; Optimization problem; Suite; Mathematics; Test case; Machine learning","score_opus":0.04427160285548675,"score_gpt":0.2948410349910398,"score_spread":0.25056943213555305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387873795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063762646,0.0012234723,0.98679626,0.00022755249,0.00008928403,0.00010657514,0.0001009654,0.00064462534,0.0044349832],"genre_scores_gemma":[0.10421611,0.0011841643,0.8876662,0.00047355035,0.00009345912,0.0008191972,0.0005149452,0.00023414179,0.0047982885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.00015346751,0.00003254711,0.0000694192,0.00013466994,0.00003425982],"domain_scores_gemma":[0.99967754,0.00016211747,0.000052541865,0.000028322462,0.00006292487,0.000016531974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009174922,0.0012508222,0.0011482851,0.0010390922,0.00045190385,0.0009768547,0.0015839626,0.001467899,0.00201017],"category_scores_gemma":[0.0013865861,0.00039372212,0.001173536,0.0010358193,0.00052716705,0.0008901648,0.0008741574,0.0014460704,0.0007372796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009367017,0.00011911761,0.00094216637,0.00029833545,0.00018871542,0.00009594227,0.00006522279,0.8227984,0.0053400574,0.015462011,0.0045527313,0.15004364],"study_design_scores_gemma":[0.000037496644,0.00005889696,0.00013362938,0.000025547235,0.000021814894,0.000041555933,0.000011145337,0.98920804,0.0009631726,0.0032245906,0.0062629995,0.000010963424],"about_ca_topic_score_codex":0.0031052448,"about_ca_topic_score_gemma":0.003251774,"teacher_disagreement_score":0.0031052448,"about_ca_system_score_codex":0.00066715234,"about_ca_system_score_gemma":0.0014453578,"threshold_uncertainty_score":0.0067246556},"labels":[],"label_agreement":null},{"id":"W4387917828","doi":"10.1007/978-3-031-44505-7","title":"Learning and Intelligent Optimization","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ioannina; Università degli Studi di Ferrara; Consejo Superior de Investigaciones Científicas; Università di Bologna; Università degli Studi di Cagliari; Centre National de la Recherche Scientifique; Universite Angers; Sapienza Università di Roma; Khalifa University of Science, Technology and Research; Brown University; Università degli Studi di Trento; Universität Bielefeld; Università degli Studi di Milano-Bicocca; Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences; Universitat Pompeu Fabra; University of Crete; University of Toronto; Indian Council of Agricultural Research; Wilfrid Laurier University; Università degli Studi di Milano; Université de Lorraine; University of Pittsburgh; Università degli Studi di Udine; Università della Calabria; Università degli Studi di Camerino; KU Leuven; Technische Universiteit Eindhoven; Université de Lille; University of Patras; University of Southern California","keywords":"Computer science; Artificial intelligence; Optimization problem; Mathematical optimization; Algorithm; Mathematics","score_opus":0.023102495083191107,"score_gpt":0.2945752562375587,"score_spread":0.2714727611543676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387917828","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045605707,0.0711614,0.4725364,0.004981981,0.002159645,0.000060816972,0.00026417838,0.00078783854,0.4434871],"genre_scores_gemma":[0.15725176,0.053380482,0.17107037,0.0018147408,0.0031863512,0.00030245289,0.00068239064,0.0008348929,0.61147654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979633,0.000050495953,0.000008013123,0.00003502439,0.00009629894,0.0000138424375],"domain_scores_gemma":[0.9997626,0.00013605082,0.000013859248,0.00004689476,0.000029810906,0.000010876931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031891704,0.00092227553,0.0011191842,0.000605055,0.00032972716,0.0013703221,0.00056472287,0.000685971,0.016731339],"category_scores_gemma":[0.00106021,0.00034471316,0.00048292798,0.00107972,0.0011615526,0.0017478832,0.00093787786,0.001694588,0.0054914667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002624735,0.0000519824,0.00018009776,0.00037758483,0.000058259284,0.000039733928,0.000102841455,0.041630402,0.0010388768,0.457539,0.09826066,0.4006943],"study_design_scores_gemma":[0.000011464082,0.00003759376,0.00037196427,0.00015710056,0.000021398942,0.000101674836,0.00003703984,0.060898717,0.0009618489,0.7092872,0.22809829,0.000015754698],"about_ca_topic_score_codex":0.0006258553,"about_ca_topic_score_gemma":0.0008829575,"teacher_disagreement_score":0.016731339,"about_ca_system_score_codex":0.0006237232,"about_ca_system_score_gemma":0.00036743857,"threshold_uncertainty_score":0.05597192},"labels":[],"label_agreement":null},{"id":"W4388101121","doi":"10.1007/s00500-023-09289-0","title":"Evolutionary ensembles based on prioritized aggregation operator","year":2023,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Operator (biology); Computer science; Evolutionary computation; Evolutionary algorithm; Artificial intelligence; Biology","score_opus":0.025724361350440123,"score_gpt":0.29538116785600416,"score_spread":0.269656806505564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388101121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045901045,0.0003259077,0.9480229,0.0001597452,0.00016879586,0.000054901837,0.00003140938,0.00018179438,0.005153477],"genre_scores_gemma":[0.69667846,0.00030974616,0.29690725,0.00016629152,0.00016956599,0.00018063224,0.00014206003,0.00009773285,0.005348102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.00022083418,0.000032169064,0.00008395889,0.00027512526,0.00007417908],"domain_scores_gemma":[0.99891496,0.0004545088,0.00007263345,0.00013222785,0.00035327708,0.00007234234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012485404,0.0005999708,0.001091005,0.0008069886,0.0007341229,0.0008999466,0.001073834,0.00094613223,0.002111429],"category_scores_gemma":[0.0025697092,0.00032636887,0.00079267204,0.0009097808,0.0003428143,0.0010665212,0.0010508723,0.00090874155,0.000306185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013291952,0.00015631785,0.001612514,0.000074919626,0.00017975678,0.00015596181,0.00012794649,0.7793056,0.010784153,0.041036114,0.0026554083,0.16377836],"study_design_scores_gemma":[0.0000068163017,0.000030491585,0.0001794409,0.0000039759598,0.000014170022,0.00003247072,0.0000085725005,0.9948455,0.0005728249,0.0039118575,0.0003886574,0.0000051665547],"about_ca_topic_score_codex":0.0015411965,"about_ca_topic_score_gemma":0.002039705,"teacher_disagreement_score":0.002111429,"about_ca_system_score_codex":0.00038587447,"about_ca_system_score_gemma":0.0005915412,"threshold_uncertainty_score":0.0070634484},"labels":[],"label_agreement":null},{"id":"W4388294700","doi":"10.1016/j.eswa.2023.122335","title":"Lévy Arithmetic Algorithm: An enhanced metaheuristic algorithm and its application to engineering optimization","year":2023,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Metaheuristic; Mathematics; Benchmark (surveying); Mathematical optimization; Computer science; Arithmetic; Optimization problem","score_opus":0.015276394716650077,"score_gpt":0.28143076615970714,"score_spread":0.26615437144305704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388294700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008489339,0.00072799466,0.984874,0.00026761333,0.00018021518,0.0000382262,0.000029894636,0.00025933643,0.0051332777],"genre_scores_gemma":[0.28170586,0.0014872185,0.7061618,0.00031366604,0.00030544944,0.00024020887,0.00011020578,0.00021164202,0.009463976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999653,0.00011954651,0.0000150097785,0.000026288346,0.00016496207,0.000021209573],"domain_scores_gemma":[0.9994491,0.00023845646,0.000042695032,0.000041256135,0.00020038745,0.000028208688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083131273,0.0007009512,0.0009215662,0.001033622,0.0003677436,0.0008417472,0.0011267456,0.0014242621,0.0018070207],"category_scores_gemma":[0.0019603,0.00023451833,0.00065594446,0.001543431,0.0005632414,0.0010162615,0.0008632874,0.0011035227,0.00058984937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011186528,0.00008422457,0.00050510553,0.00012741335,0.00008956694,0.00011945624,0.000062891224,0.73182076,0.0079496885,0.06537465,0.0044078887,0.1893465],"study_design_scores_gemma":[0.000014823894,0.000033034732,0.00007816938,0.000005106996,0.000010838465,0.000028452065,0.0000043163323,0.98778915,0.0009435068,0.008616462,0.0024655168,0.000010583182],"about_ca_topic_score_codex":0.0015551524,"about_ca_topic_score_gemma":0.0014805511,"teacher_disagreement_score":0.0018070207,"about_ca_system_score_codex":0.00047030565,"about_ca_system_score_gemma":0.0008183078,"threshold_uncertainty_score":0.006045103},"labels":[],"label_agreement":null},{"id":"W4388533824","doi":"10.7717/peerj-cs.1557","title":"An improved hybrid whale optimization algorithm for global optimization and engineering design problems","year":2023,"lang":"en","type":"article","venue":"PeerJ Computer Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Benchmark (surveying); Computer science; Differential evolution; Particle swarm optimization; Mathematical optimization; Evolutionary algorithm; Engineering optimization; Metaheuristic; Population; Multi-objective optimization; Algorithm; Optimization problem; Machine learning; Mathematics","score_opus":0.026084071971882544,"score_gpt":0.2807383630520047,"score_spread":0.25465429108012216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388533824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006963773,0.00038713403,0.9878385,0.00012968133,0.00006116757,0.000047875,0.00004566801,0.00035755287,0.0041685603],"genre_scores_gemma":[0.26787192,0.00057036546,0.7200235,0.00037483234,0.00009053779,0.00053101877,0.00039307654,0.00027438492,0.009870348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995937,0.00010943076,0.000022099772,0.00006798522,0.00016669689,0.000040210056],"domain_scores_gemma":[0.9996147,0.00018596365,0.000035452307,0.000041825646,0.00009859111,0.000023463333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081843877,0.0010894316,0.001064991,0.0010076646,0.0004844423,0.0009802969,0.001557212,0.0014330121,0.0040634517],"category_scores_gemma":[0.0016609431,0.0004621192,0.0011141675,0.0009596239,0.00050852477,0.0008779337,0.0012752643,0.0009362302,0.0009968323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005247867,0.00004933955,0.00064255326,0.00012199945,0.00007097804,0.00011155535,0.00005404253,0.88152605,0.0027518512,0.011146215,0.002563364,0.1009096],"study_design_scores_gemma":[0.00001279551,0.000019651252,0.00006271032,0.000005843787,0.000006809053,0.000024672108,0.0000058503842,0.9957675,0.00031725073,0.0017213366,0.002051064,0.0000046604646],"about_ca_topic_score_codex":0.0040341634,"about_ca_topic_score_gemma":0.004716616,"teacher_disagreement_score":0.0040634517,"about_ca_system_score_codex":0.00045714618,"about_ca_system_score_gemma":0.0010528098,"threshold_uncertainty_score":0.013593614},"labels":[],"label_agreement":null},{"id":"W4388667916","doi":"10.1007/s11721-023-00229-0","title":"Decomposition and merging cooperative particle swarm optimization with random grouping for large-scale optimization problems","year":2023,"lang":"en","type":"article","venue":"Swarm Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Particle swarm optimization; Benchmark (surveying); Mathematics; Scaling; Metaheuristic; Decomposition; Mathematical optimization; Variable (mathematics); Combinatorics; Scale (ratio); Algorithm; Physics","score_opus":0.02775602502805102,"score_gpt":0.31142738325262886,"score_spread":0.28367135822457784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388667916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01773141,0.00020724542,0.97995305,0.00008624745,0.00004782837,0.000052774827,0.000012107723,0.00013317002,0.0017760593],"genre_scores_gemma":[0.39991063,0.00022997387,0.596464,0.00013139543,0.0000881571,0.00034305113,0.00012928779,0.00014946828,0.0025540947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990915,0.00047830504,0.0000433314,0.000120473655,0.00018044958,0.00008598474],"domain_scores_gemma":[0.9984988,0.00085377693,0.00016093641,0.0001844918,0.00021109325,0.0000909452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029123293,0.0011368538,0.0016623426,0.0011151546,0.00078736054,0.0009951489,0.0017748432,0.0016748011,0.0017537677],"category_scores_gemma":[0.0046929414,0.0009262423,0.0015873119,0.0013023645,0.0009699159,0.0017202958,0.0022612056,0.0011701271,0.0003734238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012263223,0.00009418228,0.000376668,0.0000665851,0.00007344849,0.000043655247,0.00009129939,0.9505314,0.001885137,0.009077068,0.0007700008,0.036867995],"study_design_scores_gemma":[0.00000872611,0.000025842062,0.00003778085,0.0000025734084,0.00000704154,0.0000048155794,0.000006364942,0.99802315,0.00016348831,0.0015623777,0.00015514408,0.0000026054643],"about_ca_topic_score_codex":0.0032010893,"about_ca_topic_score_gemma":0.0025439237,"teacher_disagreement_score":0.0032010893,"about_ca_system_score_codex":0.0006404589,"about_ca_system_score_gemma":0.0009619436,"threshold_uncertainty_score":0.015402019},"labels":[],"label_agreement":null},{"id":"W4389671032","doi":"10.1016/j.asoc.2023.111141","title":"Improved binary differential evolution with dimensionality reduction mechanism and binary stochastic search for feature selection","year":2023,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dimensionality reduction; Feature selection; Binary number; Support vector machine; Classifier (UML); Curse of dimensionality; Binary classification; Artificial intelligence; Pattern recognition (psychology); Local optimum; Differential evolution; Feature vector; Machine learning; Data mining; Algorithm; Mathematics","score_opus":0.017518211048133732,"score_gpt":0.26815059418388637,"score_spread":0.25063238313575265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389671032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025667893,0.0005790312,0.9712957,0.00019973566,0.00006591573,0.00006986285,0.000054672117,0.00036784654,0.0016994199],"genre_scores_gemma":[0.4700421,0.0005401756,0.5239406,0.0003343153,0.00008138914,0.0005207499,0.00042676998,0.00009143377,0.0040223324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999006,0.00027339117,0.00008340258,0.00013792736,0.000427691,0.00007172753],"domain_scores_gemma":[0.99921286,0.0003485475,0.000080137834,0.0000712796,0.00025450074,0.00003251529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013705068,0.0007104841,0.0011898142,0.0012517858,0.00042995068,0.00069511216,0.0013251449,0.0009266846,0.0012071461],"category_scores_gemma":[0.0031669752,0.00041032207,0.0010373114,0.001464506,0.00049393845,0.0007988902,0.00090653426,0.000839114,0.0003036029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018043935,0.00018114419,0.004880082,0.00020278715,0.00023030613,0.0002394957,0.00020040157,0.5525504,0.020913709,0.029620612,0.0034440607,0.38735652],"study_design_scores_gemma":[0.000025516782,0.00004673237,0.00047298096,0.0000061918267,0.000014088144,0.00006587178,0.00000586924,0.9947331,0.0015558304,0.0019243462,0.0011379436,0.000011480734],"about_ca_topic_score_codex":0.0033731672,"about_ca_topic_score_gemma":0.0022088343,"teacher_disagreement_score":0.0033731672,"about_ca_system_score_codex":0.0005883247,"about_ca_system_score_gemma":0.00091264764,"threshold_uncertainty_score":0.0072479844},"labels":[],"label_agreement":null},{"id":"W4389923272","doi":"10.3390/biomimetics8080619","title":"Giant Armadillo Optimization: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Biomimetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Metaheuristic; Armadillo; Mathematical optimization; Computer science; Optimization algorithm; Algorithm; Mathematics; Biology; Ecology","score_opus":0.04705691919722536,"score_gpt":0.2941826078632756,"score_spread":0.24712568866605025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389923272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007766276,0.0015428382,0.9853367,0.00028062586,0.00011441293,0.00007497711,0.000066677436,0.0004165409,0.0044009173],"genre_scores_gemma":[0.21317753,0.0019605202,0.7782227,0.0005939151,0.0001369159,0.0006585603,0.00034623258,0.0002540025,0.0046496545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999602,0.00013626787,0.000023858087,0.00005584231,0.00014928891,0.000032788736],"domain_scores_gemma":[0.99970776,0.0001616065,0.000044047436,0.000023230212,0.000046899248,0.000016308604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000752585,0.0011197793,0.0009914383,0.0010141887,0.00036858983,0.0007700139,0.0012351943,0.0013914111,0.0014113944],"category_scores_gemma":[0.0012463406,0.00040099563,0.0012018335,0.0011643021,0.0006703051,0.0006867517,0.0008914592,0.0012701215,0.00038003866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060618226,0.00005670526,0.0007226529,0.0002861719,0.00016470545,0.00009962604,0.000054924367,0.8790125,0.004351848,0.014042969,0.0028718405,0.098275475],"study_design_scores_gemma":[0.000027285038,0.000049141414,0.00011942838,0.000023883853,0.000023446684,0.000045235887,0.000010722437,0.9898074,0.0006876094,0.0042437864,0.004952476,0.000009547899],"about_ca_topic_score_codex":0.002908387,"about_ca_topic_score_gemma":0.0026713312,"teacher_disagreement_score":0.002908387,"about_ca_system_score_codex":0.0006282048,"about_ca_system_score_gemma":0.0010131699,"threshold_uncertainty_score":0.005782962},"labels":[],"label_agreement":null},{"id":"W4390071945","doi":"10.1109/iccsm60247.2023.00019","title":"Hybrid Differential Evolution and Particle Swarm Optimization for Speech Emotion Classification","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Particle swarm optimization; Differential evolution; Computer science; Differential (mechanical device); Artificial intelligence; Speech recognition; Multi-swarm optimization; Metaheuristic; Machine learning; Engineering; Aerospace engineering","score_opus":0.048281520975011205,"score_gpt":0.3028147372842428,"score_spread":0.2545332163092316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390071945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026976764,0.0005477586,0.96952474,0.00017141293,0.000068284804,0.00004358764,0.000018218496,0.00020658094,0.0024426517],"genre_scores_gemma":[0.6114914,0.00044403816,0.38320673,0.00021502642,0.00008936876,0.0002824331,0.00011110926,0.0000668383,0.0040930617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996412,0.00012212027,0.00002067796,0.00006440837,0.0001180323,0.00003354604],"domain_scores_gemma":[0.9995844,0.00025074865,0.000036690362,0.000024889117,0.00008513039,0.00001821248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092596037,0.00084421143,0.0010121313,0.0008017153,0.00035941578,0.00079018023,0.0008607313,0.00095057144,0.0007716318],"category_scores_gemma":[0.0016956103,0.0003728063,0.0007842776,0.000709451,0.00044645538,0.0005758069,0.0006934488,0.00068442017,0.0002024498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010199515,0.00010285817,0.0012839455,0.00009320774,0.00015407434,0.00008370512,0.00010850733,0.84153366,0.0067434614,0.006647762,0.0008581043,0.14228876],"study_design_scores_gemma":[0.000005259848,0.00001938861,0.000114597045,0.0000021725946,0.0000052571804,0.00000918973,0.000005284883,0.99872726,0.00034286664,0.00049178785,0.00027412307,0.0000026889127],"about_ca_topic_score_codex":0.0024281323,"about_ca_topic_score_gemma":0.0015307283,"teacher_disagreement_score":0.0024281323,"about_ca_system_score_codex":0.00048028622,"about_ca_system_score_gemma":0.00040673124,"threshold_uncertainty_score":0.0048969984},"labels":[],"label_agreement":null},{"id":"W4390481469","doi":"10.1109/ssci52147.2023.10372026","title":"Opposition-Based Crossover Operation for Differential Evolution Algorithm","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Brock University; Ontario Tech University","funders":"","keywords":"Crossover; Differential evolution; Benchmark (surveying); Computer science; Mathematical optimization; Algorithm; Population; Evolutionary algorithm; Artificial intelligence; Mathematics","score_opus":0.02681508219606496,"score_gpt":0.30992994011503455,"score_spread":0.2831148579189696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390481469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012644347,0.00046440374,0.9781163,0.00012326927,0.00015772502,0.00010494274,0.00004132049,0.00033967677,0.0080080815],"genre_scores_gemma":[0.55299246,0.00077613705,0.4372056,0.00021700468,0.000103051214,0.000613835,0.00022913901,0.00011260814,0.0077502355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994448,0.00016752638,0.000035773242,0.000082869985,0.00022715137,0.0000418665],"domain_scores_gemma":[0.99972326,0.00012551803,0.000034366727,0.000032559303,0.00007247037,0.000011912896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065995794,0.00050072634,0.0007730733,0.00053930277,0.00033851343,0.0005530213,0.0009562064,0.00068977557,0.0019585758],"category_scores_gemma":[0.0015429541,0.00015178474,0.0005060746,0.0007341177,0.0004596401,0.0004534359,0.0005746254,0.00095989916,0.00038281103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025623856,0.00016318764,0.0013752653,0.0004457987,0.00012219694,0.00062381424,0.00030843428,0.3716919,0.051977858,0.104235955,0.005463655,0.46333572],"study_design_scores_gemma":[0.00010592983,0.0002467868,0.0006401578,0.00003519894,0.000041698844,0.0005166555,0.00002771809,0.9509256,0.014495464,0.012484429,0.020443615,0.000036732694],"about_ca_topic_score_codex":0.0005152512,"about_ca_topic_score_gemma":0.00037709667,"teacher_disagreement_score":0.0019585758,"about_ca_system_score_codex":0.00034418693,"about_ca_system_score_gemma":0.00037537294,"threshold_uncertainty_score":0.0065521},"labels":[],"label_agreement":null},{"id":"W4391145932","doi":"10.3390/biomimetics9020065","title":"Pufferfish Optimization Algorithm: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Biomimetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Metaheuristic; Algorithm; Test suite; Computer science; Evolutionary algorithm; Optimization algorithm; Optimization problem; Mathematical optimization; Artificial intelligence; Test case; Mathematics; Machine learning","score_opus":0.0328331190701672,"score_gpt":0.2881612102099395,"score_spread":0.2553280911397723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391145932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011365639,0.0017943855,0.9789627,0.0003935413,0.00014834215,0.00012320018,0.00014849643,0.0007444008,0.00631938],"genre_scores_gemma":[0.15095136,0.0016430772,0.83838475,0.00053492835,0.000105970015,0.00076019,0.0005958879,0.00030223926,0.0067215967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995989,0.00012190218,0.000029793862,0.00006660999,0.00014470002,0.000038086877],"domain_scores_gemma":[0.99963856,0.00017631754,0.00005144274,0.000035935227,0.00007812048,0.000019477107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083393767,0.0012830384,0.0012143112,0.0010510805,0.00051215244,0.000982467,0.0016467575,0.0017587042,0.0027240252],"category_scores_gemma":[0.0016741347,0.00045097218,0.0012898177,0.0012512255,0.00065125857,0.0011785823,0.0011453115,0.0015243269,0.00066555734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007369729,0.00007689331,0.0009402679,0.0002894742,0.00018892955,0.00009270354,0.000058257898,0.8380838,0.0037802223,0.013904048,0.004834717,0.13767695],"study_design_scores_gemma":[0.000040015075,0.00005117245,0.0001406795,0.000026413265,0.00002272278,0.00005602406,0.000012887536,0.9880838,0.0007885713,0.003993694,0.0067738616,0.000010098531],"about_ca_topic_score_codex":0.004276724,"about_ca_topic_score_gemma":0.0038770572,"teacher_disagreement_score":0.004276724,"about_ca_system_score_codex":0.0007420682,"about_ca_system_score_gemma":0.0019403851,"threshold_uncertainty_score":0.009112775},"labels":[],"label_agreement":null},{"id":"W4391249768","doi":"10.1109/la-cci58595.2023.10409454","title":"Footprinting the Behaviour of Particle Swarm Optimization with Increasing Dimensionality","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Curse of dimensionality; Particle swarm optimization; Footprinting; Mathematical optimization; Multi-swarm optimization; Computer science; Swarm behaviour; Materials science; Algorithm; Artificial intelligence; Mathematics; Chemistry; DNA","score_opus":0.03357183161493484,"score_gpt":0.29060736759970845,"score_spread":0.25703553598477363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391249768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6660856,0.0010974172,0.31603462,0.00081620185,0.00008705655,0.00012714895,0.00015770942,0.00054198166,0.015052268],"genre_scores_gemma":[0.96241736,0.0003307052,0.036303334,0.00004778407,0.000016522508,0.000056739253,0.00008105354,0.000056523764,0.00069002167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928975,0.0002629891,0.000057957237,0.00010005215,0.00023596732,0.000053198248],"domain_scores_gemma":[0.99601483,0.002397524,0.000395686,0.00064451824,0.00047286783,0.000074488285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011955354,0.0003704399,0.0004255289,0.0006108988,0.0002658222,0.000952399,0.00030226624,0.00043411914,0.00078625913],"category_scores_gemma":[0.009875802,0.00022227751,0.000301912,0.0004958223,0.00071819715,0.0013284354,0.0006625866,0.000663822,0.00019318848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002695459,0.00018652373,0.023836646,0.00047259565,0.00016624415,0.0002922906,0.001430022,0.73620224,0.031571526,0.026421914,0.0016158894,0.17753452],"study_design_scores_gemma":[0.000012416015,0.00017732257,0.012489909,0.00003882354,0.000022583714,0.00014456369,0.00023115161,0.9624557,0.010291698,0.011629199,0.0024702798,0.000036317997],"about_ca_topic_score_codex":0.001743513,"about_ca_topic_score_gemma":0.0011755689,"teacher_disagreement_score":0.001743513,"about_ca_system_score_codex":0.0003308759,"about_ca_system_score_gemma":0.00045320016,"threshold_uncertainty_score":0.006322682},"labels":[],"label_agreement":null},{"id":"W4391266734","doi":"10.1109/la-cci58595.2023.10409325","title":"The Danger of Metaphors for Metaheuristic Design","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Metaheuristic; Metaphor; Computer science; Parallel metaheuristic; Evolutionary computation; Swarm behaviour; Artificial intelligence; Swarm intelligence; Code (set theory); Machine learning; Particle swarm optimization; Programming language; Philosophy","score_opus":0.08316847308036736,"score_gpt":0.33462481932125543,"score_spread":0.2514563462408881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391266734","genre_codex":"methods","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011033504,0.011512837,0.8740499,0.040892277,0.0018317408,0.00020187668,0.00009149381,0.0006724494,0.059714027],"genre_scores_gemma":[0.31050155,0.006936507,0.66312075,0.007632155,0.0010252466,0.001083202,0.000076372846,0.00048726334,0.009136977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98869973,0.0077153738,0.00047301326,0.00071928976,0.0021193952,0.00027323767],"domain_scores_gemma":[0.9886613,0.0069906116,0.0006798148,0.0021964202,0.000955949,0.0005159179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0138588,0.0015123175,0.0015822072,0.0018618656,0.0029243408,0.0070701325,0.0030692648,0.0045682206,0.0039086663],"category_scores_gemma":[0.023827545,0.0011302389,0.0012558098,0.0010507702,0.022710241,0.012828542,0.0052770195,0.011515149,0.0015940199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024907207,0.00002002125,0.000095444666,0.00020703311,0.000026080506,0.00006089566,0.0011081203,0.0040579345,0.0005865963,0.97972155,0.0018704544,0.012221013],"study_design_scores_gemma":[0.000038421425,0.00007733605,0.00005072964,0.00014353501,0.000011323587,0.00016335516,0.00041260174,0.009882366,0.00045922006,0.9347622,0.05396405,0.00003485224],"about_ca_topic_score_codex":0.0006979865,"about_ca_topic_score_gemma":0.00061417476,"teacher_disagreement_score":0.0138588,"about_ca_system_score_codex":0.0021612234,"about_ca_system_score_gemma":0.0023708392,"threshold_uncertainty_score":0.07329321},"labels":[],"label_agreement":null},{"id":"W4391270090","doi":"10.1007/s10489-023-05073-7","title":"A Memetic Approach to Multi-Disciplinary Design and Numerical Optimization Problems using Intensify Slime Mould Optimizer","year":2024,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University; University of Calgary","funders":"","keywords":"Metaheuristic; Mathematical optimization; Computer science; Memetic algorithm; Convergence (economics); Parallel metaheuristic; Local search (optimization); Algorithm; Meta-optimization; Mathematics","score_opus":0.12489492499090206,"score_gpt":0.33802603347124355,"score_spread":0.2131311084803415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391270090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012032408,0.0005715592,0.97981286,0.00024707586,0.00012200189,0.00005960607,0.000014895764,0.00013511373,0.0070043723],"genre_scores_gemma":[0.32190907,0.0006211591,0.6691852,0.00026261606,0.0001170909,0.0003568737,0.000038098846,0.00008103691,0.0074288477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997665,0.00009777754,0.000012792444,0.000018435496,0.00008577698,0.00001871617],"domain_scores_gemma":[0.9996879,0.00016906847,0.00003234292,0.000026061754,0.00006968417,0.0000149124935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010445993,0.00053714175,0.00075506343,0.0009943467,0.0006823068,0.00080106925,0.0012233725,0.0011774416,0.0014575175],"category_scores_gemma":[0.0016092092,0.0004164667,0.00079569354,0.00085558265,0.0010149064,0.00056161603,0.0010161003,0.0009853588,0.00019514741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000468335,0.000051494942,0.0002864326,0.000088983084,0.00007064704,0.00007537837,0.000059111244,0.91424346,0.0028434426,0.041112125,0.00078385626,0.040338155],"study_design_scores_gemma":[0.00001054432,0.000030260286,0.000047889982,0.000007260813,0.000009177687,0.000011275278,0.0000051626216,0.9923983,0.0004175786,0.0059992643,0.001058713,0.000004552801],"about_ca_topic_score_codex":0.0027587202,"about_ca_topic_score_gemma":0.00313362,"teacher_disagreement_score":0.0027587202,"about_ca_system_score_codex":0.0006753214,"about_ca_system_score_gemma":0.0007843232,"threshold_uncertainty_score":0.0055244565},"labels":[],"label_agreement":null},{"id":"W4391407400","doi":"10.1007/978-3-031-53025-8","title":"Optimization, Learning Algorithms and Applications","year":2024,"lang":"en","type":"book","venue":"Communications in computer and information science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Uniwersytet Opolski; Slovenská technická univerzita v Bratislave; Université de Reims Champagne-Ardenne; Kauno Technologijos Universitetas; Instituto Politécnico de Bragança; Universidade de Trás-os-Montes e Alto Douro; Instituto Politécnico do Porto; Universidade do Porto; Università degli Studi di Genova; Hanzehogeschool Groningen; Université de Sherbrooke; Universidade do Minho; Università degli Studi di Parma; Universidad de León; Politechnika Opolska; Universitatea Tehnică „Gheorghe Asachi” din Iaşi; Université de Lorraine","keywords":"Computer science; Artificial intelligence; Machine learning; Information retrieval","score_opus":0.030866000400886245,"score_gpt":0.3185919237356132,"score_spread":0.2877259233347269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391407400","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018422296,0.36027107,0.2440186,0.004396742,0.011933837,0.00014725844,0.0006279196,0.0013955513,0.37536678],"genre_scores_gemma":[0.025102308,0.19094867,0.117407344,0.0024068665,0.010213397,0.00066225266,0.0008995296,0.0011295085,0.65123016],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992698,0.00014757433,0.00003578387,0.00010976515,0.00040032697,0.000036786605],"domain_scores_gemma":[0.999246,0.00041523858,0.000038918854,0.00011467395,0.00014987387,0.000035343914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067621755,0.0023035675,0.0028623,0.0017089074,0.0005762491,0.003745668,0.0013523219,0.0019123309,0.037391033],"category_scores_gemma":[0.002517278,0.0007035207,0.00081617053,0.0059631346,0.0013776578,0.0028527663,0.0017339612,0.0033882437,0.02115622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004414046,0.00009920339,0.00017237558,0.0015547492,0.00007655659,0.0000654151,0.000085396736,0.020665089,0.0013327766,0.09209016,0.3353649,0.5484492],"study_design_scores_gemma":[0.0000282166,0.00007702797,0.00076574564,0.00066871964,0.00004888754,0.00028556195,0.0000848439,0.043567196,0.00052589993,0.20504981,0.7488649,0.000033187505],"about_ca_topic_score_codex":0.0017338605,"about_ca_topic_score_gemma":0.0026318128,"teacher_disagreement_score":0.037391033,"about_ca_system_score_codex":0.0011152825,"about_ca_system_score_gemma":0.0011771736,"threshold_uncertainty_score":0.12508547},"labels":[],"label_agreement":null},{"id":"W4391488220","doi":"10.1007/978-3-031-53036-4","title":"Optimization, Learning Algorithms and Applications","year":2024,"lang":"en","type":"book","venue":"Communications in computer and information science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Uniwersytet Opolski; Slovenská technická univerzita v Bratislave; Université de Reims Champagne-Ardenne; Kauno Technologijos Universitetas; Instituto Politécnico de Bragança; Universidade de Trás-os-Montes e Alto Douro; Instituto Politécnico do Porto; Universidade do Porto; Università degli Studi di Genova; Hanzehogeschool Groningen; Université de Sherbrooke; Universidade do Minho; Università degli Studi di Parma; Universidad de León; Politechnika Opolska; Universitatea Tehnică „Gheorghe Asachi” din Iaşi; Université de Lorraine","keywords":"Computer science; Artificial intelligence; Algorithm","score_opus":0.030866000400886245,"score_gpt":0.3185919237356132,"score_spread":0.2877259233347269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391488220","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018422296,0.36027107,0.2440186,0.004396742,0.011933837,0.00014725844,0.0006279196,0.0013955513,0.37536678],"genre_scores_gemma":[0.025102308,0.19094867,0.117407344,0.0024068665,0.010213397,0.00066225266,0.0008995296,0.0011295085,0.65123016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992698,0.00014757433,0.00003578387,0.00010976515,0.00040032697,0.000036786605],"domain_scores_gemma":[0.999246,0.00041523858,0.000038918854,0.00011467395,0.00014987387,0.000035343914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067621755,0.0023035675,0.0028623,0.0017089074,0.0005762491,0.003745668,0.0013523219,0.0019123309,0.037391033],"category_scores_gemma":[0.002517278,0.0007035207,0.00081617053,0.0059631346,0.0013776578,0.0028527663,0.0017339612,0.0033882437,0.02115622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004414046,0.00009920339,0.00017237558,0.0015547492,0.00007655659,0.0000654151,0.000085396736,0.020665089,0.0013327766,0.09209016,0.3353649,0.5484492],"study_design_scores_gemma":[0.0000282166,0.00007702797,0.00076574564,0.00066871964,0.00004888754,0.00028556195,0.0000848439,0.043567196,0.00052589993,0.20504981,0.7488649,0.000033187505],"about_ca_topic_score_codex":0.0017338605,"about_ca_topic_score_gemma":0.0026318128,"teacher_disagreement_score":0.037391033,"about_ca_system_score_codex":0.0011152825,"about_ca_system_score_gemma":0.0011771736,"threshold_uncertainty_score":0.12508547},"labels":[],"label_agreement":null},{"id":"W4391890132","doi":"10.1007/978-3-031-49295-2_3","title":"Metaheuristics Methods","year":2024,"lang":"en","type":"book-chapter","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadore College","funders":"","keywords":"Metaheuristic; Computer science; Artificial intelligence","score_opus":0.0593214670761827,"score_gpt":0.37705185919371054,"score_spread":0.31773039211752785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391890132","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015756214,0.02642751,0.50992775,0.0019261462,0.0031139017,0.00015608026,0.00045660214,0.0013795655,0.45503682],"genre_scores_gemma":[0.039375417,0.02744177,0.337788,0.0020470396,0.001850327,0.00049837504,0.0011767918,0.0014339185,0.58838844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948883,0.0001285016,0.000016344391,0.000071164104,0.00026487463,0.000030232688],"domain_scores_gemma":[0.99971277,0.00013516309,0.000018093091,0.00005994881,0.00005954466,0.00001439945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046700964,0.00157174,0.0011050765,0.0012798669,0.00057155645,0.002341266,0.0015039695,0.001825353,0.049417607],"category_scores_gemma":[0.0014320469,0.00052147324,0.0007988068,0.0019339178,0.0007164764,0.0016482554,0.0013427831,0.0024558406,0.023985416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032452674,0.00008997222,0.00012718332,0.00057040283,0.00008170452,0.00008067374,0.000079549674,0.032813493,0.0021668589,0.247829,0.15031505,0.5658137],"study_design_scores_gemma":[0.000021510066,0.00005665143,0.0001953916,0.0003617566,0.000040887542,0.00024312171,0.00005401182,0.06828192,0.0021262213,0.22237685,0.70621216,0.00002947548],"about_ca_topic_score_codex":0.00071623956,"about_ca_topic_score_gemma":0.0012647236,"teacher_disagreement_score":0.049417607,"about_ca_system_score_codex":0.00069374,"about_ca_system_score_gemma":0.0007518346,"threshold_uncertainty_score":0.16531837},"labels":[],"label_agreement":null},{"id":"W4391912930","doi":"10.1145/3583131.3590467","title":"Evolutionary Mixed-Integer Optimization with Explicit Constraints","year":2023,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer (computer science); Mathematical optimization; Integer programming; Computer science; Mathematics; Programming language","score_opus":0.023124006418148123,"score_gpt":0.24577984532345756,"score_spread":0.22265583890530943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391912930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017759481,0.0002452651,0.9769613,0.00016429173,0.000044966167,0.00004457932,0.00003129579,0.0001407209,0.0046080104],"genre_scores_gemma":[0.37711313,0.0002687413,0.61701024,0.00019091756,0.000036765647,0.00030507636,0.000115807736,0.00008745746,0.0048719044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992162,0.00037109875,0.00003066965,0.000109164335,0.00019317381,0.00007966338],"domain_scores_gemma":[0.9976102,0.0018186985,0.00016945836,0.00013934467,0.00018983289,0.00007247621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017093249,0.0009395432,0.0011108674,0.00045249503,0.00044366802,0.001368551,0.0011793431,0.0014231821,0.0023736614],"category_scores_gemma":[0.0045371996,0.0006491851,0.00081019895,0.0006709619,0.00085440546,0.0010690581,0.0014605375,0.0016224202,0.00032778425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034223034,0.000037299098,0.0002460825,0.000046023677,0.000027717435,0.00006989933,0.000041807478,0.9449457,0.001253149,0.029150208,0.00038843372,0.023759548],"study_design_scores_gemma":[0.000010805683,0.000012012517,0.000024500087,0.000005884537,0.0000042357697,0.000010123361,0.0000035494338,0.9936051,0.00029544113,0.005490495,0.000534925,0.000002954715],"about_ca_topic_score_codex":0.0013199691,"about_ca_topic_score_gemma":0.0012625494,"teacher_disagreement_score":0.0023736614,"about_ca_system_score_codex":0.00055920193,"about_ca_system_score_gemma":0.00074180134,"threshold_uncertainty_score":0.009039879},"labels":[],"label_agreement":null},{"id":"W4392190020","doi":"10.1016/j.swevo.2024.101517","title":"Reinforcement learning-assisted evolutionary algorithm: A survey and research opportunities","year":2024,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Shaanxi Key Science and Technology Innovation Team Project","keywords":"Reinforcement learning; Computer science; Evolutionary algorithm; Evolutionary computation; Artificial intelligence; Machine learning; Adaptation (eye); Optimization problem; Population; Algorithm","score_opus":0.1356344590218789,"score_gpt":0.36211721861281404,"score_spread":0.22648275959093514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392190020","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01277703,0.3465473,0.6150962,0.0015763898,0.000534381,0.00009967555,0.00007041849,0.00035777662,0.022940831],"genre_scores_gemma":[0.33967403,0.37424278,0.27300298,0.00079145207,0.0015657188,0.000196226,0.00028676758,0.00015346489,0.010086578],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958295,0.00013319263,0.00003413331,0.000076180855,0.00014810511,0.000025497247],"domain_scores_gemma":[0.99914014,0.0005449906,0.000049588154,0.000052117834,0.00017946176,0.000033681652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010057214,0.0006535374,0.0015216281,0.0007963516,0.00024311578,0.0013899541,0.0011348769,0.0009905716,0.0013977649],"category_scores_gemma":[0.002114051,0.00026331638,0.0005556229,0.0020296383,0.00042832477,0.001219518,0.00061873224,0.0009217861,0.0005713938],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007850229,0.00023545467,0.0015904041,0.001336301,0.00012598882,0.00005787011,0.0000655346,0.102511555,0.0014106373,0.029060664,0.004532165,0.85899484],"study_design_scores_gemma":[0.00005353636,0.00043795674,0.0015820657,0.0005891379,0.0001503611,0.00036002463,0.0001383681,0.86183065,0.0020535772,0.041141875,0.09160891,0.00005349798],"about_ca_topic_score_codex":0.0013916151,"about_ca_topic_score_gemma":0.001145683,"teacher_disagreement_score":0.0015216281,"about_ca_system_score_codex":0.00035823372,"about_ca_system_score_gemma":0.0008195802,"threshold_uncertainty_score":0.0053188205},"labels":[],"label_agreement":null},{"id":"W4392200299","doi":"10.18280/isi.290132","title":"Optimizing Task Scheduling in Cloud Computing Using Discrete Tuna Swarm Optimization","year":2024,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tuna; Computer science; Swarm behaviour; Cloud computing; Scheduling (production processes); Distributed computing; Mathematical optimization; Task (project management); Artificial intelligence; Fishery; Fish <Actinopterygii>; Mathematics; Engineering; Operating system; Biology; Systems engineering","score_opus":0.024648121327758895,"score_gpt":0.28696990142598044,"score_spread":0.26232178009822155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392200299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11974796,0.0009898888,0.87124234,0.00065474096,0.00015172521,0.000108449756,0.00011470242,0.00027422264,0.0067159063],"genre_scores_gemma":[0.8992663,0.0006726344,0.097692885,0.00008770166,0.000042690233,0.00012860795,0.00010496064,0.00003615914,0.0019680168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970764,0.000113633454,0.000016355922,0.00004211477,0.00007667713,0.00004357792],"domain_scores_gemma":[0.9996507,0.00020164186,0.00005045741,0.00001825142,0.00004917879,0.000029766266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739428,0.00054759043,0.00057212135,0.0003932902,0.00048061827,0.000921708,0.0005010978,0.0006084452,0.0006511149],"category_scores_gemma":[0.001433339,0.00021584114,0.0005518713,0.0005566993,0.00047083024,0.0005605734,0.0004917312,0.0004939653,0.00009642453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030232688,0.000018230652,0.00029026662,0.00002732786,0.000011454609,0.000023702587,0.000013618366,0.98908406,0.0007555387,0.0024055813,0.00024425398,0.007095704],"study_design_scores_gemma":[0.0000041606268,0.000008079512,0.000039206,0.0000011594407,0.0000014893747,0.0000025053378,0.000004522791,0.9992737,0.00010447747,0.00043928428,0.000120427845,8.91782e-7],"about_ca_topic_score_codex":0.011836718,"about_ca_topic_score_gemma":0.0051635923,"teacher_disagreement_score":0.011836718,"about_ca_system_score_codex":0.0008975258,"about_ca_system_score_gemma":0.001223056,"threshold_uncertainty_score":0.02353561},"labels":[],"label_agreement":null},{"id":"W4392925322","doi":"10.20944/preprints202403.0898.v1","title":"Frilled Lizard Optimization: A Novel Nature-Inspired Metaheuristic Algorithm for Solving Optimization Problems","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Metaheuristic; Mathematical optimization; Computer science; Optimization algorithm; Algorithm; Mathematics","score_opus":0.10584569754794139,"score_gpt":0.36148834430700055,"score_spread":0.2556426467590592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392925322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032706104,0.0015860243,0.9564632,0.00034906628,0.000114337905,0.00015111659,0.00008421234,0.00065150415,0.007894376],"genre_scores_gemma":[0.30469322,0.00081079267,0.6885488,0.0004281263,0.00010271915,0.0005040711,0.000264383,0.00021106613,0.004436862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996513,0.00013896805,0.000017864106,0.000053749278,0.00010232166,0.00003568097],"domain_scores_gemma":[0.9997285,0.0001487382,0.000037863672,0.000025506117,0.000041828014,0.000017541252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008399316,0.0008504867,0.0008049016,0.0009121369,0.00039582074,0.0008042277,0.0014867604,0.0014233658,0.0014106904],"category_scores_gemma":[0.0016628735,0.00035656878,0.000992242,0.00072134903,0.00053033105,0.00060569606,0.00087873294,0.00090139604,0.00033469728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068857225,0.00007749951,0.0014111758,0.00013442381,0.00015800675,0.00008737236,0.000059883096,0.89182866,0.003256985,0.012128278,0.0018895796,0.08889934],"study_design_scores_gemma":[0.0000169677,0.0000417974,0.00014760482,0.000011613529,0.000014346552,0.000030714196,0.0000064508467,0.99570304,0.00050310016,0.0013312146,0.0021880972,0.000004999177],"about_ca_topic_score_codex":0.0044293366,"about_ca_topic_score_gemma":0.004788379,"teacher_disagreement_score":0.0044293366,"about_ca_system_score_codex":0.00073370466,"about_ca_system_score_gemma":0.001097214,"threshold_uncertainty_score":0.008807123},"labels":[],"label_agreement":null},{"id":"W4392943001","doi":"10.1109/icmla58977.2023.00112","title":"A New Self-Adaptive Hybrid Approach Based on History-Driven Methods for Improving Metaheuristics","year":2023,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Metaheuristic; Computer science; Artificial intelligence","score_opus":0.0715653130843526,"score_gpt":0.34193750891847857,"score_spread":0.270372195834126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392943001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016139576,0.00051852537,0.9795228,0.000111278816,0.000077339704,0.0000617346,0.000024021683,0.00041772082,0.0031268962],"genre_scores_gemma":[0.47633874,0.00057269586,0.517746,0.0002611012,0.000098082106,0.00035724533,0.00013584885,0.0001744001,0.0043159276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996197,0.00010399237,0.000021094715,0.000060151164,0.00016014247,0.000034887835],"domain_scores_gemma":[0.9995658,0.00018546767,0.000051451116,0.000058509733,0.0001049844,0.000033799697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075072056,0.00067842705,0.0005973826,0.0010164406,0.0003550138,0.00078105787,0.0016403259,0.00082180556,0.0015126618],"category_scores_gemma":[0.0011776912,0.00041922726,0.0007961292,0.0006642583,0.000506389,0.0009664163,0.0009973951,0.0006710978,0.00027410948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081834645,0.00011518215,0.0017031375,0.00018336359,0.00019533253,0.000104536615,0.00016328832,0.780568,0.0150915785,0.020971568,0.0014652554,0.17935689],"study_design_scores_gemma":[0.000015441428,0.000058453676,0.00014659965,0.000007645132,0.000016442895,0.000025363854,0.000009089867,0.99391925,0.0013125145,0.0024260131,0.002053765,0.0000094061215],"about_ca_topic_score_codex":0.001953546,"about_ca_topic_score_gemma":0.0021131549,"teacher_disagreement_score":0.001953546,"about_ca_system_score_codex":0.0004843502,"about_ca_system_score_gemma":0.0007957989,"threshold_uncertainty_score":0.0050604343},"labels":[],"label_agreement":null},{"id":"W4393261328","doi":"10.18280/mmep.110326","title":"A New Metaheuristic Algorithm Called Treble Opposite Algorithm and Its Application to Solve Portfolio Selection","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universitas Telkom","keywords":"Algorithm; Selection (genetic algorithm); Computer science; Portfolio; Metaheuristic; Artificial intelligence; Economics; Finance","score_opus":0.01904998732109859,"score_gpt":0.24773555978621178,"score_spread":0.2286855724651132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393261328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014558976,0.0008133575,0.9714848,0.00039464442,0.00022825916,0.00014024295,0.00007553082,0.00037393093,0.011930306],"genre_scores_gemma":[0.23870549,0.0013590994,0.74626017,0.00055341213,0.00018558271,0.00048981945,0.00042511878,0.0002122437,0.011809064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992379,0.00023477642,0.000050823037,0.00013336891,0.00027284064,0.0000703466],"domain_scores_gemma":[0.9994554,0.00021942778,0.000072906194,0.000054805543,0.0001592085,0.000038333405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009134045,0.0009181922,0.0011784575,0.001452156,0.0006699686,0.0012469866,0.0016357492,0.0017746269,0.0037335446],"category_scores_gemma":[0.0021706717,0.0004019927,0.0016064668,0.001505102,0.0005565722,0.0012379935,0.0009187843,0.0015382012,0.000672408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012826582,0.00017884329,0.0016207834,0.0002461045,0.0002580676,0.00024218527,0.000104129314,0.6962901,0.007787907,0.035464957,0.0053421827,0.2523366],"study_design_scores_gemma":[0.00003643755,0.000070724804,0.00021226802,0.000019274808,0.00003435687,0.00015449603,0.000013355892,0.98649824,0.0014801295,0.004971442,0.006493382,0.000015900498],"about_ca_topic_score_codex":0.0034254082,"about_ca_topic_score_gemma":0.0029017031,"teacher_disagreement_score":0.0037335446,"about_ca_system_score_codex":0.0007578983,"about_ca_system_score_gemma":0.0015445859,"threshold_uncertainty_score":0.0124899745},"labels":[],"label_agreement":null},{"id":"W4393342946","doi":"10.1016/j.asoc.2024.111566","title":"Dynamic metaheuristic selection via Thompson Sampling for online optimization","year":2024,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Resources Canada","funders":"Office of Energy Research and Development","keywords":"Metaheuristic; Benchmark (surveying); Computer science; Heuristic; Heuristics; Mathematical optimization; Sampling (signal processing); Hyper-heuristic; Selection (genetic algorithm); Set (abstract data type); Range (aeronautics); Consistency (knowledge bases); Algorithm; Artificial intelligence; Mathematics; Engineering","score_opus":0.02826939667858403,"score_gpt":0.3276748048447225,"score_spread":0.2994054081661385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393342946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014123049,0.0003430695,0.9798886,0.00014313654,0.00009391376,0.000106263375,0.00003154766,0.00044497586,0.0048254137],"genre_scores_gemma":[0.44967884,0.0003416836,0.54303306,0.00024069875,0.00014350125,0.00072999345,0.00020114682,0.00038425,0.0052468684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987576,0.0006015345,0.000045871715,0.00013258909,0.00034743862,0.00011507517],"domain_scores_gemma":[0.99646676,0.002625073,0.00015987063,0.00028754355,0.00034638328,0.00011438947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022164993,0.0011362204,0.0017523675,0.0015642495,0.00076949276,0.0010918712,0.0018571386,0.001903793,0.0042233053],"category_scores_gemma":[0.008078504,0.00083725865,0.0011524282,0.0017409414,0.0009333689,0.0015382144,0.001413577,0.0018252827,0.00071683363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014843278,0.0001656908,0.00042829112,0.000085368265,0.00008997806,0.000074527874,0.00005072133,0.87933475,0.0017737452,0.023073336,0.002347087,0.092428066],"study_design_scores_gemma":[0.000011604745,0.000015808166,0.000027311507,0.0000028991976,0.000004820225,0.000005527717,0.000002070065,0.9975095,0.00012963207,0.0020879938,0.00020056585,0.0000021592089],"about_ca_topic_score_codex":0.005537097,"about_ca_topic_score_gemma":0.0055587743,"teacher_disagreement_score":0.005537097,"about_ca_system_score_codex":0.0012791168,"about_ca_system_score_gemma":0.001566773,"threshold_uncertainty_score":0.014128387},"labels":[],"label_agreement":null},{"id":"W4393616711","doi":"10.23952/jano.6.2024.2.08","title":"Implicit augmented Lagrangian and generalized optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Augmented Lagrangian method; Lagrangian; Lagrangian relaxation; Mathematical optimization; Applied mathematics; Computer science; Mathematics; Calculus (dental); Medicine","score_opus":0.010526543568980144,"score_gpt":0.2630617335023203,"score_spread":0.2525351899333402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393616711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013262163,0.00035213845,0.9783524,0.00022647195,0.000053921798,0.000022511394,0.000042684424,0.000071271665,0.0076164617],"genre_scores_gemma":[0.6935488,0.00089237094,0.2890197,0.00015257802,0.000114838505,0.00019854185,0.00018339927,0.00012641914,0.015763387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947435,0.00025286828,0.000020339854,0.000052099476,0.0001491536,0.000051197963],"domain_scores_gemma":[0.99942195,0.00022389412,0.00010807655,0.00013492162,0.000075681426,0.000035559708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008999368,0.00088774407,0.0007383307,0.00045402092,0.00036559592,0.0013614673,0.00097123877,0.0008676531,0.0019438029],"category_scores_gemma":[0.0022123398,0.00031678946,0.0007131012,0.00062764285,0.0018163405,0.0016290498,0.0021496895,0.001630895,0.00039394927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021877644,0.000016512286,0.0002438984,0.000078475336,0.000022014983,0.00008969842,0.00008513308,0.55072206,0.0017594714,0.4285928,0.00058630726,0.017781762],"study_design_scores_gemma":[0.000004472862,0.0000208984,0.000041485284,0.000012805882,0.0000031835195,0.000023148023,0.000010402573,0.9194264,0.00034189946,0.07796319,0.0021461756,0.0000059298645],"about_ca_topic_score_codex":0.0016575869,"about_ca_topic_score_gemma":0.0017996647,"teacher_disagreement_score":0.0019438029,"about_ca_system_score_codex":0.0006628791,"about_ca_system_score_gemma":0.0010597818,"threshold_uncertainty_score":0.0065026283},"labels":[],"label_agreement":null},{"id":"W4396600523","doi":"","title":"An approach to learn drivers' implicit knowledge in the Traveling Salesman Problem with Time Windows","year":2022,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Computer science; Algorithm","score_opus":0.014752765440267147,"score_gpt":0.2408290827436372,"score_spread":0.22607631730337005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396600523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14189957,0.00049291877,0.85325974,0.0006910559,0.00007346233,0.000085496766,0.00025034533,0.00038158035,0.00286588],"genre_scores_gemma":[0.8257195,0.00035855436,0.16812035,0.0001504047,0.00011225552,0.0001539779,0.00058608275,0.000092584276,0.0047063776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.0001221907,0.000030498772,0.00018580702,0.00005984585,0.00007535558],"domain_scores_gemma":[0.99439925,0.004671272,0.0003166414,0.0001930458,0.00023861401,0.0001811575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497016,0.00086566794,0.0013719811,0.0009214283,0.00052987074,0.0011807267,0.0024082712,0.0019713186,0.003604721],"category_scores_gemma":[0.008486282,0.00095619145,0.0011066509,0.001073921,0.0007844775,0.0035741904,0.002131508,0.002566408,0.00032079153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002693757,0.00030648615,0.0035347685,0.00014135904,0.00012703346,0.000100424484,0.0002607547,0.87185776,0.00051100296,0.027221015,0.0015305103,0.094139546],"study_design_scores_gemma":[0.000011755889,0.000021184287,0.00011632118,0.0000054098527,0.000009471534,0.0000044722783,0.000016187983,0.98954284,0.00008403588,0.010035147,0.00014937758,0.000003844961],"about_ca_topic_score_codex":0.014725957,"about_ca_topic_score_gemma":0.012324375,"teacher_disagreement_score":0.014725957,"about_ca_system_score_codex":0.0010093435,"about_ca_system_score_gemma":0.0018270044,"threshold_uncertainty_score":0.029280484},"labels":[],"label_agreement":null},{"id":"W4396600600","doi":"10.1016/j.trpro.2024.12.220","title":"Learning implicit multiple time windows in the Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"Transportation research procedia","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Travelling salesman problem; Computer science; Algorithm","score_opus":0.03531422629747824,"score_gpt":0.3491913571771389,"score_spread":0.3138771308796606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396600600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20812598,0.0017599022,0.78669924,0.00073898747,0.00008261962,0.00010618832,0.00018596083,0.00031920866,0.0019818698],"genre_scores_gemma":[0.8767676,0.0007534433,0.11955834,0.00015604006,0.00010596368,0.0001601083,0.0003649618,0.000082896746,0.0020505905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991258,0.00035280077,0.00005158226,0.0002891104,0.00008209394,0.00009871351],"domain_scores_gemma":[0.9956884,0.003499996,0.00041878957,0.00010118465,0.00013622819,0.00015545408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027341465,0.001209558,0.00222813,0.0009275105,0.0005571409,0.0013259851,0.0019764022,0.00207927,0.0017879443],"category_scores_gemma":[0.009753,0.0010307988,0.00091960793,0.0010500951,0.0009776582,0.003089093,0.0009982046,0.0024658486,0.0002488996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014587733,0.000104822,0.0013597563,0.00007830347,0.000063592546,0.000054721175,0.00009711069,0.96032995,0.0002481912,0.010551893,0.0005185268,0.026447216],"study_design_scores_gemma":[0.00001238119,0.000031317377,0.00011620724,0.0000066175294,0.00000879275,0.0000076825545,0.000014545597,0.992386,0.0000945463,0.007192951,0.00012384255,0.00000522695],"about_ca_topic_score_codex":0.0076361336,"about_ca_topic_score_gemma":0.0051351683,"teacher_disagreement_score":0.0076361336,"about_ca_system_score_codex":0.0012254181,"about_ca_system_score_gemma":0.0014345974,"threshold_uncertainty_score":0.015183389},"labels":[],"label_agreement":null},{"id":"W4396670306","doi":"10.1007/s44196-024-00497-6","title":"Using Improved Hybrid Grey Wolf Algorithm Based on Artificial Bee Colony Algorithm Onlooker and Scout Bee Operators for Solving Optimization Problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Artificial bee colony algorithm; Convergence (economics); Firefly algorithm; Mathematical optimization; Computer science; Genetic algorithm; Algorithm; Ant colony optimization algorithms; Optimization algorithm; Artificial intelligence; Mathematics; Particle swarm optimization","score_opus":0.048125763745224856,"score_gpt":0.342416545532792,"score_spread":0.2942907817875671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396670306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056466095,0.0009434174,0.9355739,0.00018451594,0.00009858114,0.00008741571,0.000028409191,0.00041486998,0.0062028216],"genre_scores_gemma":[0.6713968,0.0006554971,0.32288823,0.00017314022,0.00006209765,0.0002560858,0.000120082914,0.000078979596,0.004369066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969697,0.000072835064,0.00001818296,0.000039448245,0.00014121343,0.00003134635],"domain_scores_gemma":[0.9997819,0.00009116791,0.000026890699,0.000019885185,0.000066852066,0.000013260823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915571,0.00069347094,0.00094081694,0.0006748825,0.00031830772,0.0006679775,0.0009846208,0.00090697786,0.0012021341],"category_scores_gemma":[0.000842056,0.00025380746,0.00069812156,0.00065309845,0.00034196844,0.00058176136,0.0005209506,0.0004659524,0.00020076014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085458436,0.00009766196,0.0012209718,0.00014667076,0.0001297013,0.00020743173,0.00008593801,0.8522146,0.011910026,0.0074984254,0.0016320593,0.1247711],"study_design_scores_gemma":[0.000014263798,0.000038278646,0.00014626172,0.000006026255,0.000010442069,0.000028365866,0.000005489799,0.99780387,0.00068900967,0.0007048165,0.0005484096,0.0000046405567],"about_ca_topic_score_codex":0.0035822797,"about_ca_topic_score_gemma":0.0030983298,"teacher_disagreement_score":0.0035822797,"about_ca_system_score_codex":0.00028412897,"about_ca_system_score_gemma":0.0007404623,"threshold_uncertainty_score":0.0071228147},"labels":[],"label_agreement":null},{"id":"W4396920847","doi":"10.31857/s0005117924030037","title":"Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Automation and Remote Control","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Crossover; Metaheuristic; Benchmark (surveying); Genetic algorithm; Computer science; Combinatorial optimization; Algorithm; Mathematical optimization; Convergence (economics); Heuristic; Randomness; Exploit; Quality control and genetic algorithms; Premature convergence; Meta-optimization; Mathematics; Artificial intelligence","score_opus":0.009434068072688354,"score_gpt":0.24828592730209176,"score_spread":0.2388518592294034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396920847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00622686,0.0025218094,0.9833771,0.00037420154,0.00012806195,0.00015232916,0.00008629652,0.00061034726,0.006523036],"genre_scores_gemma":[0.116718374,0.003455551,0.87441295,0.00031518014,0.000112131296,0.0005966035,0.0003620706,0.00020489049,0.0038223444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.00022838652,0.000037985585,0.00008751407,0.00023788291,0.000044154363],"domain_scores_gemma":[0.9996557,0.00019997581,0.000049274477,0.000030431416,0.000051263203,0.000013400202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008783487,0.0015603334,0.0015190901,0.0013882377,0.00066509005,0.0010828164,0.0014743888,0.0019117284,0.0016790143],"category_scores_gemma":[0.0018200357,0.00042063455,0.001443903,0.002290928,0.000858599,0.0010192139,0.0009617831,0.0017829345,0.0005939323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044424538,0.00010188165,0.00080164184,0.00034919655,0.00020103605,0.00017692134,0.00007939934,0.7675742,0.0045251166,0.036280498,0.0048291925,0.18503648],"study_design_scores_gemma":[0.00005997049,0.00009037674,0.00020155867,0.0000797445,0.00006248386,0.00017586313,0.000030477715,0.95547783,0.0025717288,0.0215356,0.019687893,0.000026508982],"about_ca_topic_score_codex":0.0037532253,"about_ca_topic_score_gemma":0.0035014364,"teacher_disagreement_score":0.0037532253,"about_ca_system_score_codex":0.00075964525,"about_ca_system_score_gemma":0.0017562205,"threshold_uncertainty_score":0.00746274},"labels":[],"label_agreement":null},{"id":"W4396927647","doi":"10.1007/s12532-024-00253-z","title":"Progressively strengthening and tuning MIP solvers for reoptimization","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Parallel computing; Theory of computation; Operations management; Operations research; Mathematical optimization; Mathematics; Algorithm; Economics","score_opus":0.03303405857604129,"score_gpt":0.3292207379324631,"score_spread":0.2961866793564218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396927647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035942342,0.001099878,0.9455032,0.0007341312,0.00039954085,0.00021623756,0.00011002116,0.0030300275,0.012964651],"genre_scores_gemma":[0.32028705,0.0005303347,0.673322,0.0006992915,0.00026269438,0.0003076363,0.0004373889,0.0013260234,0.0028276402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966248,0.0015077493,0.00021892761,0.0005075154,0.00084592804,0.00029509616],"domain_scores_gemma":[0.98923767,0.004999409,0.00060172856,0.0029729982,0.0019809501,0.0002072472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052487836,0.0023163038,0.001677419,0.0016287116,0.0008196868,0.0024438074,0.0033086182,0.0016739474,0.007371332],"category_scores_gemma":[0.030665841,0.0011628479,0.001544488,0.0010927973,0.0011435128,0.0036944286,0.003400606,0.0042384365,0.0023521348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002815171,0.0004494143,0.002701282,0.00047302962,0.00023817769,0.0001345201,0.00030090052,0.6236253,0.016279422,0.026910756,0.008975065,0.31963062],"study_design_scores_gemma":[0.000024153162,0.00005437852,0.0001817984,0.00005154886,0.000047470516,0.000026056685,0.000052824984,0.98513675,0.0025704352,0.00833227,0.0035109967,0.000011225281],"about_ca_topic_score_codex":0.0024065203,"about_ca_topic_score_gemma":0.0035108412,"teacher_disagreement_score":0.007371332,"about_ca_system_score_codex":0.00096544676,"about_ca_system_score_gemma":0.0027804794,"threshold_uncertainty_score":0.027758539},"labels":[],"label_agreement":null},{"id":"W4399178934","doi":"10.18280/mmep.110515","title":"Optimizing Northern Goshawk Algorithm with Fuzzy Logic and Whale Algorithm Strategies","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Whale; Fuzzy logic; Algorithm; Computer science; Fishery; Artificial intelligence; Biology","score_opus":0.02405201819786652,"score_gpt":0.2361042286266223,"score_spread":0.2120522104287558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399178934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14807364,0.00036383126,0.8414829,0.00020833394,0.000044195007,0.00008740903,0.000030593255,0.00015773799,0.009551308],"genre_scores_gemma":[0.81071675,0.00014192631,0.18609168,0.00006928695,0.000015450016,0.00011456468,0.0000438719,0.000030116535,0.0027764556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999838,0.000058803667,0.0000075903463,0.000025898758,0.0000418773,0.00002780986],"domain_scores_gemma":[0.99974185,0.0001475921,0.000029892875,0.000011728601,0.000055438275,0.000013452243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132405,0.00046643062,0.00045751192,0.0005311377,0.0003365281,0.0006066976,0.00069556513,0.0007411434,0.0011603046],"category_scores_gemma":[0.0012987172,0.00016575516,0.00041263681,0.00033517784,0.00034017986,0.00045015378,0.00047502675,0.0003600957,0.00012040656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037742997,0.000033226795,0.00077503413,0.000036719546,0.00003040696,0.000031580446,0.000052694122,0.9576828,0.0013239686,0.0066662487,0.00028496634,0.03304463],"study_design_scores_gemma":[0.0000039775873,0.000017315644,0.000078291014,0.0000027313297,0.000004133698,0.0000054467905,0.000007797504,0.99892527,0.00018804551,0.00064030814,0.00012513253,0.0000015338228],"about_ca_topic_score_codex":0.008474058,"about_ca_topic_score_gemma":0.0069787824,"teacher_disagreement_score":0.008474058,"about_ca_system_score_codex":0.0006287091,"about_ca_system_score_gemma":0.00095443206,"threshold_uncertainty_score":0.016849458},"labels":[],"label_agreement":null},{"id":"W4399181335","doi":"10.1007/s10732-024-09529-y","title":"Mathematical models and solving methods for diversity and equity optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Junta de Comunidades de Castilla-La Mancha; Generalitat Valenciana; Ministerio de Ciencia, Innovación y Universidades","keywords":"Equity (law); Diversity (politics); Mathematical optimization; Mathematics; Computer science; Mathematical economics; Management science; Economics; Sociology; Political science","score_opus":0.12590444482944654,"score_gpt":0.428268988258312,"score_spread":0.30236454342886543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399181335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022282868,0.0017752977,0.9859466,0.0007332961,0.00013829883,0.0000319054,0.00005215718,0.000030991472,0.009063088],"genre_scores_gemma":[0.26887855,0.0066631883,0.6988089,0.0004979587,0.0007441236,0.0006312498,0.00024059485,0.0002311092,0.023304379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990325,0.00053001085,0.0000375737,0.00007685844,0.00024985705,0.00007330255],"domain_scores_gemma":[0.99660945,0.0026154853,0.00026279426,0.00013633263,0.00031019264,0.000065797016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023625607,0.0012813336,0.0012050064,0.001573545,0.0008409058,0.0026192826,0.0022893776,0.0022006596,0.0050912923],"category_scores_gemma":[0.00985723,0.0008039603,0.00149806,0.0023730914,0.0020478892,0.0029238015,0.0017288662,0.0036261517,0.0006778312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008253929,0.000026611962,0.00014115425,0.000089405,0.000027900987,0.000020655762,0.000051473588,0.42069522,0.00016333471,0.56399465,0.0018084238,0.012972954],"study_design_scores_gemma":[0.000008241096,0.000008720228,0.000044812798,0.000028775063,0.000009961196,0.000015277657,0.000016573955,0.76361287,0.000101457306,0.23298171,0.0031632443,0.000008344756],"about_ca_topic_score_codex":0.005578084,"about_ca_topic_score_gemma":0.0044390154,"teacher_disagreement_score":0.005578084,"about_ca_system_score_codex":0.0020304914,"about_ca_system_score_gemma":0.0019915057,"threshold_uncertainty_score":0.017032027},"labels":[],"label_agreement":null},{"id":"W4399291550","doi":"10.1038/s41598-024-62686-9","title":"Comparative assessment of differently randomized accelerated particle swarm optimization and squirrel search algorithms for selective harmonics elimination problem","year":2024,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"University of Engineering and Technology, Lahore","keywords":"Initialization; Particle swarm optimization; Metaheuristic; Computer science; Algorithm; Resampling; Weibull distribution; Mathematical optimization; Mathematics; Statistics","score_opus":0.07307720255715129,"score_gpt":0.3800802182928686,"score_spread":0.3070030157357173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399291550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48679334,0.00339809,0.49103245,0.0006587112,0.00030478238,0.00027793157,0.000103938655,0.00089362,0.01653715],"genre_scores_gemma":[0.90041304,0.00062554795,0.09740366,0.00008823911,0.000031054853,0.00016061058,0.00012696961,0.000065645516,0.0010853178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901056,0.00047357418,0.000060877665,0.00011003376,0.00025036393,0.00009459829],"domain_scores_gemma":[0.9976394,0.0014190053,0.00023028886,0.00018605747,0.00042818754,0.00009711074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021745667,0.00073488127,0.0008906752,0.0007724896,0.00041363004,0.000721426,0.0008439224,0.0007506816,0.0011377985],"category_scores_gemma":[0.0063370657,0.00020745223,0.00075114635,0.00049617403,0.0004928784,0.00090637576,0.00054036995,0.0005798037,0.00019046762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075013045,0.00032144776,0.003347889,0.00030729573,0.00015934123,0.0000880645,0.000115424584,0.86649615,0.0037499228,0.009534301,0.0010772174,0.11405286],"study_design_scores_gemma":[0.00007585668,0.00047260913,0.0009054831,0.000019950636,0.000035842237,0.000038452483,0.00004591752,0.9949004,0.0014711927,0.0012935882,0.00072771765,0.000013062701],"about_ca_topic_score_codex":0.0024518764,"about_ca_topic_score_gemma":0.002199075,"teacher_disagreement_score":0.0024518764,"about_ca_system_score_codex":0.0004709952,"about_ca_system_score_gemma":0.0013589846,"threshold_uncertainty_score":0.011500359},"labels":[],"label_agreement":null},{"id":"W4399557311","doi":"10.1016/j.dsp.2024.104637","title":"Behaviors of first-order optimizers in the context of sparse data and sparse models: A comparative study","year":2024,"lang":"en","type":"article","venue":"Digital Signal Processing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Université du Québec à Trois-Rivières","funders":"","keywords":"Context (archaeology); Computer science; Sparse approximation; Order (exchange); Sparse matrix; Mathematical optimization; Artificial intelligence; Mathematics; Biology","score_opus":0.1313547994423052,"score_gpt":0.3537208359567656,"score_spread":0.22236603651446044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399557311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67180455,0.004030056,0.30613902,0.0013671033,0.00009211061,0.00009131112,0.00032165987,0.00043175084,0.015722467],"genre_scores_gemma":[0.97331154,0.0010677272,0.023309825,0.000066197,0.00004021773,0.00004005402,0.00023875244,0.00010697036,0.0018187526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.00033696357,0.000023539771,0.00008476755,0.00013590328,0.000109676854],"domain_scores_gemma":[0.98506576,0.012132309,0.0010301246,0.00054088933,0.00092219823,0.00030885322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003354555,0.0006509508,0.0011586949,0.001309085,0.0004900874,0.001602095,0.00080177834,0.0011715413,0.001939831],"category_scores_gemma":[0.019980824,0.00038058538,0.0007696786,0.0010430039,0.00091813144,0.0020398672,0.00071143813,0.0010681668,0.0002158749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001419662,0.00011209906,0.0035933056,0.00016083242,0.000092343755,0.00010860289,0.00017820447,0.94790936,0.00083247013,0.030521948,0.0013963099,0.014952494],"study_design_scores_gemma":[0.000005206002,0.00005077411,0.0009192387,0.000011422209,0.0000112672915,0.000031823605,0.000055320255,0.99256307,0.0001822235,0.00597303,0.00019040865,0.000006204583],"about_ca_topic_score_codex":0.0058263587,"about_ca_topic_score_gemma":0.0033086608,"teacher_disagreement_score":0.0058263587,"about_ca_system_score_codex":0.0008915149,"about_ca_system_score_gemma":0.0010706813,"threshold_uncertainty_score":0.017740786},"labels":[],"label_agreement":null},{"id":"W4399634105","doi":"10.5267/j.dsl.2024.4.001","title":"A hybrid genetic-simulated annealing algorithm for multiple traveling salesman problems","year":2024,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Bisha","keywords":"Travelling salesman problem; Simulated annealing; Genetic algorithm; Mathematical optimization; Computer science; 2-opt; Algorithm; Mathematics","score_opus":0.03378102675463943,"score_gpt":0.3191322940027633,"score_spread":0.2853512672481238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399634105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028059151,0.0004475009,0.96525586,0.00013812745,0.00006945796,0.00010697406,0.000039305545,0.0005746042,0.0053089117],"genre_scores_gemma":[0.3314001,0.0003297398,0.6630032,0.00012113438,0.00004005066,0.00032684597,0.00012857027,0.000096320946,0.004553997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939764,0.0002223441,0.000027091033,0.00009397544,0.0002024634,0.000056610403],"domain_scores_gemma":[0.9997503,0.00013333581,0.00002452368,0.000021324227,0.00005544879,0.000015003525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080056104,0.00080631685,0.000994567,0.0008931112,0.00060102827,0.0007622256,0.0010281383,0.0011851382,0.0017295922],"category_scores_gemma":[0.0011180093,0.00044467658,0.0010531398,0.0010014075,0.000449864,0.000636006,0.00074407965,0.00081461034,0.0003490426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008804137,0.00008744692,0.00046283205,0.00008395072,0.00011780024,0.00009814207,0.000094420924,0.8808456,0.006087318,0.011748353,0.0010108748,0.09927522],"study_design_scores_gemma":[0.0000229511,0.00006701159,0.000121929865,0.000006178135,0.000019375464,0.000044585096,0.000011047065,0.9945537,0.0010003326,0.002418055,0.001726821,0.000008021863],"about_ca_topic_score_codex":0.00366304,"about_ca_topic_score_gemma":0.0035576255,"teacher_disagreement_score":0.00366304,"about_ca_system_score_codex":0.00057329255,"about_ca_system_score_gemma":0.0008473006,"threshold_uncertainty_score":0.007283449},"labels":[],"label_agreement":null},{"id":"W4399680902","doi":"10.5267/j.ijiec.2024.5.004","title":"Effects of crossover operator combined with mutation operator in genetic algorithms for the generalized travelling salesman problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Al-Imam Muhammad Ibn Saud Islamic University","keywords":"Crossover; Travelling salesman problem; Operator (biology); Genetic algorithm; Mutation; Mathematical optimization; Algorithm; Mathematics; Computer science; Artificial intelligence; Biology; Genetics; Gene","score_opus":0.025199216016296072,"score_gpt":0.29227710258205736,"score_spread":0.26707788656576126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399680902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6935677,0.004652349,0.28790137,0.0007775926,0.000446961,0.0002790564,0.0000999959,0.00081061176,0.011464381],"genre_scores_gemma":[0.9224145,0.0011693868,0.075192936,0.00011833917,0.000043069726,0.00007341297,0.000080875434,0.00007861145,0.0008288889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876285,0.00055466685,0.00006885159,0.00014686154,0.00033116975,0.00013568242],"domain_scores_gemma":[0.99806553,0.0012936993,0.00016590861,0.00012338256,0.00028201452,0.0000695413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018761363,0.001346218,0.0008699959,0.0012146212,0.0008384019,0.0010723987,0.0008357458,0.0010332371,0.00096541457],"category_scores_gemma":[0.0053042443,0.00023380989,0.0008213792,0.001152031,0.00075755495,0.0013881121,0.0006759005,0.00082803064,0.000124275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005307352,0.00040750857,0.006386269,0.00028146114,0.00029691163,0.0008428263,0.00023096017,0.8195544,0.026776487,0.011631125,0.0009757265,0.1320856],"study_design_scores_gemma":[0.00012986794,0.0006819503,0.001963208,0.000040383817,0.00026871948,0.00038472435,0.000108697546,0.9751544,0.013798667,0.0056755044,0.0017549051,0.000038883172],"about_ca_topic_score_codex":0.0037190274,"about_ca_topic_score_gemma":0.0022696964,"teacher_disagreement_score":0.0037190274,"about_ca_system_score_codex":0.00059768365,"about_ca_system_score_gemma":0.0010022202,"threshold_uncertainty_score":0.009922028},"labels":[],"label_agreement":null},{"id":"W4399681197","doi":"10.5267/j.ijiec.2024.4.004","title":"An improved black widow optimization (IBWO) algorithm for solving global optimization problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Optimization algorithm; Algorithm; Global optimization; Computer science; Optimization problem; Mathematics","score_opus":0.03040651770898991,"score_gpt":0.3082248744484339,"score_spread":0.277818356739444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010792933,0.0006482958,0.98466855,0.00013685727,0.0000728493,0.0000928574,0.000044834436,0.000277161,0.0032657094],"genre_scores_gemma":[0.26288584,0.00082599913,0.7312928,0.00028200715,0.00006277271,0.00052108226,0.00024315566,0.00016364572,0.0037227962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995177,0.00015320198,0.000027792865,0.000078731544,0.00016449565,0.000058023445],"domain_scores_gemma":[0.9996141,0.00017630197,0.000056210753,0.00003384488,0.00009139058,0.000028033808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010666258,0.0013966883,0.0010540055,0.0010627548,0.000529612,0.0008936279,0.0013532238,0.0010021988,0.002050363],"category_scores_gemma":[0.002135403,0.00044993564,0.00079449604,0.0011079119,0.00059018534,0.0013013608,0.0015152732,0.0009903872,0.00038782554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016401369,0.00011218583,0.001535703,0.0002198028,0.00014362807,0.00009613377,0.00012049025,0.77741194,0.005905194,0.018796993,0.0035849484,0.1919091],"study_design_scores_gemma":[0.00003640373,0.00009660735,0.00016003747,0.00002204896,0.000019948016,0.000035765115,0.000022573,0.9916402,0.0011670565,0.0039734053,0.0028121693,0.000013717774],"about_ca_topic_score_codex":0.0033590565,"about_ca_topic_score_gemma":0.0038432172,"teacher_disagreement_score":0.0033590565,"about_ca_system_score_codex":0.00034304726,"about_ca_system_score_gemma":0.0012771301,"threshold_uncertainty_score":0.0068591833},"labels":[],"label_agreement":null},{"id":"W4399693827","doi":"10.1007/978-3-031-55964-8_5","title":"Optimization by Monte Carlo Methods","year":2024,"lang":"en","type":"book-chapter","venue":"Undergraduate texts in mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Monte Carlo method; Computer science; Statistical physics; Mathematics; Statistics; Physics","score_opus":0.031636050712801934,"score_gpt":0.3297636773453508,"score_spread":0.2981276266325488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399693827","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008847213,0.0034065486,0.90490824,0.0005140503,0.00056724803,0.000049013688,0.00009427286,0.00036134326,0.08921461],"genre_scores_gemma":[0.09950014,0.008791192,0.6815498,0.0009536104,0.0009019123,0.00069015694,0.000433472,0.0014539913,0.20572576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933916,0.00026755588,0.000018068195,0.00007054964,0.00027687397,0.000027778415],"domain_scores_gemma":[0.9993025,0.0004812427,0.000035812147,0.00009339908,0.00006998484,0.000017056165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091591966,0.0011200289,0.0015741691,0.0007477921,0.00043260056,0.0015522105,0.0010445153,0.0017976039,0.022594692],"category_scores_gemma":[0.0027096777,0.0007230062,0.0010174962,0.0012105261,0.0011563748,0.0014849027,0.0011719988,0.0027018972,0.006812389],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024298231,0.00005454697,0.0000932867,0.0003014199,0.00006521025,0.000039115017,0.00004488863,0.40430146,0.0008857479,0.46081904,0.024062369,0.10930869],"study_design_scores_gemma":[0.00001998079,0.000021986942,0.00009556359,0.000108007815,0.000018905943,0.000050655035,0.0000107526575,0.699205,0.00075605203,0.23801513,0.061677538,0.000020464473],"about_ca_topic_score_codex":0.0010354937,"about_ca_topic_score_gemma":0.0012477225,"teacher_disagreement_score":0.022594692,"about_ca_system_score_codex":0.0007041546,"about_ca_system_score_gemma":0.00060962356,"threshold_uncertainty_score":0.075586796},"labels":[],"label_agreement":null},{"id":"W4399970954","doi":"10.28924/2291-8639-22-2024-105","title":"Application of Ant Colony Programming Approach for Solving Systems of Stochastic Differential Equations","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Mathematical optimization; Ant colony optimization algorithms; Ant colony; Stochastic differential equation; Stochastic programming; Applied mathematics","score_opus":0.0215332210920512,"score_gpt":0.3266769948467153,"score_spread":0.3051437737546641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399970954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008031304,0.00029998217,0.98648447,0.0001941872,0.00004032386,0.00004032163,0.000018832232,0.00008089278,0.004809669],"genre_scores_gemma":[0.40245968,0.001001375,0.59061366,0.00012691348,0.00006677457,0.00032906374,0.0000874867,0.000084112115,0.0052308696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966776,0.00013326238,0.000017479384,0.000044493354,0.00011467455,0.000022304472],"domain_scores_gemma":[0.999445,0.0003807295,0.000042641266,0.000021270644,0.00009134907,0.00001894479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053050957,0.00057819695,0.0006917759,0.00042768035,0.00042659606,0.0007083235,0.0006201208,0.00067729363,0.0013037645],"category_scores_gemma":[0.0012680666,0.000274854,0.0006331405,0.0005490015,0.00056402467,0.00034575764,0.000844201,0.0011382018,0.0001558869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009354834,0.000016231425,0.0003055795,0.00007837624,0.000027627915,0.000092686736,0.00005930582,0.95630044,0.0014012201,0.021797337,0.00039126934,0.019520579],"study_design_scores_gemma":[0.0000021401322,0.0000061956143,0.000021238475,0.000003345086,0.0000022258525,0.000010403306,0.0000052132214,0.99500847,0.00017193514,0.0042449394,0.00052210334,0.0000017915461],"about_ca_topic_score_codex":0.0034119196,"about_ca_topic_score_gemma":0.0024304513,"teacher_disagreement_score":0.0034119196,"about_ca_system_score_codex":0.0003162635,"about_ca_system_score_gemma":0.0009803262,"threshold_uncertainty_score":0.006784141},"labels":[],"label_agreement":null},{"id":"W4399989754","doi":"10.1109/tevc.2024.3418470","title":"A Prediction and Weak Coevolution-Based Dynamic Constrained Multiobjective Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"High-end Foreign Experts Recruitment Plan of China; National Natural Science Foundation of China","keywords":"Coevolution; Computer science; Evolutionary computation; Mathematical optimization; Artificial intelligence; Evolutionary algorithm; Machine learning; Mathematics; Biology","score_opus":0.014773459700807139,"score_gpt":0.2681553874437499,"score_spread":0.25338192774294277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399989754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06285804,0.00036386622,0.93229795,0.00027369137,0.00006693656,0.00006169661,0.0000382873,0.00019080895,0.0038486654],"genre_scores_gemma":[0.8215077,0.0002790523,0.17437603,0.00020154317,0.000035708537,0.00020548141,0.00016069035,0.000053077045,0.0031806666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999605,0.00011634676,0.000024866356,0.00008786134,0.00012293836,0.000042934324],"domain_scores_gemma":[0.99933547,0.00033501722,0.00006366158,0.00006617863,0.00016482524,0.000034774457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091110973,0.00077162846,0.00069547136,0.0004602335,0.0004012203,0.0006798419,0.0012666815,0.0007979334,0.001022509],"category_scores_gemma":[0.0025434073,0.00030033506,0.0005164357,0.0005470993,0.0004466365,0.00078024704,0.0011307859,0.0008973928,0.00017094676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042103748,0.00005563003,0.0015014667,0.000044164386,0.000048125323,0.000068191584,0.000054448275,0.9095678,0.0025218597,0.00445381,0.0008064054,0.08083606],"study_design_scores_gemma":[0.0000037841194,0.000020110429,0.0000974861,0.000002951691,0.0000036027623,0.0000111410845,0.000003880572,0.9988925,0.00029392052,0.0004494865,0.0002188362,0.000002380588],"about_ca_topic_score_codex":0.004116424,"about_ca_topic_score_gemma":0.0028673317,"teacher_disagreement_score":0.004116424,"about_ca_system_score_codex":0.0003100673,"about_ca_system_score_gemma":0.0007445478,"threshold_uncertainty_score":0.00818491},"labels":[],"label_agreement":null},{"id":"W4400184785","doi":"10.1007/s43069-024-00336-6","title":"One-Shot Learning for MIPs with SOS1 Constraints","year":2024,"lang":"en","type":"article","venue":"Operations Research Forum","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"Institut de Valorisation des Données","keywords":"Shot (pellet); Computer science; Artificial intelligence; Chemistry","score_opus":0.16772378563297602,"score_gpt":0.42246039914045613,"score_spread":0.2547366135074801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400184785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023620112,0.0010709111,0.96576613,0.00078958645,0.00018404415,0.00026005376,0.0004144826,0.00092074135,0.00697394],"genre_scores_gemma":[0.5311302,0.0007540369,0.4457037,0.0009508862,0.00049890345,0.0009895317,0.0025013147,0.00072067796,0.016750801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986858,0.00054312224,0.00006749954,0.00029668884,0.000207391,0.00019955824],"domain_scores_gemma":[0.9897451,0.008601961,0.0003319044,0.00032364152,0.0005931162,0.0004043814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00367409,0.0023204111,0.004496832,0.0017655501,0.0011104695,0.002386282,0.004260878,0.0048336675,0.012080019],"category_scores_gemma":[0.014061617,0.0020001489,0.0018541473,0.0015355971,0.0016257276,0.0031436621,0.0035584471,0.0052290997,0.001249767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015762782,0.00019125827,0.0003816262,0.0002801719,0.00007748187,0.00006428835,0.000063829306,0.93062985,0.00021202688,0.010785583,0.0043480867,0.052808166],"study_design_scores_gemma":[0.000010046,0.000021812437,0.000030034065,0.000011654386,0.000005061882,0.0000051997126,0.00000901836,0.9939541,0.00005009152,0.0057194363,0.00017956004,0.000004041107],"about_ca_topic_score_codex":0.013171852,"about_ca_topic_score_gemma":0.012228367,"teacher_disagreement_score":0.013171852,"about_ca_system_score_codex":0.0018074532,"about_ca_system_score_gemma":0.0031439236,"threshold_uncertainty_score":0.04041165},"labels":[],"label_agreement":null},{"id":"W4400412426","doi":"10.1145/3638529.3654012","title":"Direct Augmented Lagrangian Evolution Strategies","year":2024,"lang":"en","type":"article","venue":"Proceedings of the Genetic and Evolutionary Computation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lagrangian; Augmented Lagrangian method; Computer science; Applied mathematics; Mathematics; Algorithm","score_opus":0.01818831382712729,"score_gpt":0.25866533924153157,"score_spread":0.24047702541440427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400412426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00665809,0.00038969243,0.96933794,0.000155865,0.00010854929,0.000092681774,0.000062294435,0.0003278918,0.022866972],"genre_scores_gemma":[0.38840172,0.00092307373,0.56978077,0.0004015422,0.0001261095,0.00075024005,0.0002797876,0.00023841669,0.039098404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.00019404234,0.000021636657,0.0000680096,0.00020469914,0.00004758905],"domain_scores_gemma":[0.9991992,0.00036732494,0.000088439156,0.0001288301,0.00017488422,0.000041362735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008385233,0.0010885011,0.0009447613,0.00070317654,0.0003881266,0.0015077213,0.0015702171,0.0013338139,0.007172256],"category_scores_gemma":[0.0025029178,0.00052671076,0.00060688145,0.0006742371,0.00077143696,0.0010780186,0.0019279041,0.0010928685,0.001732468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006923722,0.00008653489,0.0004069033,0.00019687935,0.0000935155,0.00014125483,0.00012850377,0.6851078,0.0029808665,0.1566127,0.004218949,0.1499568],"study_design_scores_gemma":[0.000028497872,0.00005303534,0.00006388053,0.00002122153,0.0000125161305,0.00004640299,0.000010449374,0.9724256,0.0006204949,0.020151727,0.0065564048,0.000009857218],"about_ca_topic_score_codex":0.0013918736,"about_ca_topic_score_gemma":0.0018275098,"teacher_disagreement_score":0.007172256,"about_ca_system_score_codex":0.0005408476,"about_ca_system_score_gemma":0.0008839049,"threshold_uncertainty_score":0.023993611},"labels":[],"label_agreement":null},{"id":"W4400776009","doi":"10.1007/s00500-024-09823-8","title":"A sophisticated solution to numerical and engineering optimization problems using Chaotic Beluga Whale Optimizer","year":2024,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Whale; Beluga Whale; Chaotic; Computer science; Optimization problem; Mathematical optimization; Fishery; Artificial intelligence; Algorithm; Mathematics; Oceanography; Biology; Geology; Arctic","score_opus":0.028952735283182585,"score_gpt":0.279551159684461,"score_spread":0.2505984244012784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400776009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07735342,0.00028497196,0.8992683,0.0003855371,0.00016381241,0.00009260972,0.00002444652,0.00030545532,0.022121388],"genre_scores_gemma":[0.7146039,0.00024680258,0.2695185,0.0001382814,0.00007991208,0.00013549162,0.000054012213,0.00008494664,0.015138178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992156,0.00002042443,0.000003861249,0.000008363691,0.00003737702,0.000008386199],"domain_scores_gemma":[0.99991465,0.000030561176,0.000009375002,0.000013250168,0.000022617676,0.000009464052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026236312,0.00030853716,0.00038328924,0.0002369963,0.00044024436,0.0004673423,0.00043476725,0.0006244819,0.0018793306],"category_scores_gemma":[0.0006651978,0.00021479945,0.00039996597,0.0002064339,0.00043074266,0.00037119095,0.00072773657,0.000535255,0.0003131877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062217805,0.00004987907,0.00089694903,0.00009262048,0.000069119786,0.00014985434,0.000112405505,0.870036,0.013171171,0.05771336,0.0018648297,0.05578163],"study_design_scores_gemma":[0.000012403035,0.000034039767,0.00018026985,0.0000027659082,0.000006426576,0.00002641596,0.000009389171,0.9942204,0.0006633238,0.0030752926,0.0017633195,0.0000060565976],"about_ca_topic_score_codex":0.001990061,"about_ca_topic_score_gemma":0.0027783066,"teacher_disagreement_score":0.001990061,"about_ca_system_score_codex":0.00023687545,"about_ca_system_score_gemma":0.00036184507,"threshold_uncertainty_score":0.0062869787},"labels":[],"label_agreement":null},{"id":"W4401011606","doi":"10.1007/s00500-024-09896-5","title":"A co-evolutionary algorithm with adaptive penalty function for constrained optimization","year":2024,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Verafin (Canada)","funders":"Università degli Studi di Trento","keywords":"Metaheuristic; Mathematical optimization; Penalty method; Computer science; Evolutionary algorithm; Optimization problem; Constrained optimization; Benchmark (surveying); Algorithm; Mathematics","score_opus":0.02337172264000821,"score_gpt":0.28811614323647,"score_spread":0.2647444205964618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401011606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05105768,0.00044789768,0.94246227,0.00029225016,0.00009716393,0.00008952987,0.00003689341,0.00032178836,0.005194505],"genre_scores_gemma":[0.5278427,0.0002335189,0.46650416,0.0002721673,0.000052925494,0.00037240758,0.00016318767,0.00013880816,0.0044200877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994659,0.00019567879,0.00003006747,0.000080113954,0.00017242855,0.000055954162],"domain_scores_gemma":[0.9989091,0.0006899298,0.00007376775,0.00007943857,0.00019124248,0.000056545403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010911662,0.0008905682,0.0010555253,0.0011568756,0.00038673566,0.00076452363,0.0011951751,0.001652708,0.0017955985],"category_scores_gemma":[0.0027070788,0.00040606258,0.0007156957,0.0009799354,0.00065267313,0.0005719142,0.0012091547,0.0010388538,0.00028122508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049743347,0.00008831319,0.00072367,0.0000420845,0.00004913274,0.00005603221,0.000036514793,0.9426775,0.0023119408,0.0062227533,0.0006322164,0.047110084],"study_design_scores_gemma":[0.000008552166,0.000014067809,0.00004433073,0.0000027448416,0.0000034670727,0.000009612011,0.0000021515395,0.9989429,0.00019468836,0.0004966281,0.00027871976,0.0000021379008],"about_ca_topic_score_codex":0.0030356958,"about_ca_topic_score_gemma":0.0021885806,"teacher_disagreement_score":0.0030356958,"about_ca_system_score_codex":0.0005870515,"about_ca_system_score_gemma":0.0008893488,"threshold_uncertainty_score":0.006036043},"labels":[],"label_agreement":null},{"id":"W4401013477","doi":"10.1016/b978-0-443-15533-8.00004-7","title":"Emerging trends in computational swarm intelligence: A comprehensive overview","year":2024,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Swarm intelligence; Swarm behaviour; Computer science; Data science; Artificial intelligence; Machine learning; Particle swarm optimization","score_opus":0.0532703291114881,"score_gpt":0.33852510771358535,"score_spread":0.28525477860209725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401013477","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009300024,0.93377566,0.025830593,0.0021747393,0.0031103224,0.000054168268,0.00012654987,0.00026221768,0.033735834],"genre_scores_gemma":[0.008247366,0.92369133,0.03327266,0.0012639969,0.0045472374,0.000093869094,0.0003993214,0.000118267584,0.02836603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996061,0.00005862755,0.000033760403,0.00004965104,0.00022448318,0.000027504975],"domain_scores_gemma":[0.99947006,0.00026877786,0.000036435365,0.000028408629,0.00014750978,0.00004879638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072026293,0.0011004846,0.0010482395,0.0022650633,0.00028514935,0.0030218945,0.0010132607,0.0013967083,0.00916004],"category_scores_gemma":[0.0011319289,0.00043028934,0.00054580776,0.005329672,0.0005968579,0.0028216706,0.0011727448,0.001807542,0.0052650836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033041146,0.00009640925,0.00022057479,0.003776195,0.00004859546,0.0000811235,0.00011444295,0.002787508,0.0011579286,0.024589997,0.109335996,0.85775816],"study_design_scores_gemma":[0.000013203993,0.000100427555,0.00084591436,0.002055461,0.00004510951,0.00053045835,0.0001535101,0.00571066,0.000481164,0.039422832,0.95060617,0.000034939836],"about_ca_topic_score_codex":0.00082321314,"about_ca_topic_score_gemma":0.0015843237,"teacher_disagreement_score":0.00916004,"about_ca_system_score_codex":0.00051450985,"about_ca_system_score_gemma":0.0010914551,"threshold_uncertainty_score":0.030643404},"labels":[],"label_agreement":null},{"id":"W4401013509","doi":"10.1016/b978-0-443-15533-8.00009-6","title":"Conclusion and future research directions","year":2024,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science","score_opus":0.03794060541817349,"score_gpt":0.3289472627806413,"score_spread":0.2910066573624678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401013509","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038928415,0.19159111,0.019850092,0.27368915,0.03940014,0.00043982497,0.0021934612,0.00085675967,0.46808666],"genre_scores_gemma":[0.050351918,0.30000076,0.049462423,0.07962808,0.015166063,0.0009228449,0.0039523756,0.00047561622,0.50003994],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722147,0.00088940037,0.00014387346,0.0004724142,0.00083234435,0.00044049468],"domain_scores_gemma":[0.99074346,0.0023128178,0.00025385412,0.0005553854,0.004909912,0.0012246659],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007395015,0.0010488384,0.0011226754,0.0025968247,0.002439812,0.011305543,0.0030799434,0.004349922,0.17065437],"category_scores_gemma":[0.010148335,0.00037376248,0.0013326159,0.0037186884,0.001862157,0.010738956,0.0026144946,0.0030321737,0.046595715],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030838168,0.00033931356,0.00086425827,0.0021824976,0.000035017016,0.00021406892,0.0006722389,0.000797598,0.0007438097,0.1636264,0.34523863,0.48497775],"study_design_scores_gemma":[0.000059106034,0.00012779354,0.00065418956,0.003199647,0.00006676916,0.00023266971,0.0042332867,0.0007393823,0.0006137296,0.112585075,0.8774558,0.000032572203],"about_ca_topic_score_codex":0.0077669905,"about_ca_topic_score_gemma":0.009293626,"teacher_disagreement_score":0.82934564,"about_ca_system_score_codex":0.003545228,"about_ca_system_score_gemma":0.01208295,"threshold_uncertainty_score":0.57089573},"labels":[],"label_agreement":null},{"id":"W4401023659","doi":"10.24963/ijcai.2024/766","title":"Boost Embodied AI Models with Robust Compression Boundary","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Eusko Jaurlaritza","keywords":"Reinforcement learning; Computer science; Travelling salesman problem; Combinatorial optimization; Solver; Set (abstract data type); Optimization problem; Local optimum; Domain (mathematical analysis); Artificial intelligence; Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","score_opus":0.05116237900306967,"score_gpt":0.30245592558821743,"score_spread":0.25129354658514774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401023659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034761347,0.0004979437,0.9551745,0.0004964669,0.000082136474,0.000049473656,0.00007775649,0.000656813,0.008203494],"genre_scores_gemma":[0.8232289,0.00065514294,0.16560273,0.0004763394,0.00015126108,0.00020019469,0.00030113544,0.0003171465,0.009067269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997905,0.000047936257,0.000011029387,0.000044576205,0.00007465779,0.00003137279],"domain_scores_gemma":[0.9990619,0.0005464426,0.00010434231,0.00011519622,0.0001219127,0.00005024556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007422709,0.0010023157,0.00092057843,0.00056410284,0.00031999123,0.0010351741,0.0012639873,0.0014218816,0.0033847417],"category_scores_gemma":[0.0044729575,0.00043045142,0.0006449288,0.00038816544,0.00099666,0.0019610808,0.0021081916,0.0017189238,0.0007991905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043503806,0.000023135102,0.00023463141,0.00006605421,0.000020189113,0.000049552214,0.000056545734,0.93841165,0.0029595639,0.028047657,0.0011674176,0.028920075],"study_design_scores_gemma":[0.0000031061652,0.000009943719,0.00001956533,0.000004797828,0.0000029633725,0.000008230381,0.000003087936,0.9929939,0.00048718887,0.006167467,0.00029744403,0.0000023194452],"about_ca_topic_score_codex":0.0021194082,"about_ca_topic_score_gemma":0.0013661934,"teacher_disagreement_score":0.0033847417,"about_ca_system_score_codex":0.00070112426,"about_ca_system_score_gemma":0.0007378444,"threshold_uncertainty_score":0.011323094},"labels":[],"label_agreement":null},{"id":"W4401367936","doi":"10.1134/s000511792403007x","title":"Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Automation and Remote Control","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Metaheuristic; Genetic algorithm; Parallel metaheuristic; Computer science; Mathematical optimization; Algorithm; Meta-optimization; Optimization algorithm; Mathematics","score_opus":0.009434068072688354,"score_gpt":0.24828592730209176,"score_spread":0.2388518592294034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401367936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064112665,0.0025748678,0.982919,0.0003819027,0.00013225395,0.00015229089,0.000089944035,0.0006181477,0.006720308],"genre_scores_gemma":[0.11675064,0.003498438,0.87429446,0.00032049877,0.00011370543,0.0005941179,0.00037195478,0.00021127446,0.003844865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993734,0.0002235841,0.000037827776,0.00008685636,0.00023433557,0.000043954497],"domain_scores_gemma":[0.9996519,0.00020179157,0.000049652936,0.000030313207,0.000052663774,0.0000136064755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008711183,0.0015636747,0.0015153021,0.0013835402,0.00067058596,0.00108159,0.0014662211,0.0019167765,0.0016764363],"category_scores_gemma":[0.0018364682,0.000416707,0.0014428893,0.0023126209,0.00085337984,0.0010225401,0.0009565714,0.0017738981,0.00059832504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004493182,0.000102254824,0.0008207444,0.00035079056,0.00020011952,0.00018008775,0.000080587175,0.76725125,0.0045393296,0.03581338,0.0048923595,0.18572415],"study_design_scores_gemma":[0.000061100756,0.00009078557,0.00020760798,0.00008033152,0.00006475029,0.0001797496,0.0000314888,0.9546031,0.002636105,0.02180367,0.020214302,0.000026971196],"about_ca_topic_score_codex":0.0037950268,"about_ca_topic_score_gemma":0.003560123,"teacher_disagreement_score":0.0037950268,"about_ca_system_score_codex":0.0007508769,"about_ca_system_score_gemma":0.0017625542,"threshold_uncertainty_score":0.0075458884},"labels":[],"label_agreement":null},{"id":"W4401416376","doi":"10.1109/cec60901.2024.10612083","title":"Opposition-based Multi-Objective ADAM Optimizer (OMAdam) for Training ANNs","year":2024,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Ontario Tech University","funders":"","keywords":"Opposition (politics); Training (meteorology); Computer science; Artificial neural network; Artificial intelligence; Operations research; Engineering; Political science; Law; Meteorology","score_opus":0.0872323117370008,"score_gpt":0.3510949414992215,"score_spread":0.2638626297622207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401416376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03588199,0.0006661541,0.95564294,0.0003337828,0.0001231938,0.000120992496,0.0000785296,0.0010097666,0.006142664],"genre_scores_gemma":[0.6107465,0.00030860212,0.38090461,0.00035939124,0.000073383,0.00063036283,0.0002231511,0.00022897433,0.0065249936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964404,0.00016528876,0.00002515988,0.000053316166,0.000076339544,0.000035758207],"domain_scores_gemma":[0.9991804,0.0005121648,0.00008051687,0.00004995584,0.00013355126,0.00004348185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012534257,0.0014940924,0.0010694574,0.0005287182,0.00038072857,0.0007178775,0.0012516256,0.0016628364,0.0027170288],"category_scores_gemma":[0.0028354267,0.000605196,0.00074549275,0.00041545203,0.0006617476,0.0006421847,0.0010026505,0.0020730016,0.0007566531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000653318,0.000033434506,0.00051599584,0.000078409365,0.00003933027,0.00008114917,0.00004870044,0.95787054,0.0018380432,0.004511257,0.0011109377,0.033806853],"study_design_scores_gemma":[0.0000041703192,0.000015254465,0.000028230941,0.000005647114,0.0000021903056,0.000007679548,0.0000026540135,0.9987839,0.00029561954,0.00060652394,0.00024605353,0.0000021017934],"about_ca_topic_score_codex":0.0013945265,"about_ca_topic_score_gemma":0.0020802042,"teacher_disagreement_score":0.0027170288,"about_ca_system_score_codex":0.0006411218,"about_ca_system_score_gemma":0.00068584125,"threshold_uncertainty_score":0.009089351},"labels":[],"label_agreement":null},{"id":"W4401596732","doi":"10.1109/tevc.2024.3443913","title":"Bridging Evolutionary Algorithms and Reinforcement Learning: A Comprehensive Survey on Hybrid Algorithms","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"National Natural Science Foundation of China","keywords":"Algorithm; Bridging (networking); Computer science; Reinforcement learning; Evolutionary algorithm; Evolutionary computation; Artificial intelligence; Machine learning","score_opus":0.03684696776184181,"score_gpt":0.2988468254451176,"score_spread":0.26199985768327577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401596732","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059020245,0.39740452,0.5640473,0.002711032,0.00073512556,0.00010887931,0.00015671026,0.0006179796,0.028316453],"genre_scores_gemma":[0.14993717,0.47075313,0.36397994,0.0015907057,0.002785964,0.00037913237,0.00067985745,0.00040492206,0.009489203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907434,0.0003266613,0.00010347653,0.00015853006,0.00027901548,0.00005795745],"domain_scores_gemma":[0.9980306,0.0015038835,0.00007632588,0.00011707058,0.00022797719,0.000044071356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016478342,0.0013355109,0.0016338518,0.0019002318,0.00038132974,0.0023877693,0.0012865474,0.0015134967,0.0034317672],"category_scores_gemma":[0.003930403,0.00058767403,0.0010438821,0.003430155,0.0007757036,0.0026993284,0.0014210138,0.0015404372,0.0011636867],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082206214,0.00016438353,0.0017033282,0.0028219814,0.00018882428,0.00011729958,0.00018964976,0.07035594,0.0010304468,0.09559308,0.010116598,0.81763625],"study_design_scores_gemma":[0.0000684063,0.00038318225,0.0020731525,0.0023258175,0.00024739787,0.0006583857,0.00034242592,0.4263109,0.0021412286,0.22703053,0.33828747,0.00013110701],"about_ca_topic_score_codex":0.001693717,"about_ca_topic_score_gemma":0.0012137312,"teacher_disagreement_score":0.0034317672,"about_ca_system_score_codex":0.000753987,"about_ca_system_score_gemma":0.0010219383,"threshold_uncertainty_score":0.011480391},"labels":[],"label_agreement":null},{"id":"W4401879610","doi":"10.1109/compsac61105.2024.00285","title":"Synchronous Set-Based Particle Swarm Optimization: Heuristics for Portfolio Optimization","year":2024,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Particle swarm optimization; Multi-swarm optimization; Computer science; Metaheuristic; Mathematical optimization; Heuristics; Portfolio optimization; Set (abstract data type); Portfolio; Algorithm; Mathematics","score_opus":0.030721164745771863,"score_gpt":0.31134818103077777,"score_spread":0.2806270162850059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401879610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011113751,0.00036823083,0.9849761,0.0001308097,0.00006694186,0.00008508637,0.00006392549,0.0002623906,0.0029329068],"genre_scores_gemma":[0.53427464,0.0008052159,0.46097535,0.00025484216,0.00012595394,0.00046836858,0.00025905442,0.00009138202,0.0027451327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994406,0.00022526561,0.000035449408,0.000067942405,0.00018268835,0.000048047652],"domain_scores_gemma":[0.9989557,0.0006645938,0.00012889922,0.00007111841,0.00013750345,0.000042193125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011773154,0.0010849419,0.001185692,0.0010604504,0.00043680528,0.0009973581,0.0011573705,0.0010734899,0.0014465221],"category_scores_gemma":[0.0026253648,0.00049484376,0.00082926673,0.0014031596,0.0006696459,0.0008473954,0.0007059497,0.00085608504,0.00029446906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036452864,0.000035381163,0.00035064484,0.00006529635,0.00004581672,0.000032843658,0.000030338882,0.96083397,0.0008074016,0.00726772,0.0009180712,0.029576002],"study_design_scores_gemma":[0.000012829978,0.000019250218,0.00006682567,0.0000054183674,0.0000059911595,0.00000865846,0.0000047260196,0.9965605,0.00024705665,0.0025551107,0.0005099385,0.000003643455],"about_ca_topic_score_codex":0.0054774634,"about_ca_topic_score_gemma":0.0042481576,"teacher_disagreement_score":0.0054774634,"about_ca_system_score_codex":0.000889495,"about_ca_system_score_gemma":0.0010886489,"threshold_uncertainty_score":0.0108911395},"labels":[],"label_agreement":null},{"id":"W4401931292","doi":"10.18280/jesa.570406","title":"Decentralized Control Design for Heating System in Multi-Zone Buildings Based on Whale Optimization Algorithm","year":2024,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PID controller; Control theory (sociology); MATLAB; Controller (irrigation); Heating system; Computer science; Normalization (sociology); Energy (signal processing); Temperature control; Electric energy consumption; Minification; Energy consumption; Control engineering; Engineering; Control (management); Mathematics; Mechanical engineering","score_opus":0.03776886121649152,"score_gpt":0.30222774619282144,"score_spread":0.2644588849763299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401931292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031572767,0.00018136778,0.96491796,0.00007224605,0.000034519508,0.000047667912,0.000010176494,0.00013041336,0.0030329565],"genre_scores_gemma":[0.94145894,0.00014057009,0.055986073,0.00003484281,0.000022275784,0.00012522144,0.000026232776,0.000017229946,0.0021886847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997029,0.00007258239,0.000013998143,0.00007848897,0.00009899421,0.00003301726],"domain_scores_gemma":[0.9998122,0.00006238723,0.000038820395,0.000016615799,0.000059087495,0.000010844801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005317843,0.000507798,0.0006941794,0.00021719189,0.00040165844,0.0006516078,0.0005866186,0.00048451917,0.0010348739],"category_scores_gemma":[0.0005349628,0.0002302249,0.00041801814,0.00022372013,0.00043648997,0.00044582508,0.00051554816,0.00043865482,0.00012603743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005973424,0.000044028766,0.00042759837,0.00007734064,0.000039231767,0.00004233785,0.0000582176,0.9602252,0.0073675904,0.0046374197,0.00027358544,0.02674774],"study_design_scores_gemma":[0.000010962441,0.00004859808,0.00014832882,0.0000020248733,0.0000060143448,0.000008789487,0.000006913575,0.998307,0.0006761875,0.00047535778,0.00030654328,0.000003223837],"about_ca_topic_score_codex":0.0028306178,"about_ca_topic_score_gemma":0.0029247706,"teacher_disagreement_score":0.0028306178,"about_ca_system_score_codex":0.00034287185,"about_ca_system_score_gemma":0.00068050704,"threshold_uncertainty_score":0.005628288},"labels":[],"label_agreement":null},{"id":"W4402464079","doi":"10.11159/cist24.174","title":"Feature Selection and Classification Performance: A Multi-Dataset Comparative Analysis Using Boruta Algorithm and Random Forest","year":2024,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre National pour la Recherche Scientifique et Technique","keywords":"Random forest; Computer science; Feature selection; Selection (genetic algorithm); Feature (linguistics); Pattern recognition (psychology); Artificial intelligence; Statistical classification; Algorithm; Data mining","score_opus":0.022222570938692208,"score_gpt":0.2777503685963036,"score_spread":0.25552779765761136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402464079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8366301,0.00926702,0.14287199,0.00082409725,0.00037091557,0.0005702851,0.0029736802,0.0030019516,0.0034899716],"genre_scores_gemma":[0.9045754,0.0010176607,0.08775751,0.000122037956,0.00008233298,0.00032316698,0.005194095,0.0001770039,0.0007507167],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995203,0.0020871868,0.00048543498,0.0006946519,0.001163495,0.00036618853],"domain_scores_gemma":[0.9870547,0.008897782,0.0007351263,0.0010965086,0.0020588087,0.00015701467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009687626,0.0015168958,0.00224511,0.004486723,0.0007888411,0.0020012741,0.00078459864,0.001061977,0.0007196845],"category_scores_gemma":[0.015548055,0.00021507693,0.001970423,0.004402039,0.00041803802,0.0019617053,0.00068096863,0.0007818402,0.00045248814],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054719886,0.0016008291,0.1263789,0.0013803762,0.003006256,0.0003575743,0.00040068658,0.14318703,0.013276888,0.0013751342,0.01089085,0.69267344],"study_design_scores_gemma":[0.00030882607,0.0044709737,0.11119754,0.00020629572,0.001204577,0.0008794269,0.0007940627,0.85046947,0.020183302,0.0029779298,0.007093489,0.00021408973],"about_ca_topic_score_codex":0.003985167,"about_ca_topic_score_gemma":0.0036419046,"teacher_disagreement_score":0.009687626,"about_ca_system_score_codex":0.0006933017,"about_ca_system_score_gemma":0.00090668537,"threshold_uncertainty_score":0.05123371},"labels":[],"label_agreement":null},{"id":"W4402474306","doi":"10.1109/ccece59415.2024.10667062","title":"Exploring Common Patterns in Well-Known Metaheuristic Optimization Algorithms","year":2024,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Brock University","funders":"","keywords":"Metaheuristic; Computer science; Parallel metaheuristic; Algorithm; Mathematical optimization; Meta-optimization; Mathematics","score_opus":0.10430084415151553,"score_gpt":0.3160400967171695,"score_spread":0.21173925256565396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402474306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018648008,0.0034406728,0.96999466,0.0010526751,0.00013919144,0.00014969679,0.000109539724,0.00018099688,0.0062845903],"genre_scores_gemma":[0.3113468,0.00563212,0.67609406,0.0006337943,0.00031065385,0.0009019199,0.00060798594,0.00029559253,0.004177049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948507,0.0018274166,0.0005173904,0.0011237126,0.0013230132,0.00035763864],"domain_scores_gemma":[0.9941717,0.0033728266,0.0007532223,0.0008575383,0.00070363015,0.00014106679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005168329,0.0017370244,0.0018527894,0.0036446396,0.0016107607,0.0035825572,0.0033115346,0.0030289562,0.003476367],"category_scores_gemma":[0.020228382,0.00092415,0.0025342733,0.0050435187,0.0030925663,0.0072232652,0.0034420404,0.003236772,0.00084134704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011303309,0.00019225288,0.004724052,0.00085794507,0.00035941484,0.00045305482,0.0008327162,0.16916654,0.0018249274,0.7030525,0.003000251,0.115423314],"study_design_scores_gemma":[0.000033244683,0.00009156045,0.0006797861,0.00017413223,0.000081355436,0.0002767007,0.00018672952,0.44970304,0.0009120214,0.5373243,0.010497396,0.000039658476],"about_ca_topic_score_codex":0.0014572178,"about_ca_topic_score_gemma":0.001651846,"teacher_disagreement_score":0.005168329,"about_ca_system_score_codex":0.0014705838,"about_ca_system_score_gemma":0.0018023084,"threshold_uncertainty_score":0.02733308},"labels":[],"label_agreement":null},{"id":"W4403251249","doi":"10.2139/ssrn.4981246","title":"Providing a Method for Efficient Crossover in Genetic Algorithms with X-Method Coding and its Constraints","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Crossover; Coding (social sciences); Computer science; Algorithm; Genetic algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.023717874585135888,"score_gpt":0.3455430069609815,"score_spread":0.3218251323758456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403251249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016147194,0.00009677392,0.9950728,0.0000904363,0.00006978266,0.000053790365,0.000030598683,0.0002908429,0.0026802216],"genre_scores_gemma":[0.04622584,0.00022674933,0.94585603,0.00015647143,0.000085842854,0.00040304763,0.000097164404,0.0005024004,0.006446447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879825,0.0004636188,0.00006813907,0.00013995076,0.0004489639,0.00008101336],"domain_scores_gemma":[0.99787056,0.0012706307,0.00016319618,0.00034433833,0.00029158054,0.00005969795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012960773,0.0009806883,0.0007586497,0.0010057426,0.00093160133,0.001421202,0.0016193682,0.0015608171,0.0092326505],"category_scores_gemma":[0.0062571075,0.0006428779,0.00091871555,0.0019105732,0.001131261,0.001945517,0.0021766277,0.003143553,0.002385174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022388702,0.00017728539,0.00053999724,0.00042298622,0.00005790268,0.000327768,0.0003056323,0.06871893,0.03844529,0.5009942,0.01094802,0.37883815],"study_design_scores_gemma":[0.00019197524,0.00026006196,0.0005695274,0.00020281343,0.000055403823,0.00082312984,0.00007031225,0.70442677,0.03414218,0.20606415,0.05307382,0.00011977627],"about_ca_topic_score_codex":0.0010853461,"about_ca_topic_score_gemma":0.0012687909,"teacher_disagreement_score":0.0092326505,"about_ca_system_score_codex":0.00051335036,"about_ca_system_score_gemma":0.0012212122,"threshold_uncertainty_score":0.030886233},"labels":[],"label_agreement":null},{"id":"W4403947118","doi":"10.18280/mmep.111025","title":"Stochastic Gradient Descents Optimizer and Its Variants: Performance of the Optimizers for Multinomial Logistic Models on Large Data Sets by Simulation","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multinomial distribution; Multinomial logistic regression; Computer science; Logistic regression; Mathematical optimization; Econometrics; Mathematics; Machine learning","score_opus":0.10319558823282901,"score_gpt":0.2943643076832303,"score_spread":0.1911687194504013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403947118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47164455,0.008028098,0.5065232,0.0029710354,0.0003494093,0.00035783893,0.001360958,0.003290541,0.005474374],"genre_scores_gemma":[0.72141945,0.0009837409,0.27090728,0.00037389906,0.00010804461,0.00045874203,0.0018836011,0.0008176346,0.003047605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963654,0.0026435165,0.0001804766,0.00036137097,0.0002788213,0.00017044214],"domain_scores_gemma":[0.97397137,0.021390386,0.0007377169,0.0014577801,0.001979337,0.0004632831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016299458,0.0018187221,0.002937773,0.0015534194,0.0010272338,0.0016804913,0.0025192483,0.0035298348,0.0017989727],"category_scores_gemma":[0.029374447,0.0010989598,0.0015600875,0.001955586,0.0016972246,0.0024476212,0.0018276201,0.003117522,0.00063992164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042801397,0.00013433103,0.0017107234,0.00011271102,0.00013948235,0.000033148357,0.00006240792,0.9742019,0.00020033367,0.002485847,0.0021356295,0.018355448],"study_design_scores_gemma":[0.000022736738,0.00002810787,0.0001689584,0.000006868693,0.0000069574116,0.000005634327,0.000007965529,0.9990324,0.00009030446,0.0005235089,0.00010118414,0.0000053961244],"about_ca_topic_score_codex":0.028367495,"about_ca_topic_score_gemma":0.016018854,"teacher_disagreement_score":0.028367495,"about_ca_system_score_codex":0.0021027194,"about_ca_system_score_gemma":0.003019568,"threshold_uncertainty_score":0.08620077},"labels":[],"label_agreement":null},{"id":"W4403979562","doi":"10.5206/mt.v4i3.21093","title":"The Extended Watson—Wong—Wyman Lemma in Maple","year":2024,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maple; Watson; Lemma (botany); Mathematics; Computer science; Botany; Artificial intelligence; Biology","score_opus":0.016079056700768653,"score_gpt":0.28409697189768535,"score_spread":0.2680179151969167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403979562","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053555537,0.0005220538,0.96810603,0.0006891859,0.00033615011,0.000055210898,0.0001620674,0.0007531556,0.024020623],"genre_scores_gemma":[0.18839514,0.0017856768,0.77988476,0.0015152841,0.0008198456,0.00080142776,0.00035654847,0.0030027744,0.023438543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817324,0.0004977508,0.00013008453,0.00026065868,0.00071938196,0.00021885951],"domain_scores_gemma":[0.99719715,0.0014253644,0.00015719276,0.00054467673,0.0005787297,0.00009693429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035057869,0.00094272965,0.0010710607,0.0014268617,0.0010629466,0.002894073,0.0018373653,0.0009998012,0.010946504],"category_scores_gemma":[0.011413894,0.00077095156,0.0016989867,0.0020868867,0.00274111,0.007073491,0.0026120984,0.0048455293,0.00478583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058331232,0.000023004024,0.00027487573,0.00010009918,0.000026235517,0.00021604213,0.0001609912,0.009730588,0.0021542453,0.9321298,0.009585006,0.045540776],"study_design_scores_gemma":[0.000037996047,0.00003915517,0.00019787156,0.00005650725,0.00002396431,0.00020796235,0.000029999845,0.08220031,0.0051186867,0.8658438,0.046194393,0.000049359318],"about_ca_topic_score_codex":0.0019821366,"about_ca_topic_score_gemma":0.0015719337,"teacher_disagreement_score":0.010946504,"about_ca_system_score_codex":0.00079551,"about_ca_system_score_gemma":0.0010779066,"threshold_uncertainty_score":0.036619723},"labels":[],"label_agreement":null},{"id":"W4404460122","doi":"10.1007/s00500-024-10328-7","title":"Shuffled multi-evolutionary algorithm with linear population size reduction","year":2024,"lang":"en","type":"article","venue":"Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Reduction (mathematics); Algorithm; Evolutionary algorithm; Population; Mathematics; Computer science; Mathematical optimization","score_opus":0.020844793063182227,"score_gpt":0.29947190413810953,"score_spread":0.2786271110749273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404460122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06677527,0.00034365142,0.92157084,0.00020819038,0.00019271215,0.00014106238,0.00013309642,0.00093823415,0.009696958],"genre_scores_gemma":[0.4394364,0.00013720705,0.5466363,0.00019716483,0.000050914303,0.0004026587,0.00028994828,0.00018491995,0.012664485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995796,0.00015545318,0.000021611979,0.00006996701,0.00012401398,0.000049370585],"domain_scores_gemma":[0.99934286,0.0002792161,0.000044046013,0.00012950005,0.00016415238,0.000040194678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076039083,0.00048782944,0.0008076775,0.0007578694,0.00055477436,0.00068570336,0.0014198824,0.00094280636,0.0050444594],"category_scores_gemma":[0.0019135636,0.00038627177,0.0006113907,0.00095556484,0.00040538187,0.0010453006,0.0011140689,0.0007708035,0.00088268454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032650479,0.00031467513,0.00096761534,0.00014548702,0.00012015673,0.00013684014,0.00011271932,0.72650313,0.012498412,0.016408551,0.0036640477,0.23880182],"study_design_scores_gemma":[0.00004474796,0.00009748134,0.00019287947,0.000005986811,0.000014547918,0.00004157506,0.000010760928,0.9932526,0.002206592,0.0027798293,0.0013450161,0.000008034276],"about_ca_topic_score_codex":0.0014842771,"about_ca_topic_score_gemma":0.0020105,"teacher_disagreement_score":0.0050444594,"about_ca_system_score_codex":0.00055446883,"about_ca_system_score_gemma":0.00092117995,"threshold_uncertainty_score":0.016875386},"labels":[],"label_agreement":null},{"id":"W4404944255","doi":"10.1007/s12206-024-1125-6","title":"Principle and performance validation of search and rescue team algorithm","year":2024,"lang":"en","type":"article","venue":"Journal of Mechanical Science and Technology","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Knapsack problem; Algorithm; Robustness (evolution); Metaheuristic; Mathematical optimization; Computer science; Modal; Optimization problem; Mathematics","score_opus":0.01922730556347673,"score_gpt":0.3107953147575139,"score_spread":0.29156800919403714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404944255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04346027,0.0004891013,0.9346323,0.00042484998,0.00016940827,0.00014900153,0.00006187016,0.0002982096,0.020314977],"genre_scores_gemma":[0.8298288,0.0003530591,0.16508298,0.00013024085,0.00013529221,0.00023610552,0.00013625986,0.00013774488,0.0039594932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981566,0.00067923585,0.00005967271,0.0002407743,0.00073620887,0.00012754761],"domain_scores_gemma":[0.997577,0.001176266,0.00013647566,0.00036304,0.00066871516,0.000078495395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034355808,0.00062059617,0.000684998,0.00086912554,0.0008960847,0.001390795,0.0015158642,0.0013152112,0.0022756464],"category_scores_gemma":[0.006746411,0.00021693773,0.0007350585,0.00065318495,0.0012422298,0.0013490404,0.001707049,0.0010029553,0.0005391843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032045308,0.00011310654,0.0023847562,0.00022486155,0.00010204173,0.000091133435,0.00013257524,0.65938365,0.015835648,0.23850258,0.0026199177,0.080289155],"study_design_scores_gemma":[0.000015484546,0.00009872344,0.00027539465,0.000008121059,0.000011222216,0.00005043252,0.000010935294,0.98625594,0.0022287923,0.010290855,0.0007463779,0.000007682238],"about_ca_topic_score_codex":0.001263646,"about_ca_topic_score_gemma":0.00031847318,"teacher_disagreement_score":0.0034355808,"about_ca_system_score_codex":0.00080937095,"about_ca_system_score_gemma":0.0014988662,"threshold_uncertainty_score":0.018169284},"labels":[],"label_agreement":null},{"id":"W4405245753","doi":"10.1145/3707465","title":"An Evolutionary Algorithm for Expensive Mixed-Integer Black-Box Optimization with Explicit Constraints","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Evolutionary Learning and Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Black box; Mathematical optimization; Integer (computer science); Evolutionary algorithm; Set (abstract data type); Algorithm; Exploit; Computer science; Constraint (computer-aided design); Function (biology); Optimization problem; Integer programming; Constrained optimization problem; Process (computing); Mathematics; Artificial intelligence","score_opus":0.014629037312522528,"score_gpt":0.2775491560978298,"score_spread":0.2629201187853073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405245753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007421163,0.000110936126,0.9896041,0.00012224488,0.00003104213,0.000052705036,0.00001749879,0.00019204839,0.0024483392],"genre_scores_gemma":[0.11143462,0.00011281348,0.8847524,0.00012275945,0.000024197147,0.00030298083,0.00006872535,0.00008446923,0.0030969896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944276,0.00018446802,0.000024626319,0.00009256565,0.00019166333,0.000063800435],"domain_scores_gemma":[0.99881506,0.0008430149,0.000076601515,0.00007485359,0.00013612956,0.00005446608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014913197,0.0009915291,0.001040317,0.00064475054,0.0006201394,0.0009100288,0.001449854,0.0018087942,0.003575488],"category_scores_gemma":[0.0034638415,0.0006190806,0.00080190477,0.00073052006,0.0008384415,0.00093421194,0.0014107756,0.001789942,0.0004957538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057431786,0.00007615851,0.00036767861,0.000059756185,0.00004146365,0.00008745659,0.00006171341,0.8872455,0.0024654109,0.03245998,0.0012772696,0.07580017],"study_design_scores_gemma":[0.000019390236,0.000015870784,0.0000291465,0.0000057282514,0.0000049795494,0.00001562221,0.00000417806,0.9952047,0.0002702281,0.00382766,0.00059886405,0.0000036814158],"about_ca_topic_score_codex":0.0023367216,"about_ca_topic_score_gemma":0.0027311747,"teacher_disagreement_score":0.003575488,"about_ca_system_score_codex":0.0007431662,"about_ca_system_score_gemma":0.001411129,"threshold_uncertainty_score":0.011961162},"labels":[],"label_agreement":null},{"id":"W4405384256","doi":"10.1007/s11227-024-06803-5","title":"Publisher Correction: Cooperative, collaborative, coevolutionary multi-objective optimization on CPU-GPU multi-core","year":2024,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Core (optical fiber); Multi-core processor; Parallel computing; Many core; Telecommunications","score_opus":0.041707348238248565,"score_gpt":0.3120371033853171,"score_spread":0.27032975514706853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405384256","genre_codex":"editorial","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040916636,0.0013921696,0.0029207633,0.02561166,0.9600459,0.000029602399,0.0016125019,0.0009624516,0.0070158443],"genre_scores_gemma":[0.050577138,0.010295092,0.018420449,0.045455694,0.24151817,0.00027653953,0.0073345844,0.0054302467,0.62069213],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957826,0.0005839442,0.00061916484,0.0006668365,0.0020233442,0.00032411626],"domain_scores_gemma":[0.95976806,0.004960633,0.001322491,0.0036926733,0.029079895,0.001176295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003613018,0.0017743575,0.0022383577,0.0035824943,0.0033001143,0.0045810733,0.004603874,0.005115083,0.07870463],"category_scores_gemma":[0.0561215,0.0009900243,0.0016705339,0.0043922924,0.0025893815,0.003230615,0.0023865327,0.009554164,0.045723375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054872435,0.000007365133,0.00013525492,0.00019286347,0.000024403545,0.00019543617,0.00004768764,0.00028537615,0.00010970799,0.0026720397,0.9861078,0.01016702],"study_design_scores_gemma":[0.000062781866,0.00003474704,0.0010351276,0.000283147,0.00006610603,0.0005879707,0.00011041239,0.0013602972,0.0010672605,0.0033815654,0.99195486,0.00005572465],"about_ca_topic_score_codex":0.022047898,"about_ca_topic_score_gemma":0.022154484,"teacher_disagreement_score":0.07870463,"about_ca_system_score_codex":0.0036318053,"about_ca_system_score_gemma":0.006140004,"threshold_uncertainty_score":0.2632932},"labels":[],"label_agreement":null},{"id":"W4405791888","doi":"10.18280/isi.290606","title":"Performance Assessment of Three Swarm Intelligence Algorithms in Combinatorial Problem","year":2024,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Swarm intelligence; Computer science; Swarm behaviour; Algorithm; Artificial intelligence; Particle swarm optimization","score_opus":0.03855522446078999,"score_gpt":0.307209874404058,"score_spread":0.26865464994326804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405791888","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80034846,0.0037923064,0.15441407,0.0013632834,0.00063384743,0.00041958736,0.0003379348,0.0010704233,0.037620135],"genre_scores_gemma":[0.92526084,0.0005662695,0.070864104,0.00011359236,0.00008207782,0.00021156555,0.00044545642,0.00010105368,0.0023551523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971602,0.0012043386,0.00021252589,0.00028896824,0.0007547326,0.00037924107],"domain_scores_gemma":[0.9834262,0.011860392,0.0007248069,0.00095179264,0.0023600697,0.00067672465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005972645,0.0014162125,0.001412612,0.0028667497,0.0009577674,0.002725453,0.0013729262,0.002536555,0.002185647],"category_scores_gemma":[0.01682098,0.00028072062,0.00096625014,0.0019104551,0.0011927208,0.0016461187,0.0011827946,0.0011785463,0.00032554878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023400653,0.0010793498,0.006470266,0.0005155867,0.00036862717,0.000086587905,0.0001940677,0.83481187,0.0027900198,0.011672052,0.002801629,0.13686977],"study_design_scores_gemma":[0.00014252243,0.0006526957,0.0014061544,0.00002299,0.00007065459,0.000029036513,0.00008519408,0.9930352,0.0024763793,0.0015726879,0.000489987,0.000016549573],"about_ca_topic_score_codex":0.004926789,"about_ca_topic_score_gemma":0.0027504733,"teacher_disagreement_score":0.005972645,"about_ca_system_score_codex":0.0022923104,"about_ca_system_score_gemma":0.0018603614,"threshold_uncertainty_score":0.031586707},"labels":[],"label_agreement":null},{"id":"W4406161035","doi":"10.1016/j.eswa.2025.126398","title":"t-SNE-PSO: Optimizing t-SNE using particle swarm optimization","year":2025,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Bishop's University","funders":"","keywords":"Particle swarm optimization; Computer science; Metaheuristic; Multi-swarm optimization; Mathematical optimization; Particle (ecology); Algorithm; Mathematics","score_opus":0.02750459388104861,"score_gpt":0.31741090542930855,"score_spread":0.28990631154825997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406161035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010336813,0.0003010427,0.9804534,0.000133175,0.00027981462,0.00010701566,0.00008607072,0.0011300951,0.0071726255],"genre_scores_gemma":[0.18682629,0.00025485636,0.80374515,0.00022672192,0.00009797321,0.00029932603,0.0003657704,0.00046563795,0.0077182557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967885,0.000101703205,0.000020908928,0.000055827855,0.00011642739,0.000026302117],"domain_scores_gemma":[0.9995461,0.00019530929,0.000034807104,0.000048596903,0.00015450384,0.000020632224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064840505,0.00091741135,0.000965084,0.0007091086,0.00041856422,0.0006991702,0.0009966342,0.0015782455,0.0034154186],"category_scores_gemma":[0.0021821829,0.00040911933,0.0009480878,0.00091861095,0.0003386895,0.0007427559,0.00059528305,0.0010637996,0.0008274071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091225455,0.00012715456,0.0005845747,0.00012992724,0.00012318826,0.00008622774,0.000040031115,0.8617046,0.0022900137,0.006280289,0.0054371543,0.12310563],"study_design_scores_gemma":[0.000010908958,0.000016062939,0.000051903353,0.0000038758776,0.000005591323,0.000011183525,0.0000028459779,0.9981458,0.00042131887,0.0005184782,0.00080877676,0.0000032879504],"about_ca_topic_score_codex":0.006459709,"about_ca_topic_score_gemma":0.0066794455,"teacher_disagreement_score":0.006459709,"about_ca_system_score_codex":0.00032848184,"about_ca_system_score_gemma":0.00078929344,"threshold_uncertainty_score":0.012844205},"labels":[],"label_agreement":null},{"id":"W4406411297","doi":"10.1016/j.amc.2025.129278","title":"A new mathematical model and solution method for the asymmetric traveling salesman problem with replenishment arcs","year":2025,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Computer science; Applied mathematics; Mathematics","score_opus":0.03024387723599984,"score_gpt":0.3162004486415981,"score_spread":0.2859565714055982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406411297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070953066,0.00015166665,0.9969631,0.00015224269,0.000036538106,0.00003874741,0.000048128113,0.000053624677,0.0018464935],"genre_scores_gemma":[0.07130724,0.0012533515,0.91892165,0.0002475052,0.00016930654,0.00055516127,0.00032691105,0.00015552215,0.007063343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993668,0.00018574581,0.00003874006,0.00012808878,0.00022009677,0.000060642982],"domain_scores_gemma":[0.99959546,0.00018826537,0.00006278221,0.000032618038,0.00009458482,0.000026246253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013734722,0.0014373426,0.0010860576,0.0013860791,0.00058904797,0.0015184018,0.0026097454,0.0016711656,0.005130048],"category_scores_gemma":[0.0017155315,0.00076031266,0.0020814717,0.0016408672,0.00083678216,0.0025638104,0.0015006363,0.0034259942,0.0011444652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026870051,0.00006658982,0.00023896042,0.00030460698,0.000038983,0.00019750075,0.00014398813,0.74274004,0.003035707,0.19643897,0.0062272116,0.050540645],"study_design_scores_gemma":[0.000009720154,0.000018684786,0.000024297242,0.000017756844,0.000007989245,0.000058292615,0.000017383278,0.9783811,0.00025701497,0.015602293,0.005595326,0.000010088004],"about_ca_topic_score_codex":0.005602553,"about_ca_topic_score_gemma":0.0044643283,"teacher_disagreement_score":0.005602553,"about_ca_system_score_codex":0.0014537417,"about_ca_system_score_gemma":0.0028997064,"threshold_uncertainty_score":0.017161727},"labels":[],"label_agreement":null},{"id":"W4406852867","doi":"10.1016/j.ins.2025.121908","title":"Adaptive knowledge transfer based on machine learning method for evolutionary multitasking optimization","year":2025,"lang":"en","type":"article","venue":"Information Sciences","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Defense Basic Scientific Research Program of China; Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Human multitasking; Computer science; Transfer of learning; Artificial intelligence; Knowledge transfer; Machine learning; Distributed computing; Theoretical computer science; Knowledge management; Psychology; Cognitive psychology","score_opus":0.03902144589697563,"score_gpt":0.3539665320585347,"score_spread":0.31494508616155903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406852867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024894493,0.00026833458,0.97018045,0.00020580186,0.00009431834,0.00007544466,0.000013929174,0.00015006267,0.004117223],"genre_scores_gemma":[0.7573408,0.00024630327,0.2362488,0.00021029056,0.00011212918,0.00042994475,0.000064280546,0.00008361638,0.0052639297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00018560523,0.000021257847,0.000068644345,0.00011448654,0.00004964721],"domain_scores_gemma":[0.9986688,0.0009124292,0.00008106468,0.00006258121,0.00022520524,0.000049925406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014168452,0.0006063386,0.0011062335,0.0008038442,0.00061086967,0.00068501494,0.0013741107,0.0014118698,0.0029092333],"category_scores_gemma":[0.0035097285,0.0003191053,0.00073336804,0.0007126066,0.00067989534,0.0011129301,0.0011709275,0.0011087212,0.0002922269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059366266,0.00012994364,0.00030249567,0.00006818941,0.000050637063,0.000057347137,0.000056629207,0.92045325,0.0014956509,0.011036692,0.00087093114,0.065418944],"study_design_scores_gemma":[0.0000045964634,0.000015122362,0.00003504104,0.0000024445274,0.0000035918897,0.00000552361,0.0000027130438,0.99829704,0.00011767849,0.0014071873,0.00010711673,0.0000019513648],"about_ca_topic_score_codex":0.0030991575,"about_ca_topic_score_gemma":0.0019938063,"teacher_disagreement_score":0.0030991575,"about_ca_system_score_codex":0.0007930233,"about_ca_system_score_gemma":0.0010796778,"threshold_uncertainty_score":0.009732366},"labels":[],"label_agreement":null},{"id":"W4407093524","doi":"10.1002/cjce.25323","title":"Issue Highlights","year":2025,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.008186961107944415,"score_gpt":0.22668534184266673,"score_spread":0.2184983807347223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407093524","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005982902,0.008266856,0.000566884,0.17253917,0.4825113,0.00024750608,0.002527091,0.00056628016,0.33217663],"genre_scores_gemma":[0.004083055,0.0057482007,0.00044266667,0.07517712,0.15218882,0.00015972882,0.0016793441,0.00029342307,0.76022756],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980934,0.00020102078,0.000075713564,0.00021052014,0.0010897998,0.00032961005],"domain_scores_gemma":[0.99307936,0.0007876503,0.00036523357,0.00034015055,0.0030607183,0.0023669023],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0022066652,0.0007925905,0.000660197,0.0013457655,0.0015454422,0.006200026,0.0016549291,0.005939138,0.3881645],"category_scores_gemma":[0.01076559,0.00032805122,0.0009391051,0.00090196094,0.0006269126,0.0018625079,0.0019493419,0.004091416,0.19091406],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014635536,0.000008168532,0.00004915551,0.000054114138,0.0000017843034,0.000029485107,0.000004540212,0.0000067087444,0.00004608393,0.0006049894,0.9877694,0.011410861],"study_design_scores_gemma":[0.000009160451,0.00000839499,0.0002160505,0.00004762776,0.0000022522652,0.000043186534,0.000016034002,0.0000111841055,0.000041077907,0.0004151979,0.9991872,0.00000256557],"about_ca_topic_score_codex":0.002763724,"about_ca_topic_score_gemma":0.006849027,"teacher_disagreement_score":0.6118355,"about_ca_system_score_codex":0.001620086,"about_ca_system_score_gemma":0.0052365162,"threshold_uncertainty_score":0.8727091},"labels":[],"label_agreement":null},{"id":"W4407362332","doi":"10.1109/isgteurope62998.2024.10863283","title":"Topology and Parameter Identification in Electrical Distribution Systems using Spatial Priors","year":2024,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Mitacs","keywords":"Prior probability; Topology (electrical circuits); Identification (biology); Computer science; Distribution (mathematics); Artificial intelligence; Mathematics; Bayesian probability; Mathematical analysis; Combinatorics","score_opus":0.02728989919175039,"score_gpt":0.3195673994291534,"score_spread":0.292277500237403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407362332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055040033,0.00007092322,0.9935934,0.00004224491,0.0000068084764,0.00000943382,0.00003521913,0.00010395265,0.0006339831],"genre_scores_gemma":[0.6523669,0.00042669775,0.3441979,0.00006617938,0.000060075457,0.0001313943,0.00046083794,0.00012973911,0.0021604109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994369,0.00024779644,0.000021884682,0.00011240924,0.00014874928,0.00003212073],"domain_scores_gemma":[0.99836284,0.0010540824,0.00023358036,0.00015439527,0.00016242483,0.000032651475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095518434,0.00085015164,0.0007321726,0.00094910903,0.00030677902,0.00092688674,0.00083549577,0.0005504605,0.001186649],"category_scores_gemma":[0.004982877,0.0006300678,0.00063762104,0.0008439003,0.0006375068,0.0016308438,0.0010114141,0.0010758159,0.00031239327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017635411,0.000007784549,0.00034852844,0.000028033932,0.000013869256,0.00002278395,0.000024412811,0.96720636,0.0004917404,0.005276352,0.00018493646,0.026377501],"study_design_scores_gemma":[0.0000020625268,0.000006038102,0.00015381684,0.0000048185693,0.0000022925021,0.000012240498,0.000007022875,0.99492127,0.0003062209,0.0041975537,0.0003832183,0.000003490625],"about_ca_topic_score_codex":0.0034247409,"about_ca_topic_score_gemma":0.0028392165,"teacher_disagreement_score":0.0034247409,"about_ca_system_score_codex":0.0005379723,"about_ca_system_score_gemma":0.00080010836,"threshold_uncertainty_score":0.0068095922},"labels":[],"label_agreement":null},{"id":"W4407598381","doi":"10.1016/j.swevo.2024.101839","title":"Evolutionary algorithm based on multi-probability distribution model for stochastic optimization","year":2025,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Estimation of distribution algorithm; Algorithm; Evolutionary algorithm; Stochastic optimization; Probability distribution; Mathematical optimization; Artificial intelligence; Mathematics; Statistics","score_opus":0.029423580042932097,"score_gpt":0.2983921817003596,"score_spread":0.2689686016574275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407598381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045846542,0.00040007482,0.99253243,0.00016476306,0.00007005281,0.000016666414,0.000013188418,0.000039973096,0.0021782506],"genre_scores_gemma":[0.58505934,0.0018863496,0.39949682,0.00021645582,0.00024381524,0.0003320069,0.00018641136,0.00015384621,0.012424897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.00025301042,0.000023454253,0.000079379075,0.00018393793,0.00004086069],"domain_scores_gemma":[0.99917847,0.0005578071,0.000056891786,0.000043451673,0.0001349137,0.000028390674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011550583,0.0006865037,0.0014836673,0.0007610549,0.00058324845,0.0011453235,0.0015506344,0.0014349814,0.0015663495],"category_scores_gemma":[0.0031737296,0.0004883633,0.001253674,0.0013540927,0.00086255267,0.0018430321,0.00095348543,0.0018590089,0.00025786573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001346208,0.000021075102,0.00022319956,0.00004127816,0.000044502955,0.000039368144,0.000028644074,0.92555094,0.0005511978,0.06063717,0.0005000145,0.012349123],"study_design_scores_gemma":[0.000002573326,0.0000050025674,0.000030168792,0.000002118489,0.000003142686,0.00000768948,0.0000014090742,0.995363,0.000036396134,0.0043550837,0.000191391,0.0000020671496],"about_ca_topic_score_codex":0.004852188,"about_ca_topic_score_gemma":0.0024949436,"teacher_disagreement_score":0.004852188,"about_ca_system_score_codex":0.001090939,"about_ca_system_score_gemma":0.0009601461,"threshold_uncertainty_score":0.009647846},"labels":[],"label_agreement":null},{"id":"W4407860886","doi":"10.1007/s00521-025-11074-z","title":"The firefighter algorithm for optimization problems","year":2025,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computational Science and Engineering; Computer science; Algorithm; Mathematical optimization; Mathematics; Computational science","score_opus":0.016961697811060925,"score_gpt":0.30561413653053726,"score_spread":0.2886524387194763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407860886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001313051,0.001375249,0.99281704,0.0002214996,0.00014268326,0.000027685033,0.000022000437,0.00015283932,0.003927959],"genre_scores_gemma":[0.057216443,0.0022874062,0.93131244,0.00024743975,0.00033326424,0.00022543399,0.00015569809,0.00031977732,0.007902114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931204,0.0002599377,0.000023133907,0.00006664589,0.00027847994,0.000059715243],"domain_scores_gemma":[0.999418,0.0003518021,0.000032619566,0.00006200321,0.00010616855,0.000029338113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016181383,0.0014895195,0.0016897444,0.0011454528,0.00072749174,0.0011950834,0.0017475561,0.0018509667,0.0038881793],"category_scores_gemma":[0.0035282013,0.00065918977,0.0012191329,0.0017565942,0.0011133262,0.0013671045,0.0012131719,0.0036654773,0.0015402114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014699262,0.00011763301,0.00039000684,0.00033799617,0.0001693216,0.000067628374,0.00008857433,0.5075746,0.003203627,0.18684354,0.014438766,0.28662127],"study_design_scores_gemma":[0.000049100392,0.000037533617,0.00008371837,0.000039354552,0.00002119299,0.000039708593,0.000008117748,0.9409686,0.0007577944,0.04794887,0.010033671,0.000012366973],"about_ca_topic_score_codex":0.0034501217,"about_ca_topic_score_gemma":0.002918764,"teacher_disagreement_score":0.0038881793,"about_ca_system_score_codex":0.0009036853,"about_ca_system_score_gemma":0.0014666449,"threshold_uncertainty_score":0.013007283},"labels":[],"label_agreement":null},{"id":"W4408862731","doi":"10.1109/icce63647.2025.10929970","title":"An Ising Machine-Based Hybrid Optimization Method Using Constraint Conversion and Correction","year":2025,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institutes for Quantum and Radiological Science and Technology; Council for Science, Technology and Innovation; Swine Innovation Porc","keywords":"Constraint (computer-aided design); Computer science; Ising model; Mathematical optimization; Mathematics; Statistical physics; Physics","score_opus":0.021023189146535014,"score_gpt":0.3378188546855835,"score_spread":0.3167956655390485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408862731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049195047,0.00023009125,0.99107236,0.00007197294,0.000059671194,0.00003578157,0.000019339874,0.00016862852,0.0034226198],"genre_scores_gemma":[0.20954145,0.00043311462,0.7836829,0.0001780597,0.000077285615,0.000254716,0.00013097085,0.00016522637,0.005536349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00009218216,0.000014767062,0.000043518532,0.00015308753,0.000018293866],"domain_scores_gemma":[0.99960464,0.00019722209,0.00004194358,0.000047000794,0.000095865886,0.000013418534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055928406,0.0006154059,0.00078524754,0.00057665457,0.00043206953,0.00058734196,0.0011956408,0.000870122,0.0023493927],"category_scores_gemma":[0.0011855825,0.0003031505,0.0005729732,0.0010957683,0.00044086296,0.00092577684,0.00046914705,0.0009854889,0.00039726877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055614288,0.000059398353,0.00032708969,0.00015877673,0.00006754584,0.00007026953,0.000042612777,0.8340339,0.005859666,0.028787246,0.0019373407,0.12860057],"study_design_scores_gemma":[0.0000068617114,0.00001484141,0.000039117873,0.0000049374107,0.0000047780236,0.000016212136,0.0000026881385,0.99591184,0.0006982246,0.0019733338,0.0013213896,0.0000059208705],"about_ca_topic_score_codex":0.002662662,"about_ca_topic_score_gemma":0.0027496782,"teacher_disagreement_score":0.002662662,"about_ca_system_score_codex":0.00047761228,"about_ca_system_score_gemma":0.0010252978,"threshold_uncertainty_score":0.007859528},"labels":[],"label_agreement":null},{"id":"W4409084041","doi":"10.18280/mmep.120329","title":"Fast Slow Optimization: An Adaptive Stochastic Optimization that Employs Both Short and Long Step Size Searches","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universitas Telkom","keywords":"Stochastic optimization; Mathematical optimization; Computer science; Adaptive optimization; Mathematics","score_opus":0.04504432079004283,"score_gpt":0.25884124973230527,"score_spread":0.21379692894226243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409084041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013549521,0.000261196,0.9819806,0.00014119981,0.00019486669,0.00015286572,0.000053096977,0.00077990175,0.0028866648],"genre_scores_gemma":[0.21586059,0.00029503132,0.7756021,0.00038202523,0.00021941829,0.00083274685,0.00020922927,0.0006902786,0.0059086336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917847,0.00028296592,0.000048258804,0.00009657253,0.0003362217,0.000057464284],"domain_scores_gemma":[0.99792373,0.0011043036,0.00015033918,0.0002698822,0.00040955425,0.00014208196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024942127,0.001222561,0.0017296021,0.0013534854,0.00085895305,0.0012948774,0.0025039157,0.0020784826,0.0029808118],"category_scores_gemma":[0.005765334,0.0009265922,0.0011253903,0.0014699167,0.0010865409,0.0015292154,0.002366035,0.0019767692,0.0007565413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037403824,0.0002709254,0.0012340455,0.00022105877,0.00025678994,0.00010577969,0.00009942532,0.8230876,0.0069894576,0.025852399,0.004010603,0.13749799],"study_design_scores_gemma":[0.000033074284,0.000059243448,0.00007336298,0.0000044746494,0.0000139781005,0.000014937292,0.0000032517744,0.99700326,0.0004480032,0.001605784,0.0007319432,0.000008750401],"about_ca_topic_score_codex":0.002731741,"about_ca_topic_score_gemma":0.0049700113,"teacher_disagreement_score":0.0029808118,"about_ca_system_score_codex":0.00068192586,"about_ca_system_score_gemma":0.0019667542,"threshold_uncertainty_score":0.013190806},"labels":[],"label_agreement":null},{"id":"W4409119625","doi":"10.1038/s41598-025-89458-3","title":"An integrative TLBO-driven hybrid grey wolf optimizer for the efficient resolution of multi-dimensional, nonlinear engineering problems","year":2025,"lang":"en","type":"article","venue":"Scientific Reports","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmark (surveying); Computer science; Adaptability; Mathematical optimization; Zoom; Local optimum; Artificial intelligence; Nonlinear system; Optimization problem; Machine learning; Algorithm; Mathematics; Engineering","score_opus":0.02055967211135816,"score_gpt":0.29492641017782983,"score_spread":0.27436673806647166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409119625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010067754,0.00027310962,0.98372006,0.0001185872,0.00006080008,0.000051257182,0.000025073146,0.00053347275,0.0051498823],"genre_scores_gemma":[0.43000418,0.00040377124,0.55967206,0.0003701424,0.00006898791,0.00037779319,0.00018720586,0.00030879176,0.0086070895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997836,0.000051552168,0.000009937486,0.000032468986,0.00009757297,0.00002490942],"domain_scores_gemma":[0.9997826,0.0000892598,0.0000285181,0.000022748583,0.000053497504,0.000023380178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006679453,0.0006938924,0.0009337759,0.00048606307,0.00040636232,0.000743021,0.0011459461,0.0012613864,0.0025854376],"category_scores_gemma":[0.0009872811,0.00036514853,0.0007217815,0.00043718496,0.0005158453,0.00057121547,0.0010355825,0.00087544805,0.0006446105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007841495,0.00007670169,0.0007109049,0.0001619749,0.00008710476,0.00012799798,0.00008903247,0.8711574,0.010313548,0.010770543,0.0024397797,0.1039865],"study_design_scores_gemma":[0.000009667374,0.000022080269,0.0000629444,0.000006437833,0.000005465422,0.00001652692,0.00000446345,0.99683607,0.00065044395,0.0012396001,0.0011417227,0.0000046075907],"about_ca_topic_score_codex":0.0021092782,"about_ca_topic_score_gemma":0.0025692286,"teacher_disagreement_score":0.0025854376,"about_ca_system_score_codex":0.00038572936,"about_ca_system_score_gemma":0.0008508992,"threshold_uncertainty_score":0.00864917},"labels":[],"label_agreement":null},{"id":"W4409209732","doi":"10.1007/s42979-025-03889-3","title":"Enhancing Grey Wolf Optimization with Applications and Innovations","year":2025,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vale (Canada)","funders":"","keywords":"Computer science","score_opus":0.012394233747254681,"score_gpt":0.2815383089642552,"score_spread":0.2691440752170005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409209732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02249929,0.0017864458,0.9522835,0.00047622886,0.00025894656,0.000042722255,0.000011816658,0.00019881577,0.02244235],"genre_scores_gemma":[0.62481743,0.0026642224,0.34941196,0.0003404138,0.00037519692,0.0001045592,0.000032889813,0.00014502686,0.022108175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999683,0.000112570924,0.000012209923,0.00004039665,0.00012744794,0.000024424935],"domain_scores_gemma":[0.99965084,0.00016635004,0.000029365776,0.000043662505,0.00009191726,0.000017929073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007139158,0.00054238783,0.00056178146,0.0005878323,0.00027878932,0.0009267133,0.00065576663,0.0010862371,0.0027088288],"category_scores_gemma":[0.0022393132,0.00022428931,0.00054851506,0.000788973,0.00078933703,0.0011014133,0.0014033775,0.0008720846,0.00052457734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010023865,0.00011491704,0.00056468643,0.00031170525,0.00009481429,0.00021392207,0.00015668145,0.3992119,0.025661718,0.29668394,0.0033088992,0.27357653],"study_design_scores_gemma":[0.000011944222,0.00008490923,0.00017635162,0.000021369447,0.000024887535,0.00009541505,0.0000149918305,0.9300101,0.0041696476,0.057799295,0.007578917,0.000012226515],"about_ca_topic_score_codex":0.00043376093,"about_ca_topic_score_gemma":0.0003796246,"teacher_disagreement_score":0.0027088288,"about_ca_system_score_codex":0.00032511703,"about_ca_system_score_gemma":0.0003472233,"threshold_uncertainty_score":0.009061933},"labels":[],"label_agreement":null},{"id":"W4409361896","doi":"10.1609/aaai.v39i25.34911","title":"Anchor Search: A Unified Framework for Suboptimal Bidirectional Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alliance de recherche numérique du Canada; Israel Science Foundation; Israel National Road Safety Authority; Canadian Institute for Advanced Research","keywords":"Computer science","score_opus":0.15076007786207432,"score_gpt":0.3779439235649356,"score_spread":0.2271838457028613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039672926,0.00043154342,0.9918139,0.000167312,0.000032274547,0.00006741802,0.000048242222,0.00022454829,0.0032475984],"genre_scores_gemma":[0.18456091,0.00072949444,0.8107478,0.0002459033,0.000068748355,0.00047606407,0.00026862475,0.0002607275,0.002641764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729675,0.0012186635,0.00018822512,0.00038648592,0.0006694584,0.0002404834],"domain_scores_gemma":[0.99734783,0.0014011879,0.00021956646,0.0005015479,0.00039696821,0.0001328521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004126327,0.0012889593,0.0021009382,0.0016898409,0.0009686226,0.0025722953,0.003011364,0.0021854558,0.004865339],"category_scores_gemma":[0.011676215,0.0007769276,0.001316077,0.002323723,0.0017697773,0.0031449744,0.0036842332,0.0023785888,0.00092095305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012321062,0.000093786446,0.00084203994,0.00025984747,0.00006808952,0.00010918188,0.00022830145,0.5860981,0.0013059798,0.28846484,0.003690908,0.118715785],"study_design_scores_gemma":[0.000029419902,0.000066201224,0.00006216521,0.000046746678,0.000017563556,0.000053270225,0.000045607867,0.89969814,0.0004393155,0.09545244,0.0040721633,0.00001696495],"about_ca_topic_score_codex":0.0037184816,"about_ca_topic_score_gemma":0.0030439903,"teacher_disagreement_score":0.004865339,"about_ca_system_score_codex":0.0017001494,"about_ca_system_score_gemma":0.0032459185,"threshold_uncertainty_score":0.021822333},"labels":[],"label_agreement":null},{"id":"W4409362866","doi":"10.1609/aaai.v39i25.34905","title":"Suboptimal Search with Dynamic Distribution of Suboptimality","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Distribution (mathematics); Mathematics","score_opus":0.05123822905305393,"score_gpt":0.3277991023609898,"score_spread":0.2765608733079359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05718539,0.0005128419,0.93585247,0.00033966047,0.00006050158,0.00012194389,0.00007284012,0.000552475,0.0053019035],"genre_scores_gemma":[0.75689757,0.00030826696,0.2390896,0.0002406872,0.000037353933,0.0003386154,0.000147684,0.00019336092,0.0027468607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815255,0.0007209872,0.00013300368,0.0004211592,0.0003780981,0.00019409957],"domain_scores_gemma":[0.99327433,0.004139927,0.0005079512,0.0010882143,0.00073621835,0.00025333295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026687067,0.001003949,0.0013206237,0.00089935126,0.00082687516,0.0018315389,0.0014884965,0.0011668258,0.0029173254],"category_scores_gemma":[0.014107756,0.00076447777,0.0006818167,0.0010049308,0.0016572878,0.0028435965,0.002870813,0.0020807458,0.0005271942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024907576,0.0001296344,0.0018955128,0.0001125554,0.00010021372,0.000120755816,0.00019234458,0.85484946,0.0034335614,0.062053822,0.0020058313,0.0748572],"study_design_scores_gemma":[0.000040133164,0.00008511599,0.0001489654,0.000019107798,0.000019923766,0.000042933752,0.000039445786,0.9553045,0.0011655067,0.041564047,0.0015553781,0.000014926964],"about_ca_topic_score_codex":0.0025761214,"about_ca_topic_score_gemma":0.0028295857,"teacher_disagreement_score":0.0029173254,"about_ca_system_score_codex":0.001232108,"about_ca_system_score_gemma":0.002360771,"threshold_uncertainty_score":0.014113665},"labels":[],"label_agreement":null},{"id":"W4409393577","doi":"10.1007/s10115-025-02389-3","title":"Atom search optimization: a systematic review of current variants and applications","year":2025,"lang":"en","type":"review","venue":"Knowledge and Information Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Current (fluid); Computer science; Atom (system on chip); Algorithm; Theoretical computer science; Mathematics; Engineering; Parallel computing; Electrical engineering","score_opus":0.04351094629363648,"score_gpt":0.3644960439534498,"score_spread":0.3209850976598133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409393577","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019871643,0.9983719,0.0008279579,0.00013498231,0.0000522063,0.000023314436,0.00007751989,0.000010621962,0.0003029041],"genre_scores_gemma":[0.0026039367,0.9933791,0.0033526574,0.00023489151,0.000087466295,0.000049973478,0.00011929906,0.0000133307285,0.00015929838],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.9987863,0.00031508642,0.0003061752,0.00020863672,0.00033482097,0.000049027007],"domain_scores_gemma":[0.99533147,0.003713437,0.00040749658,0.00011090937,0.00036905296,0.00006767635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029622642,0.0015415282,0.0036800103,0.003953484,0.00032402814,0.0020285018,0.0017587083,0.0013636728,0.005474031],"category_scores_gemma":[0.009594556,0.00059354777,0.003168311,0.0064108544,0.00058663,0.0015601707,0.001032442,0.0012971164,0.0009005861],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031565718,0.000116859344,0.00061631453,0.17834122,0.0021935622,0.00009278375,0.000072622744,0.0028302318,0.0006320779,0.004098843,0.012166999,0.79852295],"study_design_scores_gemma":[0.00074597134,0.0012374355,0.0052270973,0.1631771,0.02162509,0.0017707638,0.00033898314,0.0061837067,0.0022303981,0.016161978,0.78100497,0.00029651218],"about_ca_topic_score_codex":0.0031749667,"about_ca_topic_score_gemma":0.0064829076,"teacher_disagreement_score":0.005474031,"about_ca_system_score_codex":0.00079744734,"about_ca_system_score_gemma":0.0037699367,"threshold_uncertainty_score":0.018312454},"labels":[],"label_agreement":null},{"id":"W4409648117","doi":"10.23977/jnca.2025.100107","title":"A Nature-inspired Fully Enhanced Hybrid Algorithm Based on Intra-group Competition Mechanism","year":2025,"lang":"en","type":"article","venue":"Journal of Network Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mechanism (biology); Group (periodic table); Competition (biology); Computer science; Algorithm; Artificial intelligence; Chemistry; Biology; Ecology; Physics","score_opus":0.006311926803255178,"score_gpt":0.2730461447773535,"score_spread":0.26673421797409835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409648117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056292582,0.0006412583,0.9298273,0.00019444499,0.00015195602,0.00009592661,0.000047266403,0.00082668563,0.011922616],"genre_scores_gemma":[0.7025877,0.00030807639,0.28528178,0.00023242255,0.000051343854,0.00031277377,0.00016136606,0.00011725846,0.010947232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979895,0.00003467726,0.000008993427,0.000045160185,0.00008064828,0.000031572352],"domain_scores_gemma":[0.99986684,0.00003622769,0.000020697249,0.000016182506,0.000042407573,0.000017573486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028483765,0.0005223199,0.00076136214,0.0004464973,0.00044229225,0.0007073268,0.0014451529,0.0007440222,0.001782405],"category_scores_gemma":[0.00043220792,0.0002194979,0.0006011394,0.00044636513,0.00037299434,0.00050829723,0.0006615039,0.00041220593,0.00032566086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000229708,0.00012591366,0.0019458418,0.00013372197,0.00018422824,0.0002527552,0.00017765244,0.69198495,0.03644442,0.022266885,0.0047852756,0.24146864],"study_design_scores_gemma":[0.000026524318,0.000053095173,0.00021178929,0.000003707936,0.000015421117,0.00008165088,0.000006598201,0.9953857,0.0012622899,0.0010742334,0.0018672461,0.000011749941],"about_ca_topic_score_codex":0.0030108371,"about_ca_topic_score_gemma":0.0024139301,"teacher_disagreement_score":0.0030108371,"about_ca_system_score_codex":0.0004735933,"about_ca_system_score_gemma":0.0006885382,"threshold_uncertainty_score":0.005986631},"labels":[],"label_agreement":null},{"id":"W4410790146","doi":"10.1002/wics.70028","title":"A Review of Benchmark and Test Functions for Global Optimization Algorithms and Metaheuristics","year":2025,"lang":"en","type":"review","venue":"Wiley Interdisciplinary Reviews Computational Statistics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Metaheuristic; Benchmark (surveying); Computer science; Algorithm; Global optimization; Test functions for optimization; Mathematical optimization; Mathematics; Optimization problem; Multi-swarm optimization","score_opus":0.04656249920066885,"score_gpt":0.3987294413001376,"score_spread":0.35216694209946875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410790146","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062357215,0.9855635,0.009275143,0.00070453744,0.00040670214,0.00007253455,0.00024884925,0.00009891008,0.0030062902],"genre_scores_gemma":[0.0070666512,0.9735421,0.016357334,0.00059738394,0.00038222378,0.00023729657,0.0007186575,0.00010361579,0.0009948094],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99510205,0.0015391384,0.0008251648,0.0004744618,0.0019138836,0.00014529494],"domain_scores_gemma":[0.98238593,0.012376229,0.0012866443,0.0005043256,0.0032528702,0.00019402087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008250955,0.002015606,0.002962343,0.009554114,0.00054914464,0.0024250583,0.0027401298,0.0017559471,0.0038008343],"category_scores_gemma":[0.02498116,0.00083968195,0.0019152618,0.013663099,0.0010661884,0.0027472824,0.0011425948,0.0019958445,0.0020572855],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090515525,0.00011800814,0.00057403656,0.03528548,0.00022894607,0.00006707901,0.00009263465,0.0060677812,0.0008504514,0.025059158,0.028734768,0.9028312],"study_design_scores_gemma":[0.000052595587,0.00060096564,0.0026514442,0.039757237,0.00067014684,0.00074833405,0.00020226196,0.0064500063,0.0029223952,0.019730944,0.92602646,0.00018717791],"about_ca_topic_score_codex":0.0038000115,"about_ca_topic_score_gemma":0.0034015356,"teacher_disagreement_score":0.009554114,"about_ca_system_score_codex":0.0018162489,"about_ca_system_score_gemma":0.004087522,"threshold_uncertainty_score":0.043635726},"labels":[],"label_agreement":null},{"id":"W4410898856","doi":"10.5267/j.dsl.2025.4.004","title":"An improved pelican optimization algorithm for function optimization and constrained engineering design problems","year":2025,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pelican; Mathematical optimization; Multi-objective optimization; Function (biology); Optimization algorithm; Engineering optimization; Computer science; Function optimization; Algorithm; Optimization problem; Engineering; Mathematics; Genetic algorithm","score_opus":0.018706768795716353,"score_gpt":0.2875331395107159,"score_spread":0.26882637071499954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410898856","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005997667,0.00046220975,0.9850011,0.00016040084,0.00006001125,0.00007908532,0.000071945266,0.0005608907,0.0076065953],"genre_scores_gemma":[0.18474221,0.00087508804,0.80297434,0.00032106717,0.000117484895,0.0005385924,0.0005421534,0.00025764835,0.009631409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995622,0.00010324331,0.000024731622,0.00007400891,0.00019506468,0.00004065879],"domain_scores_gemma":[0.9996742,0.0001349733,0.000029434203,0.000032245367,0.000110837595,0.000018271161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007886431,0.0013319757,0.0010117051,0.0011971821,0.0005124498,0.0012511184,0.0013847003,0.0013425249,0.0058749137],"category_scores_gemma":[0.0018319451,0.00040253202,0.0007895556,0.0013597006,0.00062364206,0.001059205,0.0012161337,0.0014232817,0.0013602297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010459508,0.000060878647,0.0006824574,0.00014012247,0.000046403427,0.0001379756,0.00007001238,0.7802883,0.0037851671,0.019522754,0.0043506017,0.19081067],"study_design_scores_gemma":[0.000021726095,0.00003295069,0.00006962967,0.000009281061,0.000007153234,0.000038780516,0.000006310131,0.9922835,0.0006989259,0.0019935535,0.004832361,0.000005703447],"about_ca_topic_score_codex":0.0029821596,"about_ca_topic_score_gemma":0.003168136,"teacher_disagreement_score":0.0058749137,"about_ca_system_score_codex":0.0006513517,"about_ca_system_score_gemma":0.0014211622,"threshold_uncertainty_score":0.0196535},"labels":[],"label_agreement":null},{"id":"W4411026218","doi":"10.3390/a18060341","title":"S-EPSO: A Socio-Emotional Particle Swarm Optimization Algorithm for Multimodal Search in Low-Dimensional Engineering Applications","year":2025,"lang":"en","type":"article","venue":"Algorithms","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Mathematical optimization; Algorithm; Computer science; Multi-swarm optimization; Mathematics","score_opus":0.015046567215443863,"score_gpt":0.29457266506491114,"score_spread":0.2795260978494673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411026218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01871823,0.0003078985,0.9753194,0.00019105914,0.00007609845,0.00010723356,0.000038885155,0.0003543765,0.004886894],"genre_scores_gemma":[0.37292126,0.0003769188,0.6209981,0.0003576774,0.00009390436,0.00052476214,0.00020981561,0.0001459037,0.0043716216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997305,0.000102606224,0.000017691093,0.000031374977,0.00009409222,0.000023728608],"domain_scores_gemma":[0.9994802,0.0002978415,0.00005657676,0.000039124152,0.00009656963,0.0000297055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290145,0.000973107,0.0007282721,0.00086150627,0.00035703942,0.0006403887,0.0010389878,0.0011352196,0.0021150894],"category_scores_gemma":[0.0024385334,0.0002984102,0.0006708276,0.0005023657,0.0005300481,0.00069506816,0.0010811223,0.00069590664,0.0003929096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090151436,0.00010599819,0.001597663,0.00015669967,0.00008694991,0.00011619416,0.000114256894,0.8342697,0.0030022578,0.013499703,0.0024416319,0.14451869],"study_design_scores_gemma":[0.000016072278,0.00005117628,0.0001272189,0.000011417077,0.000008083298,0.000022885048,0.000015174148,0.9956867,0.00047435996,0.0023298012,0.0012525271,0.0000046579717],"about_ca_topic_score_codex":0.0012511803,"about_ca_topic_score_gemma":0.0016617167,"teacher_disagreement_score":0.0021150894,"about_ca_system_score_codex":0.00032256226,"about_ca_system_score_gemma":0.0006966103,"threshold_uncertainty_score":0.007075727},"labels":[],"label_agreement":null},{"id":"W4411167332","doi":"10.1139/dsa-2024-0066","title":"Enhancing drone swarm efficiency through a high-flexibility biomimetic formation algorithm","year":2025,"lang":"en","type":"article","venue":"Drone Systems and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Drone; Swarm behaviour; Flexibility (engineering); Computer science; Algorithm; Artificial intelligence; Mathematics; Biology","score_opus":0.016924964557906215,"score_gpt":0.2974704846835042,"score_spread":0.28054552012559797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411167332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0823712,0.00032723224,0.9099904,0.000243506,0.000057658868,0.00006323572,0.00002802249,0.00026613282,0.00665274],"genre_scores_gemma":[0.85922134,0.00016922707,0.13778152,0.000090719215,0.00002018011,0.00014184263,0.000057554433,0.000032475302,0.0024851367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999064,0.000024613084,0.0000041370126,0.000021487473,0.000029263761,0.000014006843],"domain_scores_gemma":[0.9998286,0.00006472305,0.0000329489,0.00002393947,0.000030441497,0.000019499917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003194508,0.00043975847,0.00044151844,0.00035202174,0.00041599196,0.00049949123,0.0007417183,0.00063693227,0.0008176982],"category_scores_gemma":[0.0007342415,0.00022600061,0.0003385423,0.0002324573,0.00043402793,0.00047492151,0.000946612,0.00046007868,0.00019062204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037324495,0.000038379625,0.0004677986,0.00002075514,0.000020595528,0.000040913266,0.00006247405,0.9640425,0.0041886815,0.0054479116,0.00047396874,0.025158772],"study_design_scores_gemma":[0.000009754291,0.00002231881,0.000044798933,0.0000022249708,0.0000029576854,0.000009084432,0.0000058211103,0.9987348,0.00032220397,0.000536563,0.00030752778,0.0000020883397],"about_ca_topic_score_codex":0.0022545292,"about_ca_topic_score_gemma":0.00210352,"teacher_disagreement_score":0.0022545292,"about_ca_system_score_codex":0.00030754364,"about_ca_system_score_gemma":0.00047459317,"threshold_uncertainty_score":0.0044828653},"labels":[],"label_agreement":null},{"id":"W4411232503","doi":"10.1109/alife-ciscompanion65078.2025.11031002","title":"Comparative Study of Decomposition and Merging Evolutionary Algorithms for Large-Scale Optimization Problems","year":2025,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Decomposition; Scale (ratio); Evolutionary algorithm; Evolutionary computation; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.03223074014930341,"score_gpt":0.35265965600355254,"score_spread":0.32042891585424915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411232503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25061616,0.008473581,0.72664356,0.00067963323,0.00021188163,0.0002140342,0.00009460384,0.0008968969,0.012169642],"genre_scores_gemma":[0.62497616,0.0024897698,0.37012923,0.00018493728,0.000079537116,0.0001651422,0.0003570204,0.00014380283,0.0014744337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870193,0.00047984108,0.000099841694,0.00017306779,0.00043478087,0.0001105013],"domain_scores_gemma":[0.99550253,0.0032299988,0.00025733822,0.0002760318,0.00057617045,0.0001579829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036293177,0.0013595005,0.0014716225,0.0017690033,0.00047217478,0.0012216216,0.0011691594,0.0012199065,0.0009911441],"category_scores_gemma":[0.008723437,0.00037912873,0.0013078924,0.001749373,0.00055133505,0.0012465584,0.0011685437,0.001117576,0.0001574214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016707643,0.0001371636,0.0024419464,0.00020335594,0.00014744779,0.00005941725,0.00010619528,0.84630513,0.0015893155,0.008597638,0.000982572,0.13926274],"study_design_scores_gemma":[0.000016961081,0.00007904424,0.00052017724,0.000015354466,0.000027997718,0.00002844727,0.000027164775,0.9967784,0.00054082164,0.0012068973,0.000752693,0.0000060808325],"about_ca_topic_score_codex":0.003168439,"about_ca_topic_score_gemma":0.002311023,"teacher_disagreement_score":0.0036293177,"about_ca_system_score_codex":0.0007570913,"about_ca_system_score_gemma":0.0012631887,"threshold_uncertainty_score":0.019193888},"labels":[],"label_agreement":null},{"id":"W4411673831","doi":"10.2139/ssrn.5324689","title":"The Effect of Elitist Fitness-Based Selection on the Escape from Local Optima","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Selection (genetic algorithm); Local optimum; Mathematical optimization; Computer science; Artificial intelligence; Mathematics","score_opus":0.008578061897256059,"score_gpt":0.2791942430786236,"score_spread":0.27061618118136754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411673831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9676743,0.0008654579,0.020205371,0.0003543394,0.00009296655,0.000027503092,0.000044884277,0.00017330366,0.010561832],"genre_scores_gemma":[0.99604106,0.00015048592,0.0028609235,0.000043562755,0.0000145210915,0.000010627961,0.000023692024,0.000039120965,0.00081608497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939203,0.00021690456,0.000034403536,0.00008095051,0.00016984508,0.00010579466],"domain_scores_gemma":[0.99107635,0.0072242636,0.00042319053,0.00043141277,0.0006132851,0.00023142336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001915694,0.00040174692,0.0005157499,0.000573656,0.00053274346,0.00104615,0.0006824001,0.00089226867,0.0028253898],"category_scores_gemma":[0.01339239,0.0001630203,0.00030406113,0.00039946,0.0008264777,0.0009203693,0.00072627154,0.0006536922,0.00024418414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030668739,0.0008890485,0.0124441795,0.00039648198,0.00029515263,0.0005905531,0.00043940198,0.7777224,0.05744891,0.016663702,0.0020472324,0.12799603],"study_design_scores_gemma":[0.0003202237,0.002243624,0.011030011,0.000057135796,0.0002329366,0.00033000013,0.0002199019,0.9496811,0.027311642,0.0074908207,0.0010292671,0.00005332305],"about_ca_topic_score_codex":0.0005812132,"about_ca_topic_score_gemma":0.0005732725,"teacher_disagreement_score":0.0028253898,"about_ca_system_score_codex":0.00047047558,"about_ca_system_score_gemma":0.00043701645,"threshold_uncertainty_score":0.0101312995},"labels":[],"label_agreement":null},{"id":"W4411959463","doi":"10.31449/inf.v49i23.8270","title":"Adaptive Strategy-Enhanced NSGA-II for Multi-Objective Optimization with Improved Convergence and Diversity Control","year":2025,"lang":"en","type":"article","venue":"Informatica","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Convergence (economics); Diversity (politics); Mathematical optimization; Control (management); Computer science; Mathematics; Artificial intelligence; Economics; Political science; Economic growth","score_opus":0.02154016471860877,"score_gpt":0.2727647767679153,"score_spread":0.2512246120493065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411959463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055820454,0.00087383104,0.9340104,0.00023684616,0.00011233098,0.00015669572,0.00004914327,0.00052431686,0.008215999],"genre_scores_gemma":[0.81537944,0.0005546991,0.17779002,0.00018949532,0.000040022285,0.00064528943,0.00020418987,0.000074088915,0.0051228087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929965,0.00024527442,0.000039601742,0.00007283903,0.00026267444,0.00007999299],"domain_scores_gemma":[0.99960643,0.00015242028,0.000050286755,0.000025242833,0.00013952647,0.000026060774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011845705,0.0011742752,0.0009043416,0.000806578,0.0005108789,0.00070835045,0.0011883548,0.0007679957,0.0013189071],"category_scores_gemma":[0.001490874,0.00043165416,0.0008861784,0.00075299107,0.0006258705,0.00046994202,0.00083020166,0.0011001508,0.00023614684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003074194,0.000027893857,0.00038468878,0.000049787817,0.000038863604,0.00004621276,0.000048936945,0.9759006,0.0015853214,0.0027341759,0.00052055396,0.018632386],"study_design_scores_gemma":[0.0000142191475,0.000032976623,0.0001231131,0.000005589708,0.000007087785,0.000009662377,0.000005382901,0.99833065,0.00030162354,0.0006222461,0.00054227194,0.0000051806996],"about_ca_topic_score_codex":0.013194674,"about_ca_topic_score_gemma":0.010571781,"teacher_disagreement_score":0.013194674,"about_ca_system_score_codex":0.0009161164,"about_ca_system_score_gemma":0.0016632378,"threshold_uncertainty_score":0.02623576},"labels":[],"label_agreement":null},{"id":"W4412083216","doi":"10.1007/s00521-025-11423-y","title":"Training neural networks with a self-adaptive ant colony algorithm","year":2025,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computational Science and Engineering; Computer science; Artificial neural network; Ant colony optimization algorithms; Artificial intelligence; Training (meteorology); ANT; Ant colony; Algorithm; Machine learning; Computer network","score_opus":0.022858832679765236,"score_gpt":0.2948385559920372,"score_spread":0.27197972331227194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412083216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045118712,0.00032373203,0.94803745,0.00018894364,0.000171455,0.00013714006,0.000024052984,0.00065354456,0.0053449012],"genre_scores_gemma":[0.5457465,0.00019512067,0.4493107,0.00016398949,0.00007958971,0.00027366207,0.000075349926,0.00013823109,0.004016818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964,0.00012668715,0.000025361582,0.00006370091,0.00011240206,0.000031899348],"domain_scores_gemma":[0.9989328,0.0006151425,0.00006976786,0.000076374556,0.00027822243,0.000027759601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009484609,0.0006342754,0.0007746307,0.00059096835,0.0004170199,0.0007063989,0.0012120393,0.0014004488,0.0017444587],"category_scores_gemma":[0.0033902489,0.0005081429,0.00056549476,0.0006835867,0.00046264922,0.00084613834,0.00076225755,0.0010703289,0.00038941432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010715181,0.000103339175,0.0006265982,0.00006765938,0.00008727804,0.000056422883,0.00006111705,0.8610072,0.004021793,0.0032433774,0.0010545662,0.12956351],"study_design_scores_gemma":[0.00000593146,0.000012269483,0.000030134765,0.0000018864554,0.0000044268904,0.0000053799595,0.0000018194502,0.99922407,0.00035495698,0.0002588798,0.00009884136,0.0000014313233],"about_ca_topic_score_codex":0.0035704293,"about_ca_topic_score_gemma":0.003914701,"teacher_disagreement_score":0.0035704293,"about_ca_system_score_codex":0.0003660734,"about_ca_system_score_gemma":0.00058911106,"threshold_uncertainty_score":0.0070993304},"labels":[],"label_agreement":null},{"id":"W4412405415","doi":"10.1109/otcon65728.2025.11071003","title":"A Fuzzy-Based Harmony Search Method for Optimizing the Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Harmony search; Travelling salesman problem; Harmony (color); Computer science; Mathematical optimization; Fuzzy logic; 2-opt; Artificial intelligence; Mathematics","score_opus":0.04410457393262727,"score_gpt":0.3626913088847308,"score_spread":0.3185867349521035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412405415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012742683,0.0008295551,0.977407,0.00016061167,0.00012502904,0.00011555017,0.000033858778,0.00019815822,0.008387515],"genre_scores_gemma":[0.37084004,0.0011919067,0.61623126,0.00027659445,0.00014060516,0.0004768061,0.00012676927,0.00010419335,0.010611826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997187,0.00007076664,0.000011841144,0.000038331294,0.0001394554,0.000020900512],"domain_scores_gemma":[0.99990046,0.00003442465,0.000010741731,0.0000073238975,0.000040894516,0.0000061459446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006293041,0.0006353977,0.00091411493,0.0006936272,0.0005715412,0.0006563165,0.0011551204,0.0009372811,0.002202129],"category_scores_gemma":[0.0008350008,0.00024291188,0.00061947695,0.00084117707,0.000416106,0.0006312801,0.00061241305,0.00068131945,0.00038008322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084575484,0.00011930969,0.00039618099,0.00019938222,0.00010736648,0.00014888318,0.00016881071,0.7012599,0.00819918,0.026532274,0.0045870617,0.2581971],"study_design_scores_gemma":[0.000028533304,0.00011021829,0.00015206976,0.000014748661,0.00001957405,0.00007828485,0.000022653088,0.9914527,0.0009644743,0.0032040116,0.0039360197,0.000016737049],"about_ca_topic_score_codex":0.0024096395,"about_ca_topic_score_gemma":0.0021151116,"teacher_disagreement_score":0.0024096395,"about_ca_system_score_codex":0.00036429614,"about_ca_system_score_gemma":0.0008277304,"threshold_uncertainty_score":0.007366836},"labels":[],"label_agreement":null},{"id":"W4412508466","doi":"10.1609/socs.v18i1.36008","title":"Suboptimal Search with Dynamic Distribution of Suboptimality (Extended Abstract)","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alliance de recherche numérique du Canada; Canadian Institute for Advanced Research","keywords":"Distribution (mathematics); Computer science; Environmental science; Mathematics; Mathematical analysis","score_opus":0.010847928656989114,"score_gpt":0.2811817900214269,"score_spread":0.27033386136443777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412508466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01608992,0.0003055318,0.9728325,0.00024790736,0.0000895904,0.000068232155,0.00014172618,0.00055456726,0.009669989],"genre_scores_gemma":[0.4058335,0.00048802354,0.5812702,0.0002938136,0.00007985249,0.00033564022,0.00044743728,0.00035765654,0.010893858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992625,0.00023264541,0.000055298195,0.00017814763,0.00018825346,0.00008319351],"domain_scores_gemma":[0.9984946,0.00072308624,0.000121955076,0.00033318525,0.0002476894,0.000079373574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094216876,0.0006752065,0.0006038256,0.0005461039,0.000534528,0.0012984371,0.000832091,0.0006907063,0.007596064],"category_scores_gemma":[0.0044379393,0.00034957568,0.00067247136,0.0009763225,0.0010351415,0.0013355407,0.002130919,0.0012148897,0.0012539655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002744396,0.000097182994,0.0011607042,0.0001786373,0.00008337384,0.00024798495,0.00018353942,0.5864987,0.007707842,0.20225154,0.009692476,0.19162355],"study_design_scores_gemma":[0.000037282553,0.00006321156,0.00016066368,0.000025593274,0.000018049619,0.00009633723,0.00002411623,0.89580303,0.003297644,0.09337539,0.007082662,0.000016039217],"about_ca_topic_score_codex":0.0030932245,"about_ca_topic_score_gemma":0.003459905,"teacher_disagreement_score":0.007596064,"about_ca_system_score_codex":0.0007390639,"about_ca_system_score_gemma":0.0016549976,"threshold_uncertainty_score":0.025411427},"labels":[],"label_agreement":null},{"id":"W4412732533","doi":"10.1007/s10462-025-11291-x","title":"Cuckoo catfish optimizer: a new meta-heuristic optimization algorithm","year":2025,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"","keywords":"Meta heuristic; Computer science; Cuckoo; Cuckoo search; Catfish; Heuristic; Optimization algorithm; Mathematical optimization; Algorithm; Metaheuristic; Artificial intelligence; Fish <Actinopterygii>; Mathematics; Fishery; Biology; Zoology; Particle swarm optimization","score_opus":0.10654809245438929,"score_gpt":0.3755850223123636,"score_spread":0.26903692985797434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412732533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07281812,0.0029679034,0.90675235,0.00057514914,0.00027179837,0.00037557067,0.00020473397,0.0012452876,0.014789023],"genre_scores_gemma":[0.64683574,0.0009985259,0.34409565,0.00032924768,0.00010035225,0.0008915182,0.0004788408,0.00018795727,0.0060821404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995321,0.000155297,0.000029421712,0.00007649642,0.00016445364,0.000042204825],"domain_scores_gemma":[0.9996331,0.00013854407,0.0000481029,0.000032542586,0.000123728,0.000023983912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089022715,0.0013091635,0.0010209647,0.0011411477,0.0004647822,0.0009687541,0.0016233673,0.0014127224,0.0017432276],"category_scores_gemma":[0.0014320469,0.00045717644,0.0008063245,0.0010322315,0.0005799908,0.0005326259,0.00071975996,0.00072527496,0.00029369132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049381666,0.000027279548,0.0007252293,0.00011696864,0.00007699024,0.000058921123,0.000032109918,0.96070653,0.001500821,0.004120409,0.0013077492,0.031277545],"study_design_scores_gemma":[0.0000191512,0.000021920805,0.00007480828,0.000009060478,0.0000100681045,0.00001341121,0.000004068363,0.9984085,0.00023781914,0.000370286,0.0008262745,0.000004617275],"about_ca_topic_score_codex":0.013942173,"about_ca_topic_score_gemma":0.007880677,"teacher_disagreement_score":0.013942173,"about_ca_system_score_codex":0.0010044785,"about_ca_system_score_gemma":0.002049255,"threshold_uncertainty_score":0.02772206},"labels":[],"label_agreement":null},{"id":"W4412742817","doi":"10.1109/rait65068.2025.11088949","title":"Optimized Travelling Salesman Problem Solution Using 1-Tree Approach","year":2025,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Travelling salesman problem; Computer science; Mathematical optimization; Tree (set theory); Algorithm; Mathematics; Combinatorics","score_opus":0.043600074494963136,"score_gpt":0.3047839233212758,"score_spread":0.2611838488263127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412742817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038173735,0.0014621316,0.9299652,0.0006452824,0.00017739074,0.0001688331,0.00025054134,0.00037227524,0.028784575],"genre_scores_gemma":[0.39389202,0.0019290987,0.58966005,0.00030716948,0.000107220665,0.00028953442,0.0006953443,0.00019700483,0.012922601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997731,0.000079524485,0.000010062232,0.000039165563,0.000045022396,0.000053130665],"domain_scores_gemma":[0.99979943,0.00011384554,0.000022488051,0.000009108447,0.000040320872,0.000014782663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043048873,0.0006763848,0.00087841565,0.0009423425,0.000559605,0.0010674293,0.00088450103,0.001326501,0.0066331713],"category_scores_gemma":[0.0010334098,0.00033256877,0.0009196737,0.0011182697,0.00025809696,0.0009688155,0.0005843148,0.0007866919,0.0007693417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006209092,0.000087096174,0.00043468238,0.00020619843,0.000047966554,0.00013258852,0.00008285593,0.8932256,0.0013884554,0.03579795,0.005605297,0.0629291],"study_design_scores_gemma":[0.000009617956,0.000035792447,0.000082129125,0.000011805224,0.000009054737,0.000028113725,0.000030431313,0.99103326,0.00019496935,0.0070057227,0.0015542273,0.0000048665074],"about_ca_topic_score_codex":0.0055142925,"about_ca_topic_score_gemma":0.0051226015,"teacher_disagreement_score":0.0066331713,"about_ca_system_score_codex":0.0006843161,"about_ca_system_score_gemma":0.001481455,"threshold_uncertainty_score":0.022190154},"labels":[],"label_agreement":null},{"id":"W4412799004","doi":"10.1016/j.cma.2025.118208","title":"Holistic swarm optimization: A novel metaphor-less algorithm guided by whole population information for addressing exploration-exploitation dilemma","year":2025,"lang":"en","type":"article","venue":"Computer Methods in Applied Mechanics and Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Dilemma; Metaphor; Population; Swarm behaviour; Mathematical optimization; Computer science; Optimization algorithm; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Sociology","score_opus":0.07542285910518817,"score_gpt":0.3552998725752396,"score_spread":0.27987701347005145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412799004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015577258,0.00041259365,0.9784515,0.0001891335,0.00008845743,0.000052502895,0.00003425763,0.00034188587,0.0048524146],"genre_scores_gemma":[0.36421177,0.00050041126,0.62947124,0.00036630913,0.00008343536,0.0003342323,0.00016557742,0.00017315088,0.0046939002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997596,0.00006447254,0.000011108893,0.000047612935,0.00009356477,0.000023697457],"domain_scores_gemma":[0.9997805,0.000085668544,0.000037118527,0.000029913424,0.000042165182,0.000024655863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050655747,0.0009522408,0.000916133,0.0006177124,0.00041037018,0.00065797655,0.0010918379,0.0009861576,0.0019767222],"category_scores_gemma":[0.0011818773,0.000329774,0.0006940438,0.0005037227,0.00067065755,0.00092656445,0.0014877263,0.000668847,0.00038541105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000859935,0.00008699878,0.001503813,0.00024687118,0.00016294267,0.0002190276,0.00028674767,0.717096,0.023605661,0.040661268,0.005341192,0.21070361],"study_design_scores_gemma":[0.000023193177,0.00009073778,0.00018117699,0.000013365928,0.0000209995,0.00010563396,0.00003149405,0.98560065,0.001214885,0.008390272,0.0043122354,0.000015467174],"about_ca_topic_score_codex":0.000945383,"about_ca_topic_score_gemma":0.001068916,"teacher_disagreement_score":0.0019767222,"about_ca_system_score_codex":0.0003308844,"about_ca_system_score_gemma":0.00081826217,"threshold_uncertainty_score":0.0066128373},"labels":[],"label_agreement":null},{"id":"W4413235444","doi":"10.23952/jnva.9.2025.6.05","title":"An embedding result for a class of epigraphical sets and applications to set optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Embedding; Class (philosophy); Set (abstract data type); Mathematics; Computer science; Artificial intelligence; Programming language","score_opus":0.022637645492269143,"score_gpt":0.37031479268057205,"score_spread":0.3476771471883029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413235444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01593928,0.0008901703,0.9638692,0.00070472714,0.0001437786,0.000040669216,0.00012494298,0.00007007256,0.018217226],"genre_scores_gemma":[0.536648,0.0036674852,0.4315401,0.0006977704,0.00064391637,0.000272858,0.00051566836,0.00033598824,0.025678286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933964,0.00023824806,0.000038998405,0.00014217992,0.0001839164,0.000057010628],"domain_scores_gemma":[0.9980007,0.0011197319,0.00019281263,0.00019754324,0.0003400411,0.00014920448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015172621,0.0010204483,0.00065717497,0.0012575616,0.0005178741,0.0014927981,0.0008458916,0.0009225031,0.0067517143],"category_scores_gemma":[0.0057669384,0.0003325976,0.0011617452,0.0011977119,0.0014439697,0.0042446414,0.002289859,0.0025847552,0.0006469764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026242602,0.000044823177,0.0003172472,0.00013434872,0.000025515816,0.00007703544,0.00013986893,0.035117425,0.0020827595,0.9265119,0.0015965243,0.033926394],"study_design_scores_gemma":[0.000011450305,0.00013135711,0.00034566937,0.000060081427,0.00001899278,0.00019141953,0.00008022282,0.26514176,0.0018041626,0.72064316,0.011545973,0.00002572187],"about_ca_topic_score_codex":0.00072487135,"about_ca_topic_score_gemma":0.00052302587,"teacher_disagreement_score":0.0067517143,"about_ca_system_score_codex":0.00083850336,"about_ca_system_score_gemma":0.000618599,"threshold_uncertainty_score":0.022586763},"labels":[],"label_agreement":null},{"id":"W4413553287","doi":"10.1109/ojies.2025.3602363","title":"GMPP Estimator as a Global Solution for MPPT Algorithms Under Partial Shading Conditions","year":2025,"lang":"en","type":"article","venue":"IEEE Open Journal of the Industrial Electronics Society","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Shading; Estimator; Mathematics; Computer science; Algorithm; Mathematical optimization; Applied mathematics; Statistics","score_opus":0.07208998828905328,"score_gpt":0.3880696760607032,"score_spread":0.3159796877716499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413553287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060853697,0.00014126398,0.9923509,0.000067424546,0.000016813978,0.000023254017,0.000015767231,0.00013564731,0.0011636681],"genre_scores_gemma":[0.43565756,0.00031464844,0.560151,0.00016250479,0.00007839385,0.00030638065,0.00016139107,0.00013948623,0.0030286307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999752,0.00009491167,0.0000107832,0.00005225215,0.000064971384,0.000025224897],"domain_scores_gemma":[0.99953043,0.00027924986,0.000060789687,0.00003241535,0.00008093184,0.000016245443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076648296,0.000772423,0.0007684994,0.00053861516,0.00024347159,0.00064026454,0.000722822,0.0012104593,0.00124723],"category_scores_gemma":[0.0020534163,0.00030843154,0.00048775735,0.00042831645,0.0004164625,0.0005907656,0.0006670541,0.0009202185,0.00030658575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033061795,0.0000238659,0.00036007355,0.000073056464,0.000033949313,0.000034422686,0.00004154141,0.9393467,0.0029961593,0.007993355,0.0007329371,0.04833095],"study_design_scores_gemma":[0.0000062260688,0.000021456462,0.00006488876,0.000007149737,0.0000047666595,0.000014256982,0.0000055865125,0.9968802,0.00045631375,0.002059693,0.00047699906,0.0000024461262],"about_ca_topic_score_codex":0.0009336967,"about_ca_topic_score_gemma":0.00093159114,"teacher_disagreement_score":0.00124723,"about_ca_system_score_codex":0.000340794,"about_ca_system_score_gemma":0.00061362394,"threshold_uncertainty_score":0.0041723847},"labels":[],"label_agreement":null},{"id":"W4413629940","doi":"10.21203/rs.3.rs-7292808/v1","title":"A distributed multi-objective optimization algorithm with time-varying priorities for multi-agent systems","year":2025,"lang":"en","type":"preprint","venue":"Research Square","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Optimization algorithm; Multi-agent system; Distributed computing; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics","score_opus":0.0863825949788198,"score_gpt":0.39041298362542387,"score_spread":0.3040303886466041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413629940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01377097,0.0001870335,0.98390794,0.00014993476,0.000085682695,0.00006226888,0.000016641188,0.00021397471,0.0016055651],"genre_scores_gemma":[0.44940445,0.0001957357,0.54718333,0.00011624527,0.00007992415,0.0003046964,0.00006610652,0.00008341217,0.0025660433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994923,0.00019792927,0.000027755872,0.000088228924,0.00013131273,0.000062450534],"domain_scores_gemma":[0.99908686,0.0004972903,0.0000774109,0.000058079244,0.00020711726,0.00007322577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017433745,0.0008314303,0.0011812528,0.00052151945,0.00075588626,0.0010980059,0.0019099223,0.0013668082,0.0023088218],"category_scores_gemma":[0.003000101,0.0005539223,0.0005273766,0.0006436586,0.0005246911,0.0010801753,0.0012761354,0.0012581006,0.00032807468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020673827,0.00010543651,0.00021348096,0.00006045674,0.000046064655,0.000041779866,0.000053789598,0.93146855,0.0018445844,0.0071480502,0.00085658935,0.057954457],"study_design_scores_gemma":[0.000036187263,0.000032736025,0.000019625073,0.0000022225177,0.000005347404,0.0000051905936,0.000004379609,0.99838066,0.00018557509,0.0011032799,0.00022250095,0.0000023477462],"about_ca_topic_score_codex":0.0035863842,"about_ca_topic_score_gemma":0.003596643,"teacher_disagreement_score":0.0035863842,"about_ca_system_score_codex":0.00083848106,"about_ca_system_score_gemma":0.0014988533,"threshold_uncertainty_score":0.0092199445},"labels":[],"label_agreement":null},{"id":"W4413776701","doi":"10.2139/ssrn.5407188","title":"An Adaptive Balance Search  Based Complementary Heterogeneous Particle Swarm Optimization Architecture","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Architecture; Balance (ability); Computer science; Mathematical optimization; Multi-swarm optimization; Swarm behaviour; Particle (ecology); Artificial intelligence; Mathematics; Geography; Biology; Ecology","score_opus":0.022248709559298564,"score_gpt":0.3040933373732065,"score_spread":0.2818446278139079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413776701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037445456,0.00035939735,0.9449226,0.00018751496,0.00020729011,0.0000797702,0.00003365538,0.0005202715,0.016243985],"genre_scores_gemma":[0.7233687,0.00025489685,0.26557505,0.000198683,0.00014094554,0.00028452766,0.000120503435,0.00008657984,0.009970218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998354,0.000036460227,0.000007993057,0.00003286496,0.00006717276,0.000020071293],"domain_scores_gemma":[0.99984765,0.000034340075,0.00001337772,0.000023759107,0.00006223993,0.000018603972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003907275,0.0004716572,0.0006623341,0.0005843385,0.0005429185,0.0008521431,0.001426592,0.00094177393,0.003991057],"category_scores_gemma":[0.00067354314,0.00029777328,0.00041478066,0.0006715341,0.0003545271,0.0007301804,0.0013612515,0.00058756594,0.00078219443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003145327,0.00023328389,0.0012529802,0.0001079693,0.00014162985,0.00016430963,0.00010825243,0.6658868,0.02088647,0.039483223,0.0039106957,0.26750985],"study_design_scores_gemma":[0.000015320205,0.000044015003,0.0000864138,0.0000023991815,0.000011204013,0.000015823805,0.000004457788,0.9969844,0.00057288475,0.001553259,0.0007063187,0.0000034005393],"about_ca_topic_score_codex":0.00147693,"about_ca_topic_score_gemma":0.0016649567,"teacher_disagreement_score":0.003991057,"about_ca_system_score_codex":0.00031397276,"about_ca_system_score_gemma":0.00043176714,"threshold_uncertainty_score":0.01335144},"labels":[],"label_agreement":null},{"id":"W4413872209","doi":"10.5267/j.ijiec.2025.6.001","title":"An enhanced dung beetle optimization algorithm based-on multi-strategies for solving global optimization problems","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Optimization algorithm; Dung beetle; Mathematical optimization; Computer science; Optimization problem; Algorithm; Mathematics; Ecology; Biology","score_opus":0.03418458907752006,"score_gpt":0.327242333226351,"score_spread":0.2930577441488309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06596296,0.0008530186,0.9219872,0.00018496814,0.000102442165,0.00013955311,0.00006347205,0.00035135297,0.010355206],"genre_scores_gemma":[0.61212987,0.0005525182,0.38102794,0.00017049588,0.000034894438,0.00034695157,0.00019932134,0.00007915899,0.0054588458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998511,0.000034534223,0.0000075337184,0.000022503758,0.000062615625,0.000021796732],"domain_scores_gemma":[0.9998807,0.000046102155,0.000014836392,0.000010362441,0.000033826986,0.000014181293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002707018,0.0005881175,0.00061474345,0.0005329278,0.00026451235,0.0005424463,0.00069477636,0.0005234463,0.001148004],"category_scores_gemma":[0.00056680734,0.00019812827,0.00034261684,0.00044395064,0.00025687294,0.00037565877,0.0006967763,0.0004813179,0.00017281492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080108744,0.00009686034,0.0012149826,0.00014455194,0.00006884539,0.0001192139,0.00007696873,0.8274301,0.012054845,0.009940283,0.001622059,0.14715114],"study_design_scores_gemma":[0.000018460136,0.00004981419,0.0001912978,0.000007761937,0.000008519823,0.000026874302,0.000009362023,0.99595106,0.0009538783,0.0008388735,0.001938387,0.0000056826825],"about_ca_topic_score_codex":0.0035513584,"about_ca_topic_score_gemma":0.00494016,"teacher_disagreement_score":0.0035513584,"about_ca_system_score_codex":0.00032611788,"about_ca_system_score_gemma":0.00068490335,"threshold_uncertainty_score":0.0070613623},"labels":[],"label_agreement":null},{"id":"W4413953215","doi":"10.1007/s10586-025-05445-3","title":"A multi-strategy improved gazelle optimization algorithm for solving numerical optimization and engineering applications","year":2025,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Optimization algorithm; Engineering optimization; Mathematical optimization; Optimization problem; Algorithm; Mathematics","score_opus":0.01689102579222413,"score_gpt":0.2881112256679542,"score_spread":0.2712201998757301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413953215","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012583391,0.0003938726,0.9787926,0.00018130263,0.0001289774,0.00007584454,0.000035633628,0.00053955347,0.0072688065],"genre_scores_gemma":[0.22920129,0.00031410225,0.75720245,0.00026897583,0.00010607642,0.00061729096,0.0002047859,0.0002916338,0.011793397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997273,0.00009489177,0.000011425634,0.00003390654,0.000110781664,0.000021642441],"domain_scores_gemma":[0.99968016,0.00014290764,0.00002330655,0.000029818144,0.00010531662,0.00001845098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007317428,0.00081207365,0.0010239702,0.0007422069,0.00062875944,0.00077556947,0.0015850986,0.001546974,0.0054160827],"category_scores_gemma":[0.0014019822,0.0004446287,0.0007555266,0.0008405385,0.0005284993,0.0007423228,0.0012614537,0.0010567432,0.0010890715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001800712,0.00014556892,0.0006084832,0.00016525743,0.000096642245,0.00010827123,0.0000919976,0.81985754,0.008833316,0.016222151,0.0048186085,0.14887202],"study_design_scores_gemma":[0.000022828235,0.000043352076,0.000067695844,0.0000057862553,0.000006212353,0.000013276436,0.0000038127655,0.99733526,0.0004331028,0.0007857129,0.0012769748,0.000005989354],"about_ca_topic_score_codex":0.0038011558,"about_ca_topic_score_gemma":0.0048024496,"teacher_disagreement_score":0.0054160827,"about_ca_system_score_codex":0.00054568116,"about_ca_system_score_gemma":0.00094395597,"threshold_uncertainty_score":0.01811862},"labels":[],"label_agreement":null},{"id":"W4414034432","doi":"10.1007/s10845-025-02675-5","title":"A robust optimization model for the supplier portfolio selection problem using a combination of artificial fish swarm algorithm and simulated annealing","year":2025,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Simulated annealing; Swarm behaviour; Selection (genetic algorithm); Mathematical optimization; Portfolio; Computer science; Fish <Actinopterygii>; Algorithm; Artificial intelligence; Mathematics; Fishery; Business; Biology","score_opus":0.0503925827841007,"score_gpt":0.3050126222267949,"score_spread":0.25462003944269423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414034432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011472507,0.00023708645,0.9830051,0.00018762954,0.000041162533,0.000048290804,0.00004909129,0.0001379166,0.0048212307],"genre_scores_gemma":[0.7733648,0.00056513696,0.21488254,0.00014228585,0.00007002376,0.00039796988,0.0001882714,0.00012198672,0.010267029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995621,0.0001700398,0.000019798468,0.00008465859,0.00012283781,0.000040622894],"domain_scores_gemma":[0.99936074,0.0003897059,0.000088625784,0.00002418231,0.000110685396,0.00002608231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011886645,0.00084954954,0.001623729,0.00058024435,0.0004994543,0.0012736159,0.0017523343,0.0020074693,0.0032253696],"category_scores_gemma":[0.0021128955,0.0007732386,0.0011079261,0.00084696064,0.0007439151,0.0012038053,0.000936517,0.0011986124,0.00042931465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007810583,0.000007958665,0.0000433591,0.000010499599,0.000012064594,0.000012109562,0.0000054074835,0.99546885,0.00018066792,0.0023182838,0.00010092779,0.0018321314],"study_design_scores_gemma":[0.0000029187324,0.0000061350006,0.000016843625,0.0000012075741,0.0000028529614,0.0000022579395,9.3759127e-7,0.99942493,0.000031071864,0.00043664445,0.00007276013,0.000001577347],"about_ca_topic_score_codex":0.011402315,"about_ca_topic_score_gemma":0.007191169,"teacher_disagreement_score":0.011402315,"about_ca_system_score_codex":0.00094934826,"about_ca_system_score_gemma":0.0014254893,"threshold_uncertainty_score":0.022671878},"labels":[],"label_agreement":null},{"id":"W4414156966","doi":"10.3390/math13182909","title":"Machine Learning for Enhancing Metaheuristics in Global Optimization: A Comprehensive Review","year":2025,"lang":"en","type":"review","venue":"Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Metaheuristic; Flexibility (engineering); Hyper-heuristic; Key (lock); Search-based software engineering; Global optimization; Resource (disambiguation)","score_opus":0.07026562065125108,"score_gpt":0.3910868932276872,"score_spread":0.3208212725764361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414156966","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019619087,0.9952945,0.0024151446,0.0003284009,0.00012666975,0.000010566977,0.00001668187,0.000015934977,0.0015959053],"genre_scores_gemma":[0.001998632,0.99478805,0.0024091126,0.00016453824,0.00016060122,0.00001861001,0.00003308708,0.00000826112,0.00041909842],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959844,0.00009878659,0.000053221123,0.00006887318,0.00015216171,0.00002847032],"domain_scores_gemma":[0.9990283,0.0006547561,0.00010183611,0.00003190833,0.00015539663,0.000027814489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011391053,0.0010738996,0.0013522601,0.002911021,0.0003080316,0.00141449,0.0010124173,0.0012273706,0.003134791],"category_scores_gemma":[0.0019496694,0.0005034865,0.0010367029,0.005358442,0.00055231754,0.0018011206,0.00075983093,0.0015776796,0.0016730393],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035323155,0.000088817316,0.00023355566,0.025065627,0.00017144231,0.00009837314,0.000077510405,0.004528154,0.0010856864,0.02887047,0.015683478,0.9240616],"study_design_scores_gemma":[0.000021072405,0.00015677785,0.00071804656,0.009865433,0.00030186566,0.00062547246,0.000083085375,0.0033719256,0.0013289971,0.01907833,0.9643885,0.00006051234],"about_ca_topic_score_codex":0.0012356661,"about_ca_topic_score_gemma":0.0014735647,"teacher_disagreement_score":0.003134791,"about_ca_system_score_codex":0.0006984699,"about_ca_system_score_gemma":0.0014657554,"threshold_uncertainty_score":0.010486901},"labels":[],"label_agreement":null},{"id":"W4414223321","doi":"10.1609/icaps.v35i1.36134","title":"New Exact Methods for Solving Quadratic Traveling Salesman Problem","year":2025,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Alliance de recherche numérique du Canada; University of Toronto; Innovation, Science and Economic Development Canada","keywords":"Travelling salesman problem; Integer programming; Generalization; Quadratic programming; Quadratic equation; Branch and bound; Scalability; Integer (computer science); Linear programming","score_opus":0.05569454548912666,"score_gpt":0.38933066774580644,"score_spread":0.33363612225667977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414223321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026942028,0.0005003571,0.9911855,0.00013760327,0.00006896359,0.000054524837,0.00007449599,0.00030236781,0.004981969],"genre_scores_gemma":[0.10352704,0.0010389583,0.888534,0.00029114238,0.00011479395,0.00039470042,0.00043915978,0.00034910574,0.0053110444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991836,0.00019676973,0.000039586346,0.00012484255,0.0003658512,0.00008949569],"domain_scores_gemma":[0.9991572,0.00047355605,0.00008926633,0.000081883605,0.00016539996,0.000032743465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053201,0.0012975285,0.00080503925,0.0008994923,0.00045680424,0.0011004017,0.0017669348,0.0010848271,0.005955251],"category_scores_gemma":[0.0033096154,0.0006099176,0.0010150098,0.0013863537,0.0007007572,0.001675297,0.0011895637,0.0020258327,0.0010811728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037342674,0.00006336145,0.00028329223,0.00021520887,0.000038072947,0.000053169577,0.000066877095,0.8419381,0.0011300303,0.051310398,0.0040392787,0.10082493],"study_design_scores_gemma":[0.000011913762,0.000017584007,0.000029069031,0.000014617858,0.0000054373886,0.000015306634,0.000011505355,0.9863929,0.00019100851,0.01043304,0.0028732698,0.0000043556856],"about_ca_topic_score_codex":0.006615838,"about_ca_topic_score_gemma":0.006759384,"teacher_disagreement_score":0.006615838,"about_ca_system_score_codex":0.0009864123,"about_ca_system_score_gemma":0.001982281,"threshold_uncertainty_score":0.019922316},"labels":[],"label_agreement":null},{"id":"W4415058972","doi":"10.1016/j.asoc.2025.114066","title":"The effect of elitist fitness-based selection on the escape from local optima","year":2025,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Local optimum; Metaheuristic; Local search (optimization); Guided Local Search; Selection (genetic algorithm); Iterated local search; Task (project management); Key (lock)","score_opus":0.0070331794154838085,"score_gpt":0.2648644223046214,"score_spread":0.2578312428891376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415058972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2913833,0.003612224,0.6373591,0.0022770402,0.00044369634,0.00022730448,0.00011481786,0.0014102657,0.06317224],"genre_scores_gemma":[0.94557893,0.00095936767,0.046657998,0.00054530246,0.000075494594,0.0001206544,0.00006162241,0.00018238538,0.0058182403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981488,0.000751773,0.00008790236,0.00022818713,0.0005473455,0.0002359291],"domain_scores_gemma":[0.99148977,0.005971734,0.0006219065,0.0009452684,0.0007334232,0.00023791449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031152156,0.0008807883,0.0010812588,0.0007861932,0.00091907143,0.0019323721,0.0012699583,0.0013320182,0.004219393],"category_scores_gemma":[0.013766027,0.00026813598,0.0009874315,0.0006820491,0.0028518902,0.0018205452,0.0021313336,0.0017610881,0.00069550745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048169264,0.00024757878,0.006095083,0.00059442024,0.0002784539,0.0012334547,0.0009615293,0.65020764,0.024741445,0.14361416,0.004443635,0.16710086],"study_design_scores_gemma":[0.00026882475,0.0015367763,0.0057483353,0.00028416768,0.00027933207,0.0014369659,0.00047690223,0.8135116,0.022957774,0.13652797,0.016820226,0.00015114559],"about_ca_topic_score_codex":0.0014675474,"about_ca_topic_score_gemma":0.0009101744,"teacher_disagreement_score":0.004219393,"about_ca_system_score_codex":0.0009978804,"about_ca_system_score_gemma":0.00091600907,"threshold_uncertainty_score":0.016475081},"labels":[],"label_agreement":null},{"id":"W4415502605","doi":"10.1093/jcde/qwaf112","title":"AR-RBMO: An enhanced red-billed blue magpie optimizer with attraction-repulsion and dynamic balancing strategies for global optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Design and Engineering","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"National Natural Science Foundation of China","keywords":"Benchmark (surveying); Global optimization; Metaheuristic; Flexibility (engineering); Convergence (economics); Population; Robustness (evolution); Swarm intelligence; Optimization problem; Wilcoxon signed-rank test","score_opus":0.010517179620667231,"score_gpt":0.2738454120282298,"score_spread":0.2633282324075626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415502605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086135186,0.0017512017,0.8915888,0.00047753143,0.00021908984,0.0001704494,0.000092693845,0.0022116182,0.01735347],"genre_scores_gemma":[0.72772086,0.00046001218,0.26300046,0.0004136134,0.0000930091,0.00037032666,0.00023363985,0.00021902012,0.0074890666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966407,0.00011011876,0.000016651597,0.000047414953,0.00012551456,0.00003624391],"domain_scores_gemma":[0.9997806,0.000077035154,0.000037575956,0.000024973851,0.00006006144,0.000019771342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000675838,0.0010288076,0.00084659515,0.0007441123,0.00039905193,0.00077949197,0.001153305,0.0009846654,0.0021039704],"category_scores_gemma":[0.00080631184,0.00034588622,0.00073518424,0.00042646108,0.0003829609,0.000494307,0.000978358,0.00069416454,0.00059283676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118733,0.000117368516,0.00062482955,0.000110876164,0.00010083804,0.00009547646,0.000038990373,0.9066486,0.010304214,0.0062202746,0.0025030284,0.07311684],"study_design_scores_gemma":[0.000015052021,0.000056041696,0.00011223994,0.0000057188267,0.0000076147207,0.00001275345,0.000003915105,0.99748355,0.0006840448,0.00047488505,0.0011386883,0.000005535344],"about_ca_topic_score_codex":0.0023442786,"about_ca_topic_score_gemma":0.002190979,"teacher_disagreement_score":0.0023442786,"about_ca_system_score_codex":0.00038315717,"about_ca_system_score_gemma":0.00058334187,"threshold_uncertainty_score":0.0070385337},"labels":[],"label_agreement":null},{"id":"W4415556772","doi":"10.61091/jcmcc128-08","title":"Small hard-to-color graphs for the Sl algorithm","year":2025,"lang":"","type":"article","venue":"Journal of Combinatorial Mathematics and Combinatorial Computing","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Vertex (graph theory); Graph coloring; Graph power; Graph algorithms; Efficient algorithm","score_opus":0.03372772032434005,"score_gpt":0.297906942643309,"score_spread":0.26417922231896895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415556772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10052723,0.00039354205,0.82920265,0.0035437222,0.0003116648,0.00095972145,0.0016257594,0.010731374,0.05270432],"genre_scores_gemma":[0.36909118,0.00032159756,0.5995316,0.0019722336,0.00019484395,0.00085276697,0.0039614146,0.002886862,0.021187464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983846,0.0003596236,0.00008384324,0.00038986173,0.00047008097,0.00031197447],"domain_scores_gemma":[0.99272037,0.0031846578,0.0003975079,0.0024099993,0.0008093345,0.0004781777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011045492,0.0014400848,0.00072622206,0.00095342495,0.0017358218,0.0015599634,0.00198532,0.0011837228,0.016942784],"category_scores_gemma":[0.008200396,0.00069482607,0.0013508821,0.0009649948,0.001738228,0.0040594824,0.002882913,0.002956598,0.0038002657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016886119,0.00093918387,0.0033616952,0.0010040461,0.00009789768,0.0005037765,0.0007295607,0.19924097,0.03440053,0.3430681,0.09309826,0.3218673],"study_design_scores_gemma":[0.00034166846,0.00026390282,0.00073052244,0.00009647122,0.00007095808,0.00025629887,0.0002495033,0.44973612,0.016457997,0.49394265,0.03778226,0.00007164403],"about_ca_topic_score_codex":0.0046167714,"about_ca_topic_score_gemma":0.010056441,"teacher_disagreement_score":0.016942784,"about_ca_system_score_codex":0.0024329524,"about_ca_system_score_gemma":0.0035228294,"threshold_uncertainty_score":0.05667919},"labels":[],"label_agreement":null},{"id":"W4415649049","doi":"10.1007/978-3-032-04777-9_8","title":"A New Hybrid History-Driven Metaheuristic Approach for Continuous Optimization","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Metaheuristic; Tree (set theory); Hybrid system; Optimization problem; Tree traversal; Local search (optimization); Beam search; Hybrid algorithm (constraint satisfaction)","score_opus":0.02245640978012536,"score_gpt":0.23888850119716973,"score_spread":0.21643209141704436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415649049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007977461,0.00067233905,0.9799541,0.00016771696,0.00022798283,0.00006656696,0.00007659348,0.00036229764,0.010494949],"genre_scores_gemma":[0.26708433,0.0007422786,0.7126436,0.00042639684,0.00034435562,0.00057486224,0.0003245253,0.00041882944,0.01744083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971217,0.00007460198,0.000013725009,0.000038932667,0.00012817801,0.000032303902],"domain_scores_gemma":[0.9995554,0.00023433265,0.00003459685,0.000045541718,0.000097826836,0.000032373835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072074425,0.00086534506,0.0009900121,0.0009171015,0.0004682024,0.0010879122,0.002521103,0.0015552235,0.0049694595],"category_scores_gemma":[0.0012387548,0.000566953,0.0009558189,0.0012482906,0.00058550533,0.0010353591,0.001402684,0.0013155763,0.00073568575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006888343,0.00007886386,0.00027297606,0.0000977555,0.00009910638,0.000062444364,0.000040214003,0.8720016,0.0024799255,0.025166338,0.002784989,0.096847],"study_design_scores_gemma":[0.000009942912,0.000017431325,0.000032172204,0.0000051442303,0.000006440543,0.000009898001,0.0000028477193,0.9960951,0.00017583018,0.0026130052,0.0010282365,0.000003837335],"about_ca_topic_score_codex":0.002617696,"about_ca_topic_score_gemma":0.0038485187,"teacher_disagreement_score":0.0049694595,"about_ca_system_score_codex":0.0006932225,"about_ca_system_score_gemma":0.00091795827,"threshold_uncertainty_score":0.01662445},"labels":[],"label_agreement":null},{"id":"W4416513214","doi":"10.1109/tsmc.2025.3628274","title":"A New Explicit Penalty Method for Evolutionary Multimodal Optimization","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hunan Provincial Postdoctoral Science Foundation; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Penalty method; Leverage (statistics); Flexibility (engineering); Local optimum; Optimization problem; Population; Evolutionary algorithm; Function (biology)","score_opus":0.024429797815307533,"score_gpt":0.3061023963866196,"score_spread":0.2816725985713121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031809493,0.00014976291,0.9944342,0.00009215923,0.00004446298,0.000022136763,0.000016054048,0.00009580567,0.0019645575],"genre_scores_gemma":[0.19728851,0.0003896984,0.79337615,0.00030184735,0.00010926715,0.0003285092,0.00016038807,0.00026669187,0.0077788974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995246,0.00015614784,0.000027479637,0.00005798927,0.00019360235,0.000040161904],"domain_scores_gemma":[0.9993298,0.0003173922,0.00007658992,0.00007178076,0.00015850303,0.00004583588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009533369,0.0009454029,0.0006652314,0.00059766055,0.00042190537,0.00071751984,0.0013511479,0.0011298647,0.0027333342],"category_scores_gemma":[0.0027321826,0.00032260467,0.00062179833,0.0005755018,0.00061759166,0.0011962953,0.0017063876,0.0013410763,0.0006104951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008888665,0.00008730637,0.00061510684,0.00021628161,0.000059697588,0.0001704297,0.00009897411,0.7567211,0.013017944,0.057511944,0.0033695272,0.16804282],"study_design_scores_gemma":[0.0000069432767,0.000025606658,0.000048551763,0.000009118101,0.0000040161844,0.00003522665,0.0000041312583,0.99390984,0.0006945149,0.00322391,0.002031585,0.0000066855805],"about_ca_topic_score_codex":0.0009817998,"about_ca_topic_score_gemma":0.0011874196,"teacher_disagreement_score":0.0027333342,"about_ca_system_score_codex":0.00036603535,"about_ca_system_score_gemma":0.00085208873,"threshold_uncertainty_score":0.009143889},"labels":[],"label_agreement":null},{"id":"W52929814","doi":"10.5220/0002253403140317","title":"A NEW HYBRID GENETIC ALGORITHM FOR MAXIMUM INDEPENDENT SET PROBLEM","year":2009,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crossover; Genetic algorithm; Heuristic; Algorithm; Computer science; Set (abstract data type); Mutation; Mathematical optimization; Population-based incremental learning; Operator (biology); Meta-optimization; Variety (cybernetics); Mathematics; Artificial intelligence; Biology","score_opus":0.023428074667953578,"score_gpt":0.28873536671678873,"score_spread":0.26530729204883513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52929814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006686334,0.00042366007,0.98849154,0.00013839675,0.00007921577,0.000052415635,0.000037509093,0.00039627042,0.0036947406],"genre_scores_gemma":[0.13564394,0.00049701583,0.85648996,0.00021030029,0.000091690716,0.00031861506,0.0002378181,0.00011165897,0.0063990057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994143,0.00015243431,0.000020671887,0.00010479854,0.00026702177,0.00004070678],"domain_scores_gemma":[0.99973685,0.00013132795,0.000024358882,0.000028381273,0.00006010941,0.000019015491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007724429,0.000736684,0.0008690904,0.0009809867,0.00048727708,0.00075921864,0.001350852,0.0012105653,0.0025096224],"category_scores_gemma":[0.0013679111,0.00028507374,0.0007238511,0.0012265841,0.00056755205,0.00095223705,0.00097446295,0.0010230195,0.0006072909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010822488,0.00007992783,0.0005186473,0.00012688029,0.000102209255,0.00015009553,0.000099650766,0.66683185,0.008019337,0.051074192,0.004864009,0.26802492],"study_design_scores_gemma":[0.000050239178,0.00006284145,0.00013314946,0.000012911129,0.00002173228,0.00010708873,0.000011281011,0.977008,0.0016275143,0.012861033,0.008089705,0.000014609283],"about_ca_topic_score_codex":0.0016261069,"about_ca_topic_score_gemma":0.0015534555,"teacher_disagreement_score":0.0025096224,"about_ca_system_score_codex":0.00058454904,"about_ca_system_score_gemma":0.0009092319,"threshold_uncertainty_score":0.008395553},"labels":[],"label_agreement":null},{"id":"W61930541","doi":"","title":"A preliminary study for multiple ant colony system with new communication strategies","year":2005,"lang":"en","type":"article","venue":"International Conference on Communications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ant colony optimization algorithms; Travelling salesman problem; Weighting; Ant colony; Computer science; Scheme (mathematics); ANT; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Computer network","score_opus":0.1261040882049941,"score_gpt":0.38162791936840496,"score_spread":0.2555238311634108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61930541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12651248,0.002627236,0.8498206,0.0008008729,0.00023097187,0.00025386078,0.000021817326,0.00020168832,0.019530484],"genre_scores_gemma":[0.8010931,0.0023293267,0.18869382,0.00018210502,0.0002717918,0.000196345,0.00004421242,0.000067570436,0.007121658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991559,0.00029188904,0.00003994376,0.00012292778,0.00031875586,0.000070688635],"domain_scores_gemma":[0.99761665,0.0013055479,0.00014118955,0.0002176544,0.0006384577,0.0000805554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011144859,0.00035256916,0.00047138662,0.00024822206,0.00035879135,0.00085838104,0.00072414364,0.00057240255,0.002038695],"category_scores_gemma":[0.005928815,0.00018634745,0.0003609954,0.00045338794,0.000473081,0.0017209239,0.00039618032,0.000783612,0.00033872054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040375322,0.000416387,0.0036289082,0.0011840244,0.00016459187,0.0008809518,0.000711759,0.4963833,0.057253685,0.14696643,0.0023605675,0.28964564],"study_design_scores_gemma":[0.000026626638,0.0005982592,0.0006689514,0.000032207023,0.000041671432,0.00039586783,0.00008306906,0.96300083,0.01010762,0.014655566,0.01036873,0.00002060233],"about_ca_topic_score_codex":0.000867818,"about_ca_topic_score_gemma":0.0006015956,"teacher_disagreement_score":0.002038695,"about_ca_system_score_codex":0.00032132442,"about_ca_system_score_gemma":0.00055920356,"threshold_uncertainty_score":0.0068200827},"labels":[],"label_agreement":null},{"id":"W6890210412","doi":"10.34943/64984621-555d-41fb-ae45-3745eeac3e15","title":"China Creek Hydrophone Deployed 2023-09-16","year":2023,"lang":"en","type":"dataset","venue":"Ocean Networks Canada Society","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hydrophone; Underwater; Sound (geography); Data logger; Inlet; Waveform","score_opus":0.00985496403637428,"score_gpt":0.23027306343393691,"score_spread":0.22041809939756263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6890210412","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008457987,0.000076515564,0.00019937364,0.00009407888,0.00006134769,0.000026840413,0.99620456,0.0008333114,0.0016582613],"genre_scores_gemma":[0.00086351373,0.000027882035,0.00034249324,0.000031555217,0.0000063439793,0.000040504492,0.99799734,0.00004503103,0.0006452233],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989188,0.00013222647,0.00010107397,0.0002935778,0.0003692731,0.00018511974],"domain_scores_gemma":[0.9986254,0.0001469325,0.00007441329,0.0003609739,0.00064806116,0.00014424704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089492596,0.0024895095,0.0012517292,0.0020856506,0.0009921541,0.0014819729,0.0028831365,0.0016597015,0.01808769],"category_scores_gemma":[0.0029244937,0.00040593388,0.00080141774,0.004126852,0.0005558213,0.0012441641,0.0015673058,0.0015447822,0.052490123],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007583509,0.00003336087,0.0012855061,0.00022915269,0.000018754185,0.000043410724,0.000025186862,0.0005902302,0.0002484977,0.00035527488,0.9936418,0.0034530282],"study_design_scores_gemma":[0.00023543146,0.000048942016,0.010220871,0.00022752697,0.000025704638,0.00013806672,0.0002612907,0.0028631303,0.0011652113,0.0015317671,0.98321575,0.000066313594],"about_ca_topic_score_codex":0.06500785,"about_ca_topic_score_gemma":0.13022909,"teacher_disagreement_score":0.93499213,"about_ca_system_score_codex":0.0015834874,"about_ca_system_score_gemma":0.0025116415,"threshold_uncertainty_score":0.12925893},"labels":[],"label_agreement":null},{"id":"W6901527556","doi":"10.60692/qc1ye-n4s07","title":"Invited paper: A Review of Thresheld Convergence","year":2015,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Metaheuristic; Convergence (economics); Particle swarm optimization; Local search (optimization); Differential evolution; Attraction; Population; Structural basin; Stability (learning theory)","score_opus":0.0748210566638181,"score_gpt":0.26234279261719234,"score_spread":0.18752173595337424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901527556","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032845692,0.94443315,0.00666541,0.018542303,0.015641838,0.000015845797,0.000050359187,0.00003678992,0.014285797],"genre_scores_gemma":[0.0076959594,0.9337163,0.0043259086,0.0134551,0.028909128,0.00005168404,0.00012254214,0.0001276151,0.01159571],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778396,0.0007257983,0.00023055253,0.00039024526,0.0007290372,0.00014044007],"domain_scores_gemma":[0.9901231,0.0056314985,0.00039086968,0.000326665,0.0031481155,0.0003796903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004354678,0.0010264462,0.0014021285,0.0035058619,0.00095598644,0.0033660622,0.0026244798,0.0038484656,0.010311488],"category_scores_gemma":[0.016722571,0.0004497905,0.0009446258,0.00473743,0.0027229204,0.0066222716,0.001991646,0.0052408623,0.008515951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012473257,0.0000762373,0.00070544006,0.0058533894,0.00009267852,0.00032032919,0.00033255733,0.0026348014,0.00031680596,0.098421216,0.42301044,0.46811137],"study_design_scores_gemma":[0.000010024858,0.00004492641,0.00032408713,0.0023917775,0.00002385266,0.00067735335,0.00008245867,0.00050235365,0.00020019643,0.0224603,0.97324955,0.000033095428],"about_ca_topic_score_codex":0.0021110594,"about_ca_topic_score_gemma":0.001965755,"teacher_disagreement_score":0.010311488,"about_ca_system_score_codex":0.0021259524,"about_ca_system_score_gemma":0.002712139,"threshold_uncertainty_score":0.034495354},"labels":[],"label_agreement":null},{"id":"W6901589623","doi":"10.60692/sn2bp-er609","title":"Velocity pausing particle swarm optimization: a novel variant for global optimization","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"","keywords":"Particle swarm optimization; Metaheuristic; Benchmark (surveying); Multi-swarm optimization; Local optimum; Convergence (economics); Premature convergence; Global optimization; Population","score_opus":0.06976714388031968,"score_gpt":0.27188545616456816,"score_spread":0.20211831228424848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901589623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009977134,0.00066589366,0.98496336,0.0001488909,0.00017935006,0.00006562808,0.000024305653,0.00034248317,0.0036329008],"genre_scores_gemma":[0.5364056,0.001136971,0.45623598,0.0003051151,0.000360792,0.00039169186,0.00025438739,0.00028037842,0.0046292143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944717,0.00018575383,0.000036946894,0.000089631554,0.00020047654,0.000040045128],"domain_scores_gemma":[0.99944526,0.00019019369,0.000091265414,0.00008890732,0.00014281154,0.000041487936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086607016,0.0010198059,0.00082829344,0.00081894745,0.00039002098,0.0010825704,0.0014567531,0.0009836752,0.0012804259],"category_scores_gemma":[0.0017160584,0.0003432349,0.0008491817,0.0009561681,0.00073152006,0.00092933176,0.0011509822,0.0010926822,0.00041828954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014061158,0.000099305515,0.001847004,0.00020643762,0.00013888531,0.00021643394,0.00013468249,0.7187014,0.013210943,0.03944542,0.0038399282,0.22201897],"study_design_scores_gemma":[0.000020089063,0.0000824826,0.0001818013,0.00001255202,0.000016091262,0.00006415657,0.000009053858,0.99108726,0.0010963201,0.0035787383,0.0038406216,0.000010846822],"about_ca_topic_score_codex":0.0017346274,"about_ca_topic_score_gemma":0.0009142482,"teacher_disagreement_score":0.0017346274,"about_ca_system_score_codex":0.0003552562,"about_ca_system_score_gemma":0.00068239623,"threshold_uncertainty_score":0.0045802593},"labels":[],"label_agreement":null},{"id":"W6902300727","doi":"10.6084/m9.figshare.26628502.v1","title":"Additional file 1 of Artificial Intelligence based wrapper for high dimensional feature selection","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Feature selection; Selection (genetic algorithm); Feature (linguistics); High dimensional; Pattern recognition (psychology)","score_opus":0.0461467105856483,"score_gpt":0.2934908961387054,"score_spread":0.2473441855530571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6902300727","genre_codex":"dataset","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004440281,0.00003406995,0.0028095613,0.00011354875,0.000050193816,0.000116205236,0.99147016,0.0034506756,0.001511466],"genre_scores_gemma":[0.01454013,0.00013854488,0.021789918,0.00050711597,0.0001266683,0.0021317773,0.94381976,0.006600451,0.010345609],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925166,0.000133266,0.00009616408,0.00022101474,0.00020599167,0.000091890455],"domain_scores_gemma":[0.9838816,0.012431894,0.00043041518,0.0012545816,0.0017075884,0.00029390142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017673478,0.0013187514,0.0012035146,0.001586079,0.00063167105,0.001825711,0.0025279664,0.0011147239,0.83009416],"category_scores_gemma":[0.027775524,0.00067798625,0.0010033948,0.0031622732,0.00028264054,0.001630968,0.0010501251,0.0012057361,0.21833415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005016137,0.000109951354,0.0010985122,0.0019604906,0.00006165113,0.00006368621,0.000032165393,0.0017952422,0.00026119038,0.00110583,0.9752679,0.017741673],"study_design_scores_gemma":[0.0073726154,0.0006795943,0.012316584,0.0016266078,0.0003027655,0.0005164042,0.00031796965,0.028819542,0.0070823194,0.036347926,0.9043501,0.0002675841],"about_ca_topic_score_codex":0.0029558884,"about_ca_topic_score_gemma":0.006118833,"teacher_disagreement_score":0.83009416,"about_ca_system_score_codex":0.0007476185,"about_ca_system_score_gemma":0.0013932223,"threshold_uncertainty_score":0.2423501},"labels":[],"label_agreement":null},{"id":"W6920233024","doi":"10.60692/kd67p-mxk81","title":"Invited paper: A Review of Thresheld Convergence","year":2015,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Metaheuristic; Convergence (economics); Particle swarm optimization; Local search (optimization); Differential evolution; Attraction; Population; Structural basin; Stability (learning theory)","score_opus":0.0748210566638181,"score_gpt":0.26234279261719234,"score_spread":0.18752173595337424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6920233024","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032845692,0.94443315,0.00666541,0.018542303,0.015641838,0.000015845797,0.000050359187,0.00003678992,0.014285797],"genre_scores_gemma":[0.0076959594,0.9337163,0.0043259086,0.0134551,0.028909128,0.00005168404,0.00012254214,0.0001276151,0.01159571],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778396,0.0007257983,0.00023055253,0.00039024526,0.0007290372,0.00014044007],"domain_scores_gemma":[0.9901231,0.0056314985,0.00039086968,0.000326665,0.0031481155,0.0003796903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004354678,0.0010264462,0.0014021285,0.0035058619,0.00095598644,0.0033660622,0.0026244798,0.0038484656,0.010311488],"category_scores_gemma":[0.016722571,0.0004497905,0.0009446258,0.00473743,0.0027229204,0.0066222716,0.001991646,0.0052408623,0.008515951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012473257,0.0000762373,0.00070544006,0.0058533894,0.00009267852,0.00032032919,0.00033255733,0.0026348014,0.00031680596,0.098421216,0.42301044,0.46811137],"study_design_scores_gemma":[0.000010024858,0.00004492641,0.00032408713,0.0023917775,0.00002385266,0.00067735335,0.00008245867,0.00050235365,0.00020019643,0.0224603,0.97324955,0.000033095428],"about_ca_topic_score_codex":0.0021110594,"about_ca_topic_score_gemma":0.001965755,"teacher_disagreement_score":0.010311488,"about_ca_system_score_codex":0.0021259524,"about_ca_system_score_gemma":0.002712139,"threshold_uncertainty_score":0.034495354},"labels":[],"label_agreement":null},{"id":"W6927339931","doi":"10.3389/fneur.2021.757665.s003","title":"Table_3_Antegrade or Retrograde Approach for the Management of Tandem Occlusions in Acute Ischemic Stroke: A Systematic Review and Meta-Analysis.DOCX","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Modified Rankin Scale; Cochrane Library; Odds ratio; Intracerebral hemorrhage; Stroke (engine); Concomitant","score_opus":0.10515946588784852,"score_gpt":0.3454269154334845,"score_spread":0.240267449545636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6927339931","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011912359,0.47184747,0.0059185876,0.005155499,0.002613031,0.021180283,0.47460642,0.0012645918,0.00550167],"genre_scores_gemma":[0.19013321,0.48290613,0.025261614,0.014281334,0.0024731958,0.12722583,0.12394393,0.0010421932,0.03273257],"study_design_codex":"systematic_review","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977665,0.0006812515,0.00064843375,0.0002521008,0.00045573182,0.0001958699],"domain_scores_gemma":[0.98912734,0.0076206047,0.0019482597,0.00020518442,0.0009963161,0.00010224503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056315307,0.0027882778,0.009589528,0.0059279185,0.0005748623,0.0021232683,0.002423724,0.0013747357,0.13476428],"category_scores_gemma":[0.023897303,0.0011203426,0.018802712,0.008059387,0.0004450786,0.0032819004,0.0013525635,0.0011384267,0.003646231],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010170564,0.000017053178,0.001471454,0.9338302,0.036699567,0.000084126215,0.000060851366,0.0003511305,0.00022139715,0.0003858956,0.019093461,0.00676793],"study_design_scores_gemma":[0.008697037,0.0005836431,0.027496079,0.4054017,0.46438974,0.0004694098,0.00032672385,0.0021059948,0.0011058165,0.0037251378,0.08547616,0.00022255199],"about_ca_topic_score_codex":0.0065080975,"about_ca_topic_score_gemma":0.017055778,"teacher_disagreement_score":0.13476428,"about_ca_system_score_codex":0.0020458456,"about_ca_system_score_gemma":0.0043221554,"threshold_uncertainty_score":0.4508314},"labels":[],"label_agreement":null},{"id":"W6930119102","doi":"10.5281/zenodo.11975447","title":"Christ pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Circumstantial evidence; Pretext; Subject (documents); Stupidity; Session (web analytics)","score_opus":0.029285596234657416,"score_gpt":0.25944437869932785,"score_spread":0.23015878246467042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930119102","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032694027,0.0006318523,0.001236582,0.001607149,0.003505121,0.00015669884,0.0041194563,0.0031326858,0.9852835],"genre_scores_gemma":[0.0015305269,0.00066614914,0.0005753374,0.00070850604,0.0005959608,0.000044557168,0.002541147,0.0013127254,0.99202526],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984876,0.00012108193,0.00008358936,0.00020874265,0.0009006437,0.00019824784],"domain_scores_gemma":[0.99683243,0.00028399922,0.000110259316,0.0005492578,0.0016155391,0.0006085305],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009568667,0.0012416833,0.0010324444,0.0033521373,0.002770129,0.010840075,0.0022428702,0.0025733206,0.90795606],"category_scores_gemma":[0.0055316356,0.0007176067,0.0010399276,0.0024735606,0.0009049722,0.007873126,0.0046615684,0.0029348163,0.84405607],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033341086,0.00003174785,0.00006367778,0.00015256577,0.0000032022142,0.000081235674,0.00006569574,0.000045329347,0.00025662512,0.004899986,0.93877417,0.055592377],"study_design_scores_gemma":[0.000004039442,0.0000059900854,0.00010219399,0.00003973941,0.000001276419,0.000064735876,0.00004570738,0.000020917922,0.00011641861,0.0005254965,0.9990688,0.0000047165368],"about_ca_topic_score_codex":0.0037180576,"about_ca_topic_score_gemma":0.0068629393,"teacher_disagreement_score":0.092043936,"about_ca_system_score_codex":0.0019433681,"about_ca_system_score_gemma":0.002289258,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6930301617","doi":"10.5281/zenodo.11689976","title":"2023 dinghy towing guide pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Articular cartilage damage; Limiting; Frame (networking)","score_opus":0.0341866335488046,"score_gpt":0.2747473078308493,"score_spread":0.24056067428204467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930301617","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044709316,0.00035817613,0.0027069347,0.00050635124,0.0012013485,0.00030545887,0.0037557753,0.006916649,0.9838022],"genre_scores_gemma":[0.0006483045,0.00019307713,0.0008732132,0.00020515746,0.00007687435,0.000059950366,0.0013292823,0.0014671091,0.99514705],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999463,0.000027005874,0.00002244961,0.00006984765,0.00034286492,0.00007484331],"domain_scores_gemma":[0.998262,0.0001879237,0.00004231706,0.00018965588,0.0009842141,0.00033381235],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055144174,0.0012245651,0.0009792458,0.002013016,0.0016989196,0.004478988,0.0019060931,0.001854781,0.92055875],"category_scores_gemma":[0.0026186248,0.0007903173,0.00085620617,0.001483437,0.0004997617,0.0034563704,0.0026696178,0.0019936194,0.8697166],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031951422,0.00003279374,0.00004416501,0.00011511889,0.0000015121173,0.000042196556,0.000037291105,0.00004333305,0.0004981764,0.00083886116,0.94835407,0.049960446],"study_design_scores_gemma":[0.0000074647774,0.000015009364,0.00016624479,0.000036207995,0.0000013408354,0.000047064972,0.00005535031,0.00005371473,0.00027876152,0.00029728733,0.9990355,0.0000059653667],"about_ca_topic_score_codex":0.004722639,"about_ca_topic_score_gemma":0.012026774,"teacher_disagreement_score":0.92055875,"about_ca_system_score_codex":0.0010094917,"about_ca_system_score_gemma":0.0014342394,"threshold_uncertainty_score":0.11331332},"labels":[],"label_agreement":null},{"id":"W6930364649","doi":"10.5281/zenodo.12003806","title":"cours de docimologie pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Passer; Context (archaeology); Limiting","score_opus":0.05812599928387589,"score_gpt":0.28726447013171624,"score_spread":0.22913847084784034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930364649","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011006516,0.0015187586,0.001086889,0.010586392,0.03445257,0.0011692347,0.009631582,0.0056893765,0.9347647],"genre_scores_gemma":[0.0028051839,0.0005632372,0.00043897785,0.0023323523,0.0088329995,0.00038656656,0.0027216286,0.002730357,0.9791886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9925136,0.00054809207,0.00031995578,0.00056621566,0.005138329,0.0009137425],"domain_scores_gemma":[0.977825,0.0023280792,0.00077831553,0.0024006637,0.011270994,0.005396975],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0043679858,0.0019888426,0.0021054528,0.0071831234,0.005742926,0.02455483,0.0021594309,0.0045691878,0.83914953],"category_scores_gemma":[0.019788543,0.001074272,0.0016727797,0.0047776634,0.0014596871,0.008173112,0.007398271,0.005704363,0.7632409],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028227832,0.000022112752,0.00004312246,0.00005833106,0.000001720461,0.000033443914,0.00002124738,0.000013037581,0.000099380726,0.00058511825,0.9862975,0.012796727],"study_design_scores_gemma":[0.000013955502,0.000018286939,0.00035713462,0.000055358345,0.0000015319733,0.000030671916,0.000048839775,0.000022237224,0.00008069353,0.00029929608,0.99906236,0.000009619902],"about_ca_topic_score_codex":0.003781685,"about_ca_topic_score_gemma":0.007371919,"teacher_disagreement_score":0.16085047,"about_ca_system_score_codex":0.0042724903,"about_ca_system_score_gemma":0.00421754,"threshold_uncertainty_score":0.22943366},"labels":[],"label_agreement":null},{"id":"W6931846493","doi":"10.5281/zenodo.7845935","title":"Why You Should Focus on Improving Career Guidance Services","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Diafiltration; Dysgeusia; Liquation; Emperipolesis; Demotion; Triacetin","score_opus":0.06073825000746619,"score_gpt":0.27310263188605977,"score_spread":0.21236438187859358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931846493","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032970465,0.0038064995,0.0017361321,0.9696241,0.00657712,0.00008544905,0.000131573,0.00044627016,0.01429577],"genre_scores_gemma":[0.10678161,0.011674158,0.021054704,0.78803736,0.0066243554,0.00053019833,0.00039495085,0.00086566,0.06403695],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98250294,0.005777723,0.00082924723,0.0012381126,0.00565842,0.0039934893],"domain_scores_gemma":[0.85895395,0.01861824,0.006642382,0.004284869,0.057881825,0.053618766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015492093,0.0008454883,0.00083060446,0.0013843378,0.006223445,0.010003285,0.0030918133,0.014495764,0.06918368],"category_scores_gemma":[0.089584194,0.0005441536,0.00096877775,0.0016316212,0.00405228,0.012042871,0.005343198,0.01299429,0.027955279],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008233084,0.00033628498,0.005545489,0.00044370317,0.000048313013,0.00018881823,0.0010533871,0.00015177412,0.00039103717,0.0048013106,0.8905383,0.09641917],"study_design_scores_gemma":[0.00015395004,0.00032881848,0.015559313,0.0029239797,0.00007932684,0.0010512708,0.012890608,0.00037087014,0.0007564372,0.0137745505,0.951984,0.00012687084],"about_ca_topic_score_codex":0.01915608,"about_ca_topic_score_gemma":0.024482721,"teacher_disagreement_score":0.06918368,"about_ca_system_score_codex":0.0047887224,"about_ca_system_score_gemma":0.02284212,"threshold_uncertainty_score":0.23144245},"labels":[],"label_agreement":null},{"id":"W6939006616","doi":"10.60692/thbcn-2db10","title":"A Solution to the Challenge of Optimization on ''Golf-Course''-Like Fitness Landscapes","year":2013,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Task (project management); Genetic algorithm; Evolutionary algorithm; Fitness landscape; Variable (mathematics); Evolutionary computation","score_opus":0.033084631035920714,"score_gpt":0.23698456041691668,"score_spread":0.20389992938099596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939006616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033057004,0.0013298781,0.94640666,0.0061437166,0.00016604106,0.000033351986,0.00006425374,0.00016648106,0.012632558],"genre_scores_gemma":[0.5068824,0.0021499326,0.47905755,0.0016021077,0.00036880045,0.00019930233,0.00016628609,0.0002594917,0.00931412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996051,0.000153262,0.000013277066,0.00008612088,0.00010528833,0.00003692424],"domain_scores_gemma":[0.998796,0.0007210517,0.00011604591,0.0001750771,0.00014005553,0.000051794905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232974,0.0005244801,0.0007843277,0.0004808772,0.0007499226,0.0016205712,0.0010407903,0.0018034505,0.0028240425],"category_scores_gemma":[0.00587666,0.00029278576,0.0005909545,0.00059549784,0.001859909,0.002068532,0.0014201305,0.0023133855,0.00046974313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037791575,0.000048726888,0.00095106603,0.00015492285,0.000086800974,0.00011756587,0.00025600474,0.4066501,0.0031860173,0.49696004,0.0074548796,0.08409612],"study_design_scores_gemma":[0.000031889864,0.00006801931,0.0005398233,0.000051428793,0.000017744624,0.00012489388,0.000084420986,0.49232665,0.0008652842,0.48803037,0.017836204,0.000023301769],"about_ca_topic_score_codex":0.001465304,"about_ca_topic_score_gemma":0.0013186478,"teacher_disagreement_score":0.0028240425,"about_ca_system_score_codex":0.00066047424,"about_ca_system_score_gemma":0.0010499876,"threshold_uncertainty_score":0.009447336},"labels":[],"label_agreement":null},{"id":"W6939106462","doi":"10.60692/wmf9w-wpe97","title":"A Solution to the Challenge of Optimization on ''Golf-Course''-Like Fitness Landscapes","year":2013,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Task (project management); Genetic algorithm; Evolutionary algorithm; Fitness landscape; Variable (mathematics); Evolutionary computation","score_opus":0.033084631035920714,"score_gpt":0.23698456041691668,"score_spread":0.20389992938099596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6939106462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033057004,0.0013298781,0.94640666,0.0061437166,0.00016604106,0.000033351986,0.00006425374,0.00016648106,0.012632558],"genre_scores_gemma":[0.5068824,0.0021499326,0.47905755,0.0016021077,0.00036880045,0.00019930233,0.00016628609,0.0002594917,0.00931412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996051,0.000153262,0.000013277066,0.00008612088,0.00010528833,0.00003692424],"domain_scores_gemma":[0.998796,0.0007210517,0.00011604591,0.0001750771,0.00014005553,0.000051794905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232974,0.0005244801,0.0007843277,0.0004808772,0.0007499226,0.0016205712,0.0010407903,0.0018034505,0.0028240425],"category_scores_gemma":[0.00587666,0.00029278576,0.0005909545,0.00059549784,0.001859909,0.002068532,0.0014201305,0.0023133855,0.00046974313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037791575,0.000048726888,0.00095106603,0.00015492285,0.000086800974,0.00011756587,0.00025600474,0.4066501,0.0031860173,0.49696004,0.0074548796,0.08409612],"study_design_scores_gemma":[0.000031889864,0.00006801931,0.0005398233,0.000051428793,0.000017744624,0.00012489388,0.000084420986,0.49232665,0.0008652842,0.48803037,0.017836204,0.000023301769],"about_ca_topic_score_codex":0.001465304,"about_ca_topic_score_gemma":0.0013186478,"teacher_disagreement_score":0.0028240425,"about_ca_system_score_codex":0.00066047424,"about_ca_system_score_gemma":0.0010499876,"threshold_uncertainty_score":0.009447336},"labels":[],"label_agreement":null},{"id":"W6958429649","doi":"10.6084/m9.figshare.26628502","title":"Additional file 1 of Artificial Intelligence based wrapper for high dimensional feature selection","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Feature selection; Selection (genetic algorithm); Feature (linguistics); High dimensional; Pattern recognition (psychology)","score_opus":0.0461467105856483,"score_gpt":0.2934908961387054,"score_spread":0.2473441855530571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958429649","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004440281,0.00003406995,0.0028095613,0.00011354875,0.000050193816,0.000116205236,0.99147016,0.0034506756,0.001511466],"genre_scores_gemma":[0.01454013,0.00013854488,0.021789918,0.00050711597,0.0001266683,0.0021317773,0.94381976,0.006600451,0.010345609],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925166,0.000133266,0.00009616408,0.00022101474,0.00020599167,0.000091890455],"domain_scores_gemma":[0.9838816,0.012431894,0.00043041518,0.0012545816,0.0017075884,0.00029390142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017673478,0.0013187514,0.0012035146,0.001586079,0.00063167105,0.001825711,0.0025279664,0.0011147239,0.83009416],"category_scores_gemma":[0.027775524,0.00067798625,0.0010033948,0.0031622732,0.00028264054,0.001630968,0.0010501251,0.0012057361,0.21833415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005016137,0.000109951354,0.0010985122,0.0019604906,0.00006165113,0.00006368621,0.000032165393,0.0017952422,0.00026119038,0.00110583,0.9752679,0.017741673],"study_design_scores_gemma":[0.0073726154,0.0006795943,0.012316584,0.0016266078,0.0003027655,0.0005164042,0.00031796965,0.028819542,0.0070823194,0.036347926,0.9043501,0.0002675841],"about_ca_topic_score_codex":0.0029558884,"about_ca_topic_score_gemma":0.006118833,"teacher_disagreement_score":0.83009416,"about_ca_system_score_codex":0.0007476185,"about_ca_system_score_gemma":0.0013932223,"threshold_uncertainty_score":0.2423501},"labels":[],"label_agreement":null},{"id":"W6976661708","doi":"10.60692/x846g-r0p96","title":"Supplementing recurrent neural networks with annealing to solve combinatorial optimization problems","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"","keywords":"Travelling salesman problem; Simulated annealing; Combinatorial optimization; Extremal optimization; Optimization problem; Scheduling (production processes); Recurrent neural network; Cross-entropy method; Artificial neural network","score_opus":0.039404107213096104,"score_gpt":0.24525164028821142,"score_spread":0.20584753307511533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976661708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12833568,0.00077983615,0.8634343,0.00054049207,0.00011487795,0.00008787006,0.000035863566,0.00076333917,0.005907765],"genre_scores_gemma":[0.7967056,0.0002478113,0.201183,0.00016219221,0.00004978709,0.00014822726,0.00007664772,0.00007929458,0.0013473934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993412,0.00038639762,0.00003303772,0.00007666803,0.00010555416,0.000057184094],"domain_scores_gemma":[0.99697185,0.0023741357,0.00018701707,0.00016085726,0.00025556498,0.00005050046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218887,0.00074106647,0.0010147566,0.0007628534,0.00039844017,0.0009371771,0.0011743071,0.0013959263,0.0012693662],"category_scores_gemma":[0.006131635,0.0006474945,0.0006539994,0.0006976467,0.0007850242,0.0011427281,0.0007265429,0.0011528763,0.0002190856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019241566,0.000027005619,0.00027135905,0.000022311564,0.00002590382,0.0000113865935,0.000015089245,0.9851698,0.000518727,0.0021714263,0.00012713128,0.011620541],"study_design_scores_gemma":[0.0000017479005,0.000007658858,0.000018632862,0.0000013452814,0.0000019557497,0.0000011772478,0.0000012876931,0.9993043,0.000106533946,0.00050470716,0.000049803242,8.46094e-7],"about_ca_topic_score_codex":0.008583184,"about_ca_topic_score_gemma":0.009096987,"teacher_disagreement_score":0.008583184,"about_ca_system_score_codex":0.0010446487,"about_ca_system_score_gemma":0.0011135049,"threshold_uncertainty_score":0.017066479},"labels":[],"label_agreement":null},{"id":"W6977527521","doi":"10.6084/m9.figshare.26737995","title":"Additional file 3 of BETTER LIFE- guidelines for chronic disease preventive care for people aged 18–39 years: a literature review","year":2024,"lang":"en","type":"dataset","venue":"Figshare","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regional Municipality of Durham; University of Toronto; Sunnybrook Health Science Centre; University of Alberta; Lunenfeld-Tanenbaum Research Institute; Women's College Hospital; McMaster University; Centre for Addiction and Mental Health; Ontario Institute for Cancer Research; Memorial University of Newfoundland; Public Health Agency of Canada","funders":"","keywords":"Preventive care; Chronic disease; Chronic care; Preventive healthcare; Disease; MEDLINE","score_opus":0.06200788366481726,"score_gpt":0.36640335456980916,"score_spread":0.3043954709049919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977527521","genre_codex":"dataset","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000055720287,0.00007978671,0.000028329026,0.00008460792,0.000011664379,0.000032127486,0.99935156,0.000029088997,0.00032700849],"genre_scores_gemma":[0.002268786,0.00038803378,0.0009223579,0.00045626072,0.000049738235,0.0012965829,0.99212587,0.000107848595,0.0023844605],"study_design_codex":"not_applicable","study_design_gemma":"systematic_review","domain_scores_codex":[0.99880767,0.00022881036,0.0003397022,0.00028930407,0.00018404936,0.00015045727],"domain_scores_gemma":[0.9842652,0.010842462,0.0015290801,0.00054622075,0.0023987107,0.00041825956],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016454675,0.0013230041,0.0020918606,0.004627385,0.00073409145,0.002275327,0.0023087196,0.0020338015,0.5840604],"category_scores_gemma":[0.026918042,0.0006098822,0.0023798994,0.0074399174,0.00028475892,0.0017340174,0.0015724135,0.0014480884,0.07152917],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002725326,0.00004411392,0.0017040846,0.01635819,0.00015393893,0.00003437831,0.000038638533,0.0003370643,0.0000437309,0.00066521764,0.97554386,0.004804396],"study_design_scores_gemma":[0.005184065,0.00013850981,0.020343613,0.018057851,0.0008913138,0.00029138016,0.00036022946,0.0009876965,0.00031269618,0.0065218215,0.94678354,0.00012728946],"about_ca_topic_score_codex":0.01595799,"about_ca_topic_score_gemma":0.039077852,"teacher_disagreement_score":0.5840604,"about_ca_system_score_codex":0.0020761094,"about_ca_system_score_gemma":0.0035912488,"threshold_uncertainty_score":0.59328735},"labels":[],"label_agreement":null},{"id":"W6986700221","doi":"","title":"Proposing effective coordinate search methods for solving large-scale expensive black-box optimization problems","year":2021,"lang":"en","type":"dissertation","venue":"e-scholar@UOIT (University of Ontario Institute of Technology)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"University of Ontario Institute of Technology","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Hyporeflexia; Articular cartilage damage; Proteogenomics","score_opus":0.016421626955853405,"score_gpt":0.29095357744942374,"score_spread":0.2745319504935703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986700221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041072927,0.0005585335,0.9926252,0.0001388287,0.00007295798,0.000050001552,0.000020146274,0.00019673796,0.0022303062],"genre_scores_gemma":[0.13482468,0.0009550651,0.8595022,0.00024351616,0.00018387612,0.00049432367,0.00016714002,0.00022542343,0.003403802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992599,0.00027953152,0.000038989943,0.000116743875,0.0002324359,0.00007242732],"domain_scores_gemma":[0.9988661,0.0006642352,0.00010326935,0.00008741125,0.00022304754,0.00005608727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015613924,0.0014489369,0.0014213908,0.001047461,0.0005742607,0.0013125732,0.0016979405,0.0017672487,0.0028869952],"category_scores_gemma":[0.0034715994,0.0006352079,0.0011352645,0.0013580382,0.0010783051,0.0013199704,0.0015144756,0.0019176506,0.00084082363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010717418,0.00009980152,0.00060659036,0.00022280765,0.00011742359,0.00008620397,0.000082534956,0.84270537,0.0035444465,0.058912292,0.0045501376,0.08896522],"study_design_scores_gemma":[0.000023122398,0.000032123127,0.000045529505,0.000007974282,0.000008379114,0.000014708637,0.000006375333,0.99370426,0.0004643635,0.0044697495,0.0012175477,0.0000058867577],"about_ca_topic_score_codex":0.0024496093,"about_ca_topic_score_gemma":0.0021127528,"teacher_disagreement_score":0.0028869952,"about_ca_system_score_codex":0.0006751132,"about_ca_system_score_gemma":0.0014936642,"threshold_uncertainty_score":0.009657919},"labels":[],"label_agreement":null},{"id":"W6992790387","doi":"","title":"Mendelian and Non-Mendelian&#13;\\nAncestral Repair for Constrained&#13;\\nEvolutionary Optimisation","year":2013,"lang":"en","type":"dissertation","venue":"Arrow@dit (Dublin Institute of Technology)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Irish Research Council; Irish Research Council for Science, Engineering and Technology; Ireland Canada University Foundation","keywords":"Mendelian inheritance; Evolutionary algorithm; Representation (politics); Analogy; Hierarchy; Variety (cybernetics); Permutation (music)","score_opus":0.01992054704670037,"score_gpt":0.2858135342485377,"score_spread":0.26589298720183735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992790387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068127806,0.0047223507,0.9234543,0.003404721,0.0006314273,0.0000922675,0.00014605475,0.00023599157,0.060500037],"genre_scores_gemma":[0.27737933,0.00973212,0.6374983,0.0022671316,0.0005538968,0.00055661914,0.00037356064,0.0005476025,0.07109132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981384,0.0005632499,0.00010538621,0.0004215207,0.00064736843,0.00012400383],"domain_scores_gemma":[0.9980337,0.0010492485,0.0002537695,0.0004188475,0.00017515065,0.00006933657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019957656,0.0006397765,0.00046657358,0.0008568643,0.0008503903,0.0022820833,0.0017707918,0.001596961,0.01373285],"category_scores_gemma":[0.007139716,0.00034365366,0.00090754835,0.0011873019,0.002729475,0.002260288,0.0023325856,0.0024032176,0.0017838445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001821022,0.000020746249,0.00032423236,0.00017611422,0.000021203869,0.000072972776,0.00009502317,0.02734579,0.0015794314,0.9018692,0.0039872653,0.06448987],"study_design_scores_gemma":[0.00001938746,0.00005968467,0.0005614264,0.00028263518,0.000022253369,0.00036144612,0.00012371752,0.10222664,0.004537605,0.7450425,0.14671431,0.00004834956],"about_ca_topic_score_codex":0.0017451755,"about_ca_topic_score_gemma":0.0032279491,"teacher_disagreement_score":0.01373285,"about_ca_system_score_codex":0.0019415203,"about_ca_system_score_gemma":0.0021887044,"threshold_uncertainty_score":0.045940936},"labels":[],"label_agreement":null},{"id":"W6998725287","doi":"","title":"Appel à contribution - Approches écosystémiques de la santé","year":2011,"lang":"fr","type":"other","venue":"OpenEdition (OpenEdition)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Section (typography); Product (mathematics); Context (archaeology); Order (exchange); Subject (documents); Work (physics)","score_opus":0.02197874160009484,"score_gpt":0.2912412740495833,"score_spread":0.26926253244948845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6998725287","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015461249,0.009978183,0.20285921,0.026485352,0.0053127147,0.0019644375,0.006348507,0.005950775,0.7256394],"genre_scores_gemma":[0.26921326,0.010216136,0.21863294,0.0049622823,0.0014610072,0.0012279405,0.009979608,0.0013990668,0.48290786],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960181,0.0010342216,0.00015069729,0.00043181225,0.001964683,0.00040051574],"domain_scores_gemma":[0.9941268,0.0011794536,0.00025531222,0.0008196681,0.0028813959,0.00073742104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005474841,0.0009364287,0.0005073023,0.0013318539,0.0018035192,0.004657678,0.0018949294,0.002171927,0.053411502],"category_scores_gemma":[0.0076200096,0.00026863904,0.0009307501,0.0013946672,0.0007464987,0.0017876755,0.0023643607,0.001588572,0.014743906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005025188,0.00023896061,0.006882246,0.001263334,0.00024503836,0.00060051004,0.000975295,0.016505841,0.005810857,0.132792,0.4004549,0.43372852],"study_design_scores_gemma":[0.000083013,0.000055006767,0.0023309232,0.0003708507,0.00004270731,0.00018937752,0.00025271764,0.01299414,0.0021127183,0.0116894515,0.96985066,0.000028387303],"about_ca_topic_score_codex":0.10201155,"about_ca_topic_score_gemma":0.09977843,"teacher_disagreement_score":0.10201155,"about_ca_system_score_codex":0.005872338,"about_ca_system_score_gemma":0.010555543,"threshold_uncertainty_score":0.20283556},"labels":[],"label_agreement":null},{"id":"W7001309394","doi":"","title":"Interactive information complexity and its applications","year":2019,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Communication complexity; Boolean function; Information theory; Function (biology); Computational complexity theory; Coding (social sciences); Communication theory; Worst-case complexity; Coding theory","score_opus":0.027737032787927437,"score_gpt":0.28705673989725367,"score_spread":0.2593197071093262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001309394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050674625,0.022162423,0.67248625,0.021386104,0.0009400825,0.00026921232,0.0011705611,0.0005262448,0.23038442],"genre_scores_gemma":[0.8727926,0.01372516,0.08133901,0.0020448104,0.0031374104,0.000670163,0.00074161927,0.00025419786,0.02529498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99374336,0.0023368606,0.00034056776,0.0010153208,0.002021525,0.00054224854],"domain_scores_gemma":[0.9509787,0.040549196,0.0018808735,0.0027830787,0.0027792964,0.0010289018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042008874,0.0012940962,0.0017334215,0.0027471334,0.0020960234,0.0049837427,0.0021301017,0.0027643326,0.010267977],"category_scores_gemma":[0.033702932,0.00065592764,0.002155176,0.0032820906,0.00532477,0.008569476,0.00522544,0.0064727436,0.0011850907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024438881,0.000026439759,0.000280439,0.0001261984,0.000025333826,0.0000791431,0.00011250681,0.0138072865,0.00018162104,0.9758966,0.0018078843,0.0076321247],"study_design_scores_gemma":[0.000009051571,0.000010503472,0.00013050713,0.00003621962,0.000009286199,0.000050479928,0.000023943976,0.045760844,0.00013963661,0.9500222,0.003792408,0.000014819305],"about_ca_topic_score_codex":0.0029694794,"about_ca_topic_score_gemma":0.0011889708,"teacher_disagreement_score":0.010267977,"about_ca_system_score_codex":0.0072273663,"about_ca_system_score_gemma":0.0025872863,"threshold_uncertainty_score":0.052438438},"labels":[],"label_agreement":null},{"id":"W7007630604","doi":"","title":"Adaptive Heterogeneous Multi-Population Cultural Algorithm","year":2014,"lang":"en","type":"dissertation","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nucleofection; Genetic algorithm; Filter (signal processing); Term (time); Noise (video); Articular cartilage damage","score_opus":0.032661276843124455,"score_gpt":0.2751165961083047,"score_spread":0.24245531926518024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007630604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03062631,0.0006851295,0.95364666,0.00032273415,0.00015075206,0.00013230529,0.0000539648,0.00048621147,0.013895922],"genre_scores_gemma":[0.62216425,0.0007782071,0.36179668,0.00049453235,0.00011922293,0.0005924026,0.00031701347,0.00014368213,0.013594001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993599,0.00021334074,0.000029724593,0.00014592204,0.00016088622,0.00009022945],"domain_scores_gemma":[0.9993349,0.00027650179,0.00005923437,0.00007597088,0.00020339993,0.000050092807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009492646,0.0009381718,0.0011445066,0.000831321,0.0009089178,0.0015247276,0.0018321048,0.0013978647,0.003175329],"category_scores_gemma":[0.002939233,0.00033790967,0.0009886341,0.0008352817,0.0009360959,0.001079644,0.0014375013,0.0012822767,0.00070335483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007102364,0.00007347131,0.0013752794,0.00007504725,0.00010199567,0.00012333899,0.00013644168,0.8631416,0.003358702,0.022774102,0.002616099,0.1061529],"study_design_scores_gemma":[0.000018195753,0.00002394274,0.00012517576,0.0000074748045,0.000012952097,0.000028262473,0.000017722235,0.9944049,0.00048069397,0.0034317828,0.0014418743,0.0000070259675],"about_ca_topic_score_codex":0.0042318166,"about_ca_topic_score_gemma":0.0031659296,"teacher_disagreement_score":0.0042318166,"about_ca_system_score_codex":0.0009090005,"about_ca_system_score_gemma":0.0013760928,"threshold_uncertainty_score":0.010622501},"labels":[],"label_agreement":null},{"id":"W7021242","doi":"10.13140/2.1.1320.2568","title":"Swarm Intelligence: Concepts, Models and Applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.06248270455043398,"score_gpt":0.35855034225201193,"score_spread":0.29606763770157796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021242","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009948434,0.19043785,0.6169727,0.011365324,0.0036026533,0.00027747644,0.0010971529,0.0010245654,0.16527385],"genre_scores_gemma":[0.4583496,0.19466642,0.25132278,0.0026041307,0.0047765234,0.00091984944,0.0019583027,0.0004420529,0.0849603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993112,0.00018604075,0.00005282376,0.00011414797,0.0002912989,0.000044613935],"domain_scores_gemma":[0.9994603,0.000255623,0.00008725946,0.000058946498,0.00010569105,0.00003229564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007186784,0.0010425856,0.00085901597,0.0014232764,0.0004934347,0.0032143109,0.0007107859,0.0017632649,0.0047944956],"category_scores_gemma":[0.0018902798,0.00038182424,0.0006794902,0.0022302927,0.0019506392,0.0020562413,0.0013130377,0.0018666418,0.0023187448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006467039,0.000055250985,0.0013626004,0.0016746604,0.00011158323,0.00033164362,0.00060369895,0.092359036,0.0035511893,0.5473525,0.0536731,0.29886004],"study_design_scores_gemma":[0.000022886297,0.00011216554,0.0015247785,0.0006013869,0.000056414145,0.00074697053,0.0002963398,0.080377534,0.0013174871,0.55363756,0.36124596,0.000060497463],"about_ca_topic_score_codex":0.001404211,"about_ca_topic_score_gemma":0.0007752665,"teacher_disagreement_score":0.0047944956,"about_ca_system_score_codex":0.00090261735,"about_ca_system_score_gemma":0.00078736723,"threshold_uncertainty_score":0.016039252},"labels":[],"label_agreement":null},{"id":"W7027892469","doi":"","title":"Dum Dums - S02 E16 Project: Under Gardiner","year":2016,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Downtown; Space (punctuation); Public space; Selection (genetic algorithm)","score_opus":0.010997362687989924,"score_gpt":0.22727285138315587,"score_spread":0.21627548869516594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027892469","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034159017,0.0010762248,0.008289341,0.005534299,0.0023932797,0.0005585943,0.011402938,0.011483816,0.9558456],"genre_scores_gemma":[0.013306527,0.00058724947,0.005396055,0.0006565824,0.000228932,0.00015494703,0.010778036,0.0038592215,0.9650324],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987656,0.00018846031,0.000023331106,0.00024886866,0.00052083813,0.00025282011],"domain_scores_gemma":[0.9969193,0.00015386754,0.000078054174,0.00033792158,0.0012284806,0.0012824185],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018854163,0.0009698522,0.00059748,0.0010707394,0.0016337468,0.0050612087,0.0013702054,0.0015683493,0.46605822],"category_scores_gemma":[0.0031083005,0.00041004684,0.00045274248,0.0012697049,0.0006579637,0.0020294674,0.0029897117,0.0014351939,0.334662],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017905302,0.00009325452,0.00033706124,0.00010406409,0.0000050976723,0.000055365985,0.00008521137,0.00018640653,0.00095754943,0.00584161,0.93205905,0.060096223],"study_design_scores_gemma":[0.000023032688,0.000036899863,0.00019953508,0.00001760099,0.0000014044671,0.000027641805,0.00007393974,0.00022248052,0.00052515144,0.0004019833,0.99846613,0.000004326756],"about_ca_topic_score_codex":0.02348216,"about_ca_topic_score_gemma":0.042076245,"teacher_disagreement_score":0.53394175,"about_ca_system_score_codex":0.0024827986,"about_ca_system_score_gemma":0.0043955697,"threshold_uncertainty_score":0.7616031},"labels":[],"label_agreement":null},{"id":"W7033576020","doi":"","title":"Regularity of the Free Boundary in div(a(x) grad(u(x,y)) )= -(h(x) gamma(u))_x with h'(x)<0","year":2021,"lang":"en","type":"article","venue":"York University Digital Library (York University)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Boundary (topology); Free boundary problem; Boundary value problem; Type (biology); Singular boundary method","score_opus":0.00999196240901054,"score_gpt":0.1585666395401504,"score_spread":0.14857467713113987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033576020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42195165,0.0014964002,0.49032456,0.0033776474,0.0004864301,0.00016596387,0.00052744674,0.00021384959,0.081456065],"genre_scores_gemma":[0.92102075,0.00042777733,0.04724644,0.00022456495,0.00016664539,0.00014788863,0.00031480056,0.00023546598,0.030215712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996413,0.000117572265,0.000015784899,0.00008351923,0.000073094656,0.000068867404],"domain_scores_gemma":[0.9990798,0.00056983955,0.000099967816,0.000044254557,0.000107539854,0.00009859485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000851842,0.00061904785,0.00065844576,0.00076442206,0.0005930657,0.0020091552,0.00081665016,0.0016594502,0.003276584],"category_scores_gemma":[0.0037968464,0.00033941743,0.00059381314,0.0002954243,0.0018196832,0.0012255406,0.0014548905,0.0011066599,0.00041069978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037026216,0.00015356317,0.0025942808,0.00043169962,0.00010307787,0.0009000036,0.000448176,0.4723848,0.0186167,0.47331414,0.0068516214,0.023831546],"study_design_scores_gemma":[0.000030291963,0.00007471515,0.0010412108,0.00006640482,0.000019172578,0.00017074535,0.00020086991,0.8863081,0.0034904676,0.10424844,0.0043136887,0.000035858604],"about_ca_topic_score_codex":0.0025943604,"about_ca_topic_score_gemma":0.0014757821,"teacher_disagreement_score":0.003276584,"about_ca_system_score_codex":0.00072211516,"about_ca_system_score_gemma":0.0008678673,"threshold_uncertainty_score":0.010961294},"labels":[],"label_agreement":null},{"id":"W7034284105","doi":"","title":"Solution Properties Of Polyol Ester Lubricants Designed For Use With R-32 And Related Low GWP Refrigerant Blends","year":2014,"lang":"en","type":"article","venue":"Purdue e-Pubs (Purdue University System)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Refrigerant; Lubricant; Gas compressor; Refrigeration; Evaporator; Lubrication; Montreal Protocol; Solubility; Evaporation","score_opus":0.019498149196412802,"score_gpt":0.1957923654498471,"score_spread":0.1762942162534343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034284105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99443567,0.0020604925,0.0016430108,0.00004254249,0.00004818917,0.000037881546,0.00030034018,0.000047112524,0.001384732],"genre_scores_gemma":[0.9936459,0.0010852499,0.0022500714,0.000030594987,0.000010651873,0.000030659012,0.00048010383,0.000028638153,0.0024380754],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997373,0.000037059443,0.00003164275,0.00004415161,0.000106128056,0.000043585613],"domain_scores_gemma":[0.99972016,0.00005445672,0.0000649881,0.000014048524,0.00011990943,0.000026456211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003734373,0.00049289176,0.00021211458,0.00047505597,0.00019742282,0.0003224663,0.00024372547,0.00039706452,0.0020119413],"category_scores_gemma":[0.000736749,0.00015780238,0.0002592692,0.00039757643,0.00018073198,0.00043156196,0.00021149985,0.0003711582,0.0006138851],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035316657,0.000048848455,0.000583701,0.00016887074,0.0000144466,0.00008778185,0.00007301842,0.0007201105,0.9896179,0.00021193037,0.00020261572,0.007917689],"study_design_scores_gemma":[0.0000148626805,0.00092173397,0.0014540278,0.000016034304,0.000017053753,0.0000819684,0.000059501257,0.0018917036,0.99271214,0.000030132553,0.0027864284,0.000014429409],"about_ca_topic_score_codex":0.0015023663,"about_ca_topic_score_gemma":0.0011383449,"teacher_disagreement_score":0.0020119413,"about_ca_system_score_codex":0.00023176728,"about_ca_system_score_gemma":0.00024050959,"threshold_uncertainty_score":0.0067306757},"labels":[],"label_agreement":null},{"id":"W7034774657","doi":"","title":"The Use of Arguments about Myths and Stereotypes to Appeal Sexual Assault Convictions in Canada","year":2023,"lang":"en","type":"article","venue":"York University Digital Library (York University)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Conviction; Appeal; Sexual assault; Mythology; Doctrine; Plaintiff; Criminal law; Phenomenon; Derogation","score_opus":0.026798362186952515,"score_gpt":0.18909999317035373,"score_spread":0.16230163098340122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034774657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5353098,0.0056533013,0.0058867983,0.044190466,0.00031014415,0.00016142907,0.00021089689,0.000065269094,0.40821186],"genre_scores_gemma":[0.9860135,0.0010439912,0.001204086,0.0011286859,0.0000140084685,0.000014269184,0.0000306561,0.000011568648,0.010539268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.995233,0.001214892,0.00009594437,0.00022049651,0.0017070877,0.0015285229],"domain_scores_gemma":[0.99378973,0.0030390853,0.00043056253,0.00016556503,0.0018153993,0.0007596471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041941106,0.0002921467,0.00045622693,0.0017893091,0.013622681,0.0086119445,0.0018908188,0.002422265,0.0042808116],"category_scores_gemma":[0.016546875,0.0003242639,0.00041282704,0.0027235395,0.0083074225,0.0015463062,0.0023843527,0.003997164,0.00018807375],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024187558,0.00012914457,0.029386953,0.00030895285,0.0001079564,0.0011841657,0.029789222,0.012424457,0.0007299859,0.80822015,0.037008878,0.08046832],"study_design_scores_gemma":[0.0003627828,0.00016935052,0.11802261,0.002118367,0.00046895046,0.00061225146,0.17266142,0.09373121,0.0038512438,0.20803507,0.39950287,0.00046390007],"about_ca_topic_score_codex":0.9922955,"about_ca_topic_score_gemma":0.99676716,"teacher_disagreement_score":0.1277516,"about_ca_system_score_codex":0.1277516,"about_ca_system_score_gemma":0.11771473,"threshold_uncertainty_score":0.9269071},"labels":[],"label_agreement":null},{"id":"W7035947327","doi":"","title":"Acoustics Week in Canada 2021 - Post Conference Report","year":2022,"lang":"en","type":"article","venue":"Canadian acoustics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Noise (video); Physical acoustics","score_opus":0.021318579921741156,"score_gpt":0.2331912884597428,"score_spread":0.21187270853800164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7035947327","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021482393,0.007563429,0.0036157884,0.09169441,0.10482699,0.0011668674,0.03894727,0.0023849427,0.72831786],"genre_scores_gemma":[0.015142143,0.0009145354,0.00058218505,0.0017088524,0.0011347182,0.00008243407,0.004649978,0.00019072463,0.97559434],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997546,0.00005749572,0.00003188287,0.000121137105,0.0016050102,0.00063842407],"domain_scores_gemma":[0.9954006,0.00011233258,0.000058604084,0.00010771501,0.0027661235,0.0015546259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002056983,0.0010584943,0.0009232444,0.0012895149,0.0060140733,0.006527087,0.0014001235,0.0035630253,0.22046003],"category_scores_gemma":[0.0020409916,0.0004368111,0.0009377532,0.0013043508,0.0008649642,0.0008262958,0.0020245826,0.003204423,0.05072798],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011945376,0.000054190365,0.0010865665,0.00006150613,0.00001205504,0.00011126895,0.00007383636,0.00022344693,0.00079161837,0.001052823,0.9810972,0.015316075],"study_design_scores_gemma":[0.00002208023,0.00004730297,0.008876178,0.00004741579,0.000008311344,0.000025419982,0.0005213171,0.00025697693,0.00061476976,0.00025389565,0.9893042,0.000022089602],"about_ca_topic_score_codex":0.82769936,"about_ca_topic_score_gemma":0.94268703,"teacher_disagreement_score":0.22046003,"about_ca_system_score_codex":0.013829094,"about_ca_system_score_gemma":0.06403507,"threshold_uncertainty_score":0.73751223},"labels":[],"label_agreement":null},{"id":"W7036112418","doi":"","title":"As Ontario nears a child care deal, can it help end the she-cession?","year":2022,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Child care; Government (linguistics); Public policy; Plan (archaeology); Health insurance; Coalition government","score_opus":0.006961317961912365,"score_gpt":0.20552495439183566,"score_spread":0.19856363642992328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036112418","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072313542,0.010771081,0.0014947954,0.3237336,0.0066551934,0.00013174693,0.00295432,0.0005696716,0.64645815],"genre_scores_gemma":[0.024320696,0.008039952,0.0021467556,0.01650832,0.00036208815,0.000039309038,0.0008588684,0.00027702303,0.94744694],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990324,0.000069903035,0.000013790674,0.000066172885,0.00041947982,0.00039830783],"domain_scores_gemma":[0.99795246,0.00016230714,0.00009267281,0.00006487374,0.00059777143,0.001129811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074787793,0.0005185903,0.00040844784,0.0006235544,0.009652495,0.005498831,0.0008984721,0.0034056634,0.1819162],"category_scores_gemma":[0.0028822292,0.00041359357,0.0004878362,0.0019106278,0.0017204005,0.0027377948,0.001671059,0.0020527772,0.025438534],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022249294,0.00001018614,0.0010739677,0.00007068822,0.0000037146579,0.00010236247,0.00026769127,0.000064148924,0.00015025905,0.0034402546,0.97469795,0.020096466],"study_design_scores_gemma":[0.0000051989755,0.0000049781997,0.001839918,0.000048498314,0.0000037225589,0.000028554143,0.0011697835,0.00007316159,0.00006954222,0.0005738738,0.9961731,0.000009626069],"about_ca_topic_score_codex":0.91422504,"about_ca_topic_score_gemma":0.98547274,"teacher_disagreement_score":0.1819162,"about_ca_system_score_codex":0.028744115,"about_ca_system_score_gemma":0.05455865,"threshold_uncertainty_score":0.60857034},"labels":[],"label_agreement":null},{"id":"W7037208320","doi":"","title":"Dimensions of Critical Social Work Practice in India","year":2023,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Social change; Oppression; Social philosophy; Social work; Social position; Social order; Emancipation; Social relation; Social inequality","score_opus":0.29437557492255545,"score_gpt":0.6035562392970872,"score_spread":0.3091806643745318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037208320","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3795073,0.028655944,0.012132473,0.19614062,0.0015745178,0.0005035476,0.000058596077,0.0002112668,0.3812157],"genre_scores_gemma":[0.98677325,0.0043548564,0.002037494,0.0030594731,0.00015483901,0.00014013267,0.000010083483,0.000027188198,0.0034426707],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.96457267,0.023971202,0.001502904,0.0011643262,0.0042088088,0.0045801005],"domain_scores_gemma":[0.95901763,0.026552403,0.0036574076,0.0020263847,0.0027707343,0.005975393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013667522,0.0005045809,0.0004759423,0.0046778424,0.02900741,0.022465691,0.0025704645,0.0031700912,0.002693557],"category_scores_gemma":[0.020023022,0.0006361642,0.000528255,0.005871837,0.06996948,0.0055257315,0.02324579,0.008431782,0.0002910785],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003363084,0.000108369706,0.0035948688,0.0004660725,0.000019033112,0.0014784278,0.594429,0.00033725429,0.00041221545,0.36056665,0.0054549295,0.03309958],"study_design_scores_gemma":[0.00002304972,0.00009736814,0.0070741144,0.0019420384,0.000026288986,0.0017201134,0.6785191,0.00056531065,0.0005617966,0.10710137,0.20225295,0.000116460964],"about_ca_topic_score_codex":0.023670845,"about_ca_topic_score_gemma":0.017676113,"teacher_disagreement_score":0.02900741,"about_ca_system_score_codex":0.024757227,"about_ca_system_score_gemma":0.049541857,"threshold_uncertainty_score":0.17962712},"labels":[],"label_agreement":null},{"id":"W7045088565","doi":"","title":"Ant colony optimization with distributed colonies for dynamic environments on multiple GPUs","year":2024,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Exploit; Ant colony optimization algorithms; Ant colony; Space (punctuation); Genetic algorithm; Metaheuristic; Local search (optimization)","score_opus":0.011817361018235249,"score_gpt":0.22593788754631325,"score_spread":0.214120526528078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7045088565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18216921,0.0012894786,0.7842917,0.0012810486,0.00037671815,0.00021225911,0.00026267907,0.0037627958,0.026354175],"genre_scores_gemma":[0.49240085,0.0003585647,0.49966928,0.00017935151,0.000056553934,0.00020878264,0.00034875132,0.00039105705,0.006386726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970454,0.00008325611,0.000014585471,0.000060441263,0.00010290705,0.000034173878],"domain_scores_gemma":[0.9993912,0.00025168285,0.00004811364,0.00010883758,0.00015368522,0.000046425674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005144719,0.000651943,0.0007625176,0.0004583378,0.00058203674,0.0011221082,0.0013004898,0.00080334605,0.0022570353],"category_scores_gemma":[0.002056423,0.00032894188,0.00068251684,0.0006938223,0.00039558575,0.00081976916,0.0007431177,0.0011535638,0.00052734144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102328864,0.000101318954,0.0013250102,0.00006635281,0.00006255387,0.00012053469,0.00007753739,0.9274545,0.003239527,0.0058509847,0.0048634564,0.056735888],"study_design_scores_gemma":[0.000012687351,0.000007391093,0.00009761496,0.000002156104,0.0000031998168,0.000008076632,0.000009451792,0.99774545,0.00029057552,0.0010376622,0.00078401464,0.000001765892],"about_ca_topic_score_codex":0.011936721,"about_ca_topic_score_gemma":0.012357317,"teacher_disagreement_score":0.011936721,"about_ca_system_score_codex":0.0007516401,"about_ca_system_score_gemma":0.0011868915,"threshold_uncertainty_score":0.02373451},"labels":[],"label_agreement":null},{"id":"W7045912697","doi":"","title":"Building Virtual Reality Spaces for Visual Data Mining with Hybrid Evolutionary-Classical Optimization: Application to Microarray Gene Expression Data","year":2004,"lang":"en","type":"article","venue":"NPARC","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Particle swarm optimization; Raw data; Representation (politics); Visualization; Virtual reality; Expression (computer science); Synthetic data; Data visualization","score_opus":0.05433768294468588,"score_gpt":0.3434778197108166,"score_spread":0.2891401367661307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7045912697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014253289,0.0001610108,0.9844929,0.00012527556,0.000015364774,0.000034138047,0.000023903149,0.00027420875,0.00061984686],"genre_scores_gemma":[0.23969775,0.00030407248,0.75898105,0.000065441345,0.000023446477,0.00016451514,0.0000889187,0.00007158308,0.0006030643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945575,0.0002567011,0.000026090163,0.00008029044,0.00014496576,0.000036120084],"domain_scores_gemma":[0.99884343,0.00079370604,0.00007306787,0.0001141753,0.00013034952,0.000045119734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011724487,0.000630968,0.0008635309,0.00093292835,0.00039479346,0.0014922859,0.0006937975,0.00074939674,0.0008215624],"category_scores_gemma":[0.003071396,0.0004382118,0.0011562261,0.000813888,0.0007948682,0.0010668203,0.0013889208,0.0007041046,0.00020729446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018153121,0.00015312432,0.0007586564,0.00019110755,0.00012109736,0.00018514726,0.0004264855,0.71674234,0.014554911,0.022313666,0.0012655319,0.24310644],"study_design_scores_gemma":[0.000012149508,0.00003326095,0.00017616634,0.0000074906006,0.000007724222,0.00004581898,0.000038045993,0.9907403,0.0030934599,0.0048003183,0.0010311798,0.000014086352],"about_ca_topic_score_codex":0.0014638361,"about_ca_topic_score_gemma":0.0009849928,"teacher_disagreement_score":0.0014922859,"about_ca_system_score_codex":0.00045402846,"about_ca_system_score_gemma":0.0003568689,"threshold_uncertainty_score":0.0062006116},"labels":[],"label_agreement":null},{"id":"W7083177629","doi":"10.29173/css310","title":"Daniel L. Duke, (ed). 1995. Teacher Evaluation Policy: From Accountability to Professional Development.","year":2001,"lang":"en","type":"article","venue":"Canadian Social Studies","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Accountability; Social studies; Educational assessment; Professional development; Evaluation methods; Social accounting; Higher education; Research methodology","score_opus":0.10416017391719383,"score_gpt":0.40682484256155405,"score_spread":0.3026646686443602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7083177629","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009590451,0.8508018,0.0065355278,0.07801114,0.0056242603,0.000030111643,0.0014346548,0.00016917985,0.056434225],"genre_scores_gemma":[0.042828597,0.85109115,0.0127268825,0.0043643606,0.0019034486,0.00008156203,0.0007647276,0.00011341436,0.08612593],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986137,0.00034643293,0.00012408949,0.00012284197,0.000670494,0.00012252678],"domain_scores_gemma":[0.99411017,0.002567357,0.00041248294,0.00016067187,0.0020103082,0.00073894265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029690063,0.0010937331,0.0007075078,0.0037390972,0.0021882975,0.0045315367,0.0013618474,0.004371216,0.026548838],"category_scores_gemma":[0.009803348,0.0007806434,0.0003192937,0.0051865256,0.001980168,0.0040981304,0.0012633187,0.002708816,0.01230099],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044313023,0.000017665714,0.001015563,0.0004457403,0.000010150691,0.000075469834,0.00038984916,0.00042977577,0.000068022266,0.014237853,0.73111695,0.25214863],"study_design_scores_gemma":[0.0000133905905,0.000011014464,0.002525287,0.0013445975,0.00002179562,0.00014582592,0.00060200907,0.00035242835,0.00031226076,0.016708415,0.9779363,0.000026650923],"about_ca_topic_score_codex":0.17549594,"about_ca_topic_score_gemma":0.45140257,"teacher_disagreement_score":0.17549594,"about_ca_system_score_codex":0.008602793,"about_ca_system_score_gemma":0.012386678,"threshold_uncertainty_score":0.34894884},"labels":[],"label_agreement":null},{"id":"W7084107166","doi":"10.64628/aam.7can3n4np","title":"How Canada can solve its emerging water crisis","year":2019,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"","score_opus":0.013201695508685525,"score_gpt":0.22886325757350334,"score_spread":0.21566156206481782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084107166","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06891882,0.0032193272,0.01214476,0.33576316,0.0035620483,0.00024936747,0.0018535419,0.000677471,0.57361144],"genre_scores_gemma":[0.7773041,0.003270965,0.01682706,0.02934918,0.0003403923,0.00011331481,0.0008953555,0.0003276163,0.17157194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986008,0.0001778055,0.000020853937,0.00007261102,0.00041689308,0.0007110955],"domain_scores_gemma":[0.998367,0.00013380089,0.000045555902,0.00005222223,0.00082659564,0.0005748076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011804119,0.00044349255,0.00032133725,0.0009141902,0.0060967123,0.00796998,0.0015108364,0.0036675434,0.018383754],"category_scores_gemma":[0.0061332737,0.00019938266,0.00061068457,0.0014964202,0.0022580954,0.0020143632,0.0022790073,0.003197794,0.0013476613],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020726638,0.00015794391,0.007626337,0.00018817453,0.00014803113,0.0006228074,0.001050118,0.03797504,0.0008121163,0.33569592,0.51870644,0.09680975],"study_design_scores_gemma":[0.00015762441,0.000075604636,0.0046274606,0.00027059988,0.00010129241,0.00012088548,0.009357771,0.028906163,0.000904044,0.11851285,0.8368433,0.00012240648],"about_ca_topic_score_codex":0.98013616,"about_ca_topic_score_gemma":0.98817897,"teacher_disagreement_score":0.041318182,"about_ca_system_score_codex":0.041318182,"about_ca_system_score_gemma":0.17954151,"threshold_uncertainty_score":0.2997858},"labels":[],"label_agreement":null},{"id":"W7098023222","doi":"","title":"Report 6: Diversity in Evolutionary Ensembles of Artificial Neural Networks 1 Summary","year":2006,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Diversity (politics); Artificial neural network; Plan (archaeology); Focus (optics); Population; Advice (programming)","score_opus":0.030840359215198464,"score_gpt":0.26791330950453646,"score_spread":0.237072950289338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098023222","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12416199,0.012066259,0.7714314,0.010371876,0.0047741914,0.0005917621,0.0015608453,0.0038139664,0.071227744],"genre_scores_gemma":[0.5012997,0.009008088,0.37732908,0.0012451871,0.002645485,0.0006090483,0.0048343763,0.0012653836,0.101763666],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99728775,0.0007796757,0.00012881955,0.0002298284,0.00143294,0.00014098655],"domain_scores_gemma":[0.9934097,0.002751712,0.00018690844,0.0009282543,0.0023699938,0.00035341506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054422757,0.0005738799,0.0008303631,0.0007304515,0.0005507494,0.0027443042,0.0011592639,0.0010646143,0.008721594],"category_scores_gemma":[0.013752459,0.00029803487,0.00086102536,0.0009899046,0.00046976842,0.0022518504,0.0014130824,0.00253901,0.0020798973],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048007292,0.00040991837,0.003209053,0.0007320859,0.000285076,0.0002607494,0.00054098724,0.27769595,0.011466192,0.04124436,0.085037716,0.5786378],"study_design_scores_gemma":[0.00015023325,0.0016361151,0.004489752,0.00038427665,0.0001391389,0.00059296016,0.00040980263,0.71090084,0.067835435,0.056089118,0.15723404,0.00013828893],"about_ca_topic_score_codex":0.0012609342,"about_ca_topic_score_gemma":0.0013614739,"teacher_disagreement_score":0.008721594,"about_ca_system_score_codex":0.00064354425,"about_ca_system_score_gemma":0.00072282704,"threshold_uncertainty_score":0.029176652},"labels":[],"label_agreement":null},{"id":"W7104113099","doi":"","title":"Investigation of Performance and Scalability of a Quantum-Inspired Evolutionary Optimizer (QIEO) on NVIDIA GPU","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Scalability; Evolutionary algorithm; Kernel (algebra); Probabilistic logic; Knapsack problem; Memory management; Memory footprint; Metaheuristic; Evolutionary computation","score_opus":0.049831613670216525,"score_gpt":0.2839702158413225,"score_spread":0.23413860217110596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104113099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9612508,0.0003685138,0.023490034,0.00024374842,0.00005581413,0.000047384336,0.00018316114,0.0010607911,0.013299821],"genre_scores_gemma":[0.9787486,0.00011303594,0.01989939,0.000039971717,0.0000055833893,0.000035233832,0.00021347636,0.00009447893,0.0008501734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996387,0.0000807638,0.000016064823,0.00006586245,0.00012912347,0.00006939644],"domain_scores_gemma":[0.9993013,0.00034198197,0.000031934924,0.00010612538,0.0001691779,0.00004947352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007349485,0.00041552924,0.00042676504,0.00041471186,0.0003817065,0.0005691623,0.00078289356,0.00044684214,0.0014625918],"category_scores_gemma":[0.0026082515,0.00018622293,0.00025832542,0.0006671622,0.00039386854,0.0006588836,0.0004220683,0.0005728536,0.00021563463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074201013,0.0005106134,0.014589332,0.00026714033,0.00014903181,0.00040599154,0.00030584153,0.81056964,0.061593965,0.011166776,0.006586858,0.09311288],"study_design_scores_gemma":[0.000021052034,0.00011840094,0.0018522649,0.000005162601,0.000008591794,0.000019959247,0.00003293967,0.9897196,0.0070131076,0.000469566,0.0007320112,0.0000073792617],"about_ca_topic_score_codex":0.0064934967,"about_ca_topic_score_gemma":0.0050694416,"teacher_disagreement_score":0.0064934967,"about_ca_system_score_codex":0.0007009135,"about_ca_system_score_gemma":0.0007467898,"threshold_uncertainty_score":0.012911439},"labels":[],"label_agreement":null},{"id":"W7110041880","doi":"10.1016/j.swevo.2025.102237","title":"A complementary heterogeneity-driven adaptive balance search method for cognitive-only particle swarm optimization family","year":2025,"lang":"en","type":"article","venue":"Swarm and Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Metaheuristic; Balance (ability); Optimization algorithm; Swarm behaviour","score_opus":0.043815077622409535,"score_gpt":0.35555934840301373,"score_spread":0.3117442707806042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110041880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014641769,0.00035754655,0.97441137,0.00018674247,0.00013660845,0.00006197894,0.000031615196,0.00014874371,0.010023578],"genre_scores_gemma":[0.61494,0.0005289985,0.36689004,0.0003176106,0.00027213868,0.00047562053,0.0002000621,0.0002270523,0.016148524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979895,0.00005072303,0.000008935779,0.000029956198,0.000092140566,0.000019310728],"domain_scores_gemma":[0.9997656,0.00008283068,0.000019888235,0.000022883403,0.00008641,0.000022405986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940084,0.00064417225,0.0007837576,0.0007428366,0.0005347122,0.00080158195,0.0014158012,0.0009875788,0.0034063382],"category_scores_gemma":[0.0013307439,0.00028693397,0.0005655952,0.0006387432,0.00046057865,0.00084302376,0.0013430101,0.0007219377,0.00057470537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022196412,0.00013842434,0.0009644119,0.0001721272,0.00013908453,0.00010200397,0.00012333045,0.70474,0.009583238,0.070947535,0.0055294726,0.2073384],"study_design_scores_gemma":[0.000012003258,0.000023663099,0.00006372606,0.0000039598704,0.000007874646,0.000011622114,0.0000039906695,0.9965379,0.00024607312,0.0022852195,0.00080042944,0.000003470091],"about_ca_topic_score_codex":0.0019530014,"about_ca_topic_score_gemma":0.0016642761,"teacher_disagreement_score":0.0034063382,"about_ca_system_score_codex":0.00041950232,"about_ca_system_score_gemma":0.0006308513,"threshold_uncertainty_score":0.011395335},"labels":[],"label_agreement":null},{"id":"W7116060953","doi":"10.2139/ssrn.5940066","title":"A Reinforcement Learning Framework for Shuffled Multi Opposition-Based Learning Evolutionary Algorithm","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Evolutionary algorithm; Reinforcement learning; Population; Benchmark (surveying); Evolutionary computation; Differential evolution; Evolutionary acquisition of neural topologies; Evolutionary programming","score_opus":0.025013386638866122,"score_gpt":0.3242860407468878,"score_spread":0.29927265410802173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116060953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044928426,0.00014676654,0.99188447,0.00010813251,0.00004556582,0.00003281363,0.000013232654,0.00009416046,0.003181943],"genre_scores_gemma":[0.59685796,0.00039077975,0.39082703,0.00017266009,0.000103243416,0.00034072358,0.00007839924,0.00013232035,0.011096819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.00028536952,0.000026816742,0.00007016662,0.00017930512,0.000060428367],"domain_scores_gemma":[0.9993113,0.00033278333,0.00006071646,0.000055302055,0.00018369491,0.00005615515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015779374,0.0005461221,0.0011426008,0.0005291109,0.00047226483,0.0010013079,0.0022403488,0.0012343721,0.004520526],"category_scores_gemma":[0.0027965063,0.00035548452,0.00053179293,0.000622243,0.000948366,0.0010629102,0.0017241276,0.0015456576,0.0006057402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038377668,0.000054957694,0.00018341187,0.00004155437,0.000027043192,0.00005058809,0.000041967643,0.8940437,0.0008796821,0.066194154,0.00074846495,0.03769614],"study_design_scores_gemma":[0.0000070245296,0.00001530535,0.00001769733,0.0000033608092,0.0000022925526,0.0000070228352,0.0000023716957,0.9918433,0.000085619875,0.007573972,0.00043941726,0.0000027083859],"about_ca_topic_score_codex":0.002559875,"about_ca_topic_score_gemma":0.0019986073,"teacher_disagreement_score":0.004520526,"about_ca_system_score_codex":0.0008773061,"about_ca_system_score_gemma":0.0010599096,"threshold_uncertainty_score":0.015122712},"labels":[],"label_agreement":null},{"id":"W7124132478","doi":"10.65109/daod4524","title":"Particle Field Optimization: A New Paradigm for Swarm Intelligence","year":2015,"lang":"","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Particle swarm optimization; Multi-swarm optimization; Perspective (graphical); Swarm intelligence; Set (abstract data type); Field (mathematics); Swarm behaviour","score_opus":0.1431479151416756,"score_gpt":0.3633373548475413,"score_spread":0.2201894397058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124132478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018142534,0.006002759,0.9756654,0.0020952753,0.00046520066,0.00006803094,0.000074852374,0.00017571321,0.013638465],"genre_scores_gemma":[0.20628735,0.02410187,0.7487849,0.001513817,0.0027671068,0.00062504417,0.00029651014,0.00021346012,0.015409915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923897,0.00025800226,0.000039466704,0.00012284613,0.00030237655,0.000038495073],"domain_scores_gemma":[0.9995308,0.00023324511,0.000057452213,0.00007044981,0.00007429163,0.00003388003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011812239,0.00092481374,0.0012896569,0.0009109874,0.0006395265,0.0024802359,0.0015576169,0.0017533704,0.002010808],"category_scores_gemma":[0.0020117154,0.0003433864,0.00089075236,0.0013235599,0.0021871107,0.0029442708,0.0017068384,0.0027320255,0.000765618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024618073,0.000024568726,0.00034232342,0.00023454611,0.000052900985,0.00008809431,0.00017082789,0.09585975,0.0012780315,0.8343977,0.0066700545,0.060856584],"study_design_scores_gemma":[0.00003884097,0.000081446124,0.00022781674,0.00011150981,0.000022544931,0.00015324546,0.00006356256,0.32831982,0.0006652554,0.59190357,0.078374796,0.00003755506],"about_ca_topic_score_codex":0.0018132715,"about_ca_topic_score_gemma":0.0010067679,"teacher_disagreement_score":0.0024802359,"about_ca_system_score_codex":0.00088919466,"about_ca_system_score_gemma":0.0012157301,"threshold_uncertainty_score":0.006726861},"labels":[],"label_agreement":null},{"id":"W7125601733","doi":"10.18280/jesa.581220","title":"Metaheuristic Optimization of Artificial Neural Networks: A Comprehensive Survey of Techniques, Taxonomies, and Trends (2015–2025)","year":2025,"lang":"","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Artificial neural network; Metaheuristic; Key (lock); Feature (linguistics); Particle swarm optimization","score_opus":0.04764957865696947,"score_gpt":0.31521428469322416,"score_spread":0.2675647060362547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125601733","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054077096,0.8656756,0.10100557,0.0055992324,0.0013695513,0.00008503157,0.0004555839,0.00054586824,0.019855822],"genre_scores_gemma":[0.036398284,0.85078764,0.10035857,0.0019153483,0.0016515413,0.0001603651,0.001353504,0.0003696537,0.007005125],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991314,0.00020185775,0.00012376075,0.0001586034,0.00033532752,0.00004918151],"domain_scores_gemma":[0.9981951,0.0009134976,0.00017793951,0.0001433082,0.00050935015,0.000060955383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018077726,0.0011021711,0.0007675228,0.0036867491,0.00044844532,0.002452006,0.00086984754,0.001073899,0.0031505015],"category_scores_gemma":[0.004813029,0.00052820874,0.00084263546,0.0064997165,0.0006747324,0.0027401508,0.0010176842,0.0019668094,0.0017250018],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005281803,0.000085239226,0.001321562,0.003420579,0.00010464636,0.000039895767,0.00015925667,0.011862336,0.0012596983,0.042260837,0.028347997,0.9110852],"study_design_scores_gemma":[0.00001984929,0.0002261672,0.0026238586,0.006228889,0.00012068339,0.00036948844,0.0003632941,0.03756998,0.0023532691,0.068385445,0.88162947,0.00010958752],"about_ca_topic_score_codex":0.0026225732,"about_ca_topic_score_gemma":0.0042006536,"teacher_disagreement_score":0.0036867491,"about_ca_system_score_codex":0.0012066874,"about_ca_system_score_gemma":0.0015678492,"threshold_uncertainty_score":0.010539472},"labels":[],"label_agreement":null},{"id":"W7126427103","doi":"10.21428/594757db.ed5be436","title":"Stochastic Grouping and Subspace-Based Initialization inDecomposition and Merging Cooperative Particle SwarmOptimization for Large-Scale Optimization Problems","year":2024,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Initialization; Particle swarm optimization; Focus (optics); Metaheuristic; Stochastic optimization; Optimization problem; Multi-swarm optimization; Decomposition","score_opus":0.023636840546449232,"score_gpt":0.2934069638802422,"score_spread":0.26977012333379297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126427103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030895004,0.00022908176,0.9662597,0.000093365394,0.000031322023,0.000036632675,0.000016450891,0.0004403547,0.0019980895],"genre_scores_gemma":[0.5117241,0.00023331986,0.4857289,0.00008598228,0.000038262737,0.00014446046,0.0001865911,0.000101595084,0.0017567798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929214,0.0002574406,0.000038513648,0.00009314975,0.00023829627,0.00008051828],"domain_scores_gemma":[0.9991204,0.00030094406,0.00016468277,0.0001635328,0.00018745764,0.00006291087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012715625,0.0008318829,0.00072711264,0.0006641504,0.00066666293,0.0007118274,0.0010087154,0.00072241185,0.001025713],"category_scores_gemma":[0.0023653272,0.00035589671,0.0007737387,0.001126202,0.0007288439,0.0010651519,0.0016187317,0.0008201079,0.00034933284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006998628,0.00008488643,0.001230084,0.000051397623,0.000046401346,0.000059788377,0.00013005143,0.8858612,0.0067573893,0.0115458425,0.001175133,0.092987835],"study_design_scores_gemma":[0.000009442494,0.000050681254,0.00023480343,0.0000040457417,0.0000060794396,0.000017976316,0.000014181027,0.99433714,0.0020317028,0.0022246724,0.0010621352,0.000007217296],"about_ca_topic_score_codex":0.0034173422,"about_ca_topic_score_gemma":0.004159271,"teacher_disagreement_score":0.0034173422,"about_ca_system_score_codex":0.0005300238,"about_ca_system_score_gemma":0.0012287152,"threshold_uncertainty_score":0.0067949295},"labels":[],"label_agreement":null},{"id":"W72737831","doi":"","title":"An Ant Colony Optimization Metaheuristic for the Undirected Rural Postman Problem","year":2007,"lang":"en","type":"article","venue":"IRIS eCampus Telematic University (Università degli Studi eCampus)","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Ministero dell'Università e della Ricerca; Università della Calabria","keywords":"Metaheuristic; Parallel metaheuristic; Ant colony optimization algorithms; Heuristics; Mathematical optimization; Benchmark (surveying); Heuristic; Set (abstract data type); Computer science; Ant colony; Algorithm; Mathematics; Meta-optimization; Geography","score_opus":0.014616444199647619,"score_gpt":0.25784917914268646,"score_spread":0.24323273494303885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W72737831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032886613,0.00054883753,0.95054597,0.00024795323,0.00012990214,0.00021091032,0.00012869496,0.0004093394,0.014891778],"genre_scores_gemma":[0.19198808,0.00053623354,0.79633963,0.00017235448,0.00005275599,0.0002916352,0.00028817105,0.00016139714,0.010169719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997993,0.00006585997,0.000008436798,0.000032797703,0.000063409316,0.000030189693],"domain_scores_gemma":[0.99980646,0.000093448674,0.000038363993,0.000022152488,0.00002039592,0.00001920483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033428657,0.0005982182,0.00061822654,0.000466695,0.00049187307,0.00053385156,0.0010320422,0.0007493754,0.0030562778],"category_scores_gemma":[0.0006555426,0.0002798025,0.000500545,0.0007270246,0.0003242299,0.0007594288,0.00054247497,0.00087557326,0.00045504796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103427774,0.00021163793,0.00051597256,0.00018952694,0.00006364476,0.00019733899,0.00006918773,0.75223583,0.006320942,0.030449614,0.004286997,0.20535584],"study_design_scores_gemma":[0.00006131335,0.00018010722,0.00021976871,0.000023207607,0.00003071695,0.00012487637,0.00003718584,0.9742149,0.0021914814,0.0111781545,0.011724665,0.000013663179],"about_ca_topic_score_codex":0.0016275248,"about_ca_topic_score_gemma":0.0035935976,"teacher_disagreement_score":0.0030562778,"about_ca_system_score_codex":0.00045616893,"about_ca_system_score_gemma":0.0008272774,"threshold_uncertainty_score":0.010224283},"labels":[],"label_agreement":null},{"id":"W835739657","doi":"10.4018/ijaec.2015010101","title":"A Modified SSLPS Algorithm with Logistic Pseudo-Random Sequence Generator for Improving the Performance of Neka Power Plant","year":2015,"lang":"en","type":"article","venue":"International Journal of Applied Evolutionary Computation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Metaheuristic; Pareto principle; Logistic map; Computer science; Mathematical optimization; Chaotic; Tabu search; Heuristic; Multi-objective optimization; Parallel metaheuristic; Context (archaeology); Mathematics; Artificial intelligence; Meta-optimization","score_opus":0.043693870595947,"score_gpt":0.291443186373783,"score_spread":0.24774931577783602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W835739657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07613018,0.0007070403,0.91384417,0.00025335967,0.00011699518,0.00017766931,0.000067812034,0.0008665731,0.00783619],"genre_scores_gemma":[0.7475503,0.00030151563,0.24615277,0.00013849873,0.000047414153,0.00039673113,0.00023484863,0.00010637503,0.005071632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996087,0.0001303483,0.000029176228,0.00006146299,0.00011518125,0.000055110097],"domain_scores_gemma":[0.99955434,0.0002108683,0.000050661944,0.000028863029,0.00012676018,0.000028515367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067734334,0.00080617925,0.00088108674,0.00087787636,0.0003809965,0.0007259837,0.0011750612,0.0008224789,0.002432287],"category_scores_gemma":[0.0017108383,0.0002887149,0.0005984614,0.0007214036,0.00041950232,0.0006371138,0.0006941143,0.000743559,0.00048654078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001372484,0.00009650628,0.0006984941,0.00009539013,0.000049786166,0.00010742178,0.000063182655,0.8867004,0.004699151,0.004802239,0.0013998909,0.10115027],"study_design_scores_gemma":[0.000017090251,0.00005428692,0.0000787304,0.000003950744,0.0000058569067,0.000017779525,0.0000065881873,0.99815434,0.0006448726,0.00052990887,0.00048188082,0.000004713838],"about_ca_topic_score_codex":0.0030196458,"about_ca_topic_score_gemma":0.0020455595,"teacher_disagreement_score":0.0030196458,"about_ca_system_score_codex":0.0004993791,"about_ca_system_score_gemma":0.0011195004,"threshold_uncertainty_score":0.008136809},"labels":[],"label_agreement":null},{"id":"W937610320","doi":"","title":"Neural network models for combinatorial optimization: A survey of deterministic, stochastic and chaotic approaches","year":2002,"lang":"en","type":"article","venue":"Control and Cybernetics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Stochastic neural network; Artificial neural network; Computer science; Heuristic; Chaotic; Class (philosophy); Artificial intelligence; Cellular neural network; Mathematical optimization; Stochastic optimization; Combinatorial optimization; Time delay neural network; Algorithm; Mathematics","score_opus":0.07326862679551169,"score_gpt":0.24879682713628098,"score_spread":0.1755282003407693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W937610320","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048498283,0.20143777,0.75657165,0.00279263,0.0005776487,0.00006440509,0.00018704905,0.00020429048,0.033314697],"genre_scores_gemma":[0.18322928,0.48211145,0.3099488,0.0008890336,0.002631236,0.00045409214,0.0005515783,0.00023235063,0.01995215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953496,0.0001754469,0.000037945003,0.000050506304,0.00017442238,0.000026751093],"domain_scores_gemma":[0.999456,0.00035777982,0.00004383192,0.000038680682,0.00008596674,0.000017683502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000960719,0.0013152179,0.0014395638,0.0014798816,0.00040387886,0.0018632058,0.0016819793,0.0015094142,0.002603376],"category_scores_gemma":[0.0020049957,0.00054520887,0.00077610475,0.0032800604,0.001008513,0.0025106394,0.0009883064,0.001468791,0.0007255462],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031977157,0.000072176015,0.0005176981,0.0012738651,0.0001053467,0.00010767659,0.00009362547,0.36752102,0.0004137258,0.45738778,0.006998659,0.1654764],"study_design_scores_gemma":[0.0000148528325,0.000043195956,0.00023635745,0.00028678647,0.000030169276,0.00014166017,0.000059584676,0.54389966,0.0003032289,0.39408603,0.06086258,0.000035927904],"about_ca_topic_score_codex":0.003236277,"about_ca_topic_score_gemma":0.0036722491,"teacher_disagreement_score":0.003236277,"about_ca_system_score_codex":0.001186796,"about_ca_system_score_gemma":0.0010551306,"threshold_uncertainty_score":0.008709192},"labels":[],"label_agreement":null},{"id":"W964171983","doi":"10.1007/978-3-642-45318-2_14","title":"Incorporating Highly Explorative Methods to Improve the Performance of Variable Neighborhood Search","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Variable neighborhood search; Computer science; Differential evolution; Metaheuristic; Mathematical optimization; Evolutionary algorithm; Population; Job shop scheduling; Scheduling (production processes); Artificial intelligence; Mathematics","score_opus":0.03228913992110071,"score_gpt":0.3096697860617132,"score_spread":0.2773806461406125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W964171983","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07005991,0.0019303294,0.91762084,0.00015923008,0.00020045429,0.000066184504,0.000042018986,0.00075163844,0.009169441],"genre_scores_gemma":[0.54288864,0.00058291305,0.4507988,0.0001410666,0.00009866724,0.0001473935,0.000104483355,0.00026204562,0.004976033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995072,0.00022778881,0.000023034065,0.000056683657,0.00014385257,0.0000415082],"domain_scores_gemma":[0.99817705,0.0011971578,0.00010402487,0.00024514235,0.00022788694,0.000048747752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001277301,0.0007544646,0.0008818406,0.0005704394,0.00040218185,0.00079019764,0.0012031399,0.00081403414,0.002133185],"category_scores_gemma":[0.0046022222,0.00027570516,0.00042142364,0.0006901037,0.00046636173,0.0013650196,0.0012695713,0.0009768552,0.00044124937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033597925,0.00027148167,0.0012118658,0.00020140392,0.000119001954,0.00009636263,0.00016371245,0.66557634,0.013277908,0.03245696,0.0037520784,0.28253698],"study_design_scores_gemma":[0.000019158102,0.00007687381,0.00010541189,0.000011207812,0.000013876754,0.000030205534,0.000008955269,0.99261135,0.001858498,0.0042915307,0.00096589426,0.0000070234355],"about_ca_topic_score_codex":0.0008851038,"about_ca_topic_score_gemma":0.0016131834,"teacher_disagreement_score":0.002133185,"about_ca_system_score_codex":0.00027490905,"about_ca_system_score_gemma":0.0004907542,"threshold_uncertainty_score":0.0071362257},"labels":[],"label_agreement":null}]}